Is this Pascal's Matrix?Diamondize a MatrixCalculate the Kronecker sum of two matricesMatrix TrigonometryFold up a matrix!Eigenvalues of a MatrixGenerate all square sub-matrices of a given sizeHermitian matrix?Is this a Weyr matrix?Is the matrix centrosymmetric… and so is the code?Matrix Jigsaw Puzzles

Hackerrank All Women's Codesprint 2019: Name the Product

Why is indicated airspeed rather than ground speed used during the takeoff roll?

Why are there no stars visible in cislunar space?

How do researchers send unsolicited emails asking for feedback on their works?

What is it called when someone votes for an option that's not their first choice?

Why doesn't the chatan sign the ketubah?

CLI: Get information Ubuntu releases

Do people actually use the word "kaputt" in conversation?

What is the difference between something being completely legal and being completely decriminalized?

How are passwords stolen from companies if they only store hashes?

When should a starting writer get his own webpage?

Air travel with refrigerated insulin

How can I create URL shortcuts/redirects for task/diff IDs in Phabricator?

Why didn’t Eve recognize the little cockroach as a living organism?

Animating wave motion in water

PTIJ: Which Dr. Seuss books should one obtain?

Should a narrator ever describe things based on a characters view instead of fact?

Print last inputted byte

Why is "la Gestapo" feminine?

Norwegian Refugee travel document

TDE Master Key Rotation

Why is this tree refusing to shed its dead leaves?

The English Debate

How to balance a monster modification (zombie)?



Is this Pascal's Matrix?


Diamondize a MatrixCalculate the Kronecker sum of two matricesMatrix TrigonometryFold up a matrix!Eigenvalues of a MatrixGenerate all square sub-matrices of a given sizeHermitian matrix?Is this a Weyr matrix?Is the matrix centrosymmetric… and so is the code?Matrix Jigsaw Puzzles













6












$begingroup$


In Pascal's triangle each number is the sum of the two numbers directly above it, treating empty spots as zero:



Source: https://en.wikipedia.org/wiki/File:Pascal_triangle_small.png



By rotating the triangle, we can cut out square matrices of varying sizes and rotations which I will call Pascal's matrices. Note that those matrices always need to contain the top $1$. Here are some examples:



1 1 1 1
1 2 3 4
1 3 6 10
1 4 10 20

6 3 1
3 2 1
1 1 1

1 5 15 35 70
1 4 10 20 35
1 3 6 10 15
1 2 3 4 5
1 1 1 1 1

1

1 1
2 1


The Task



Given a square matrix containing positive numbers in any reasonable format, decide if it is a Pascal's matrix.



Decide means to either return truthy or falsy values depending on whether the input is a Pascal's matrix, or to fix two constant values and return one for the true inputs and the other for false inputs.



This is code-golf, so try to use as few bytes as possible in the language of your choice. The shortest code in each language wins, thus I will not accept an answer.



Test cases



True



[[1, 1, 1, 1], [1, 2, 3, 4], [1, 3, 6, 10], [1, 4, 10, 20]]
[[6, 3, 1], [3, 2, 1], [1, 1, 1]]
[[1, 5, 15, 35, 70], [1, 4, 10, 20, 35], [1, 3, 6, 10, 15], [1, 2, 3, 4, 5], [1, 1, 1, 1, 1]]
[[1]]
[[1, 1], [2, 1]]


False



[[2]]
[[1, 2], [2, 1]]
[[1, 1], [3, 1]]
[[1, 1, 1, 1], [1, 2, 3, 4], [1, 4, 6, 10], [1, 4, 10, 20]]
[[6, 3, 1], [1, 1, 1], [3, 2, 1]]
[[2, 2, 2, 2], [2, 4, 6, 8], [2, 6, 12, 20], [2, 8, 20, 40]]
[[1, 5, 15, 34, 70], [1, 4, 10, 20, 34], [1, 3, 6, 10, 15], [1, 2, 3, 4, 5], [1, 1, 1, 1, 1]]









share|improve this question









$endgroup$
















    6












    $begingroup$


    In Pascal's triangle each number is the sum of the two numbers directly above it, treating empty spots as zero:



    Source: https://en.wikipedia.org/wiki/File:Pascal_triangle_small.png



    By rotating the triangle, we can cut out square matrices of varying sizes and rotations which I will call Pascal's matrices. Note that those matrices always need to contain the top $1$. Here are some examples:



    1 1 1 1
    1 2 3 4
    1 3 6 10
    1 4 10 20

    6 3 1
    3 2 1
    1 1 1

    1 5 15 35 70
    1 4 10 20 35
    1 3 6 10 15
    1 2 3 4 5
    1 1 1 1 1

    1

    1 1
    2 1


    The Task



    Given a square matrix containing positive numbers in any reasonable format, decide if it is a Pascal's matrix.



    Decide means to either return truthy or falsy values depending on whether the input is a Pascal's matrix, or to fix two constant values and return one for the true inputs and the other for false inputs.



    This is code-golf, so try to use as few bytes as possible in the language of your choice. The shortest code in each language wins, thus I will not accept an answer.



    Test cases



    True



    [[1, 1, 1, 1], [1, 2, 3, 4], [1, 3, 6, 10], [1, 4, 10, 20]]
    [[6, 3, 1], [3, 2, 1], [1, 1, 1]]
    [[1, 5, 15, 35, 70], [1, 4, 10, 20, 35], [1, 3, 6, 10, 15], [1, 2, 3, 4, 5], [1, 1, 1, 1, 1]]
    [[1]]
    [[1, 1], [2, 1]]


    False



    [[2]]
    [[1, 2], [2, 1]]
    [[1, 1], [3, 1]]
    [[1, 1, 1, 1], [1, 2, 3, 4], [1, 4, 6, 10], [1, 4, 10, 20]]
    [[6, 3, 1], [1, 1, 1], [3, 2, 1]]
    [[2, 2, 2, 2], [2, 4, 6, 8], [2, 6, 12, 20], [2, 8, 20, 40]]
    [[1, 5, 15, 34, 70], [1, 4, 10, 20, 34], [1, 3, 6, 10, 15], [1, 2, 3, 4, 5], [1, 1, 1, 1, 1]]









    share|improve this question









    $endgroup$














      6












      6








      6


      1



      $begingroup$


      In Pascal's triangle each number is the sum of the two numbers directly above it, treating empty spots as zero:



      Source: https://en.wikipedia.org/wiki/File:Pascal_triangle_small.png



      By rotating the triangle, we can cut out square matrices of varying sizes and rotations which I will call Pascal's matrices. Note that those matrices always need to contain the top $1$. Here are some examples:



      1 1 1 1
      1 2 3 4
      1 3 6 10
      1 4 10 20

      6 3 1
      3 2 1
      1 1 1

      1 5 15 35 70
      1 4 10 20 35
      1 3 6 10 15
      1 2 3 4 5
      1 1 1 1 1

      1

      1 1
      2 1


      The Task



      Given a square matrix containing positive numbers in any reasonable format, decide if it is a Pascal's matrix.



      Decide means to either return truthy or falsy values depending on whether the input is a Pascal's matrix, or to fix two constant values and return one for the true inputs and the other for false inputs.



      This is code-golf, so try to use as few bytes as possible in the language of your choice. The shortest code in each language wins, thus I will not accept an answer.



      Test cases



      True



      [[1, 1, 1, 1], [1, 2, 3, 4], [1, 3, 6, 10], [1, 4, 10, 20]]
      [[6, 3, 1], [3, 2, 1], [1, 1, 1]]
      [[1, 5, 15, 35, 70], [1, 4, 10, 20, 35], [1, 3, 6, 10, 15], [1, 2, 3, 4, 5], [1, 1, 1, 1, 1]]
      [[1]]
      [[1, 1], [2, 1]]


      False



      [[2]]
      [[1, 2], [2, 1]]
      [[1, 1], [3, 1]]
      [[1, 1, 1, 1], [1, 2, 3, 4], [1, 4, 6, 10], [1, 4, 10, 20]]
      [[6, 3, 1], [1, 1, 1], [3, 2, 1]]
      [[2, 2, 2, 2], [2, 4, 6, 8], [2, 6, 12, 20], [2, 8, 20, 40]]
      [[1, 5, 15, 34, 70], [1, 4, 10, 20, 34], [1, 3, 6, 10, 15], [1, 2, 3, 4, 5], [1, 1, 1, 1, 1]]









      share|improve this question









      $endgroup$




      In Pascal's triangle each number is the sum of the two numbers directly above it, treating empty spots as zero:



      Source: https://en.wikipedia.org/wiki/File:Pascal_triangle_small.png



      By rotating the triangle, we can cut out square matrices of varying sizes and rotations which I will call Pascal's matrices. Note that those matrices always need to contain the top $1$. Here are some examples:



      1 1 1 1
      1 2 3 4
      1 3 6 10
      1 4 10 20

      6 3 1
      3 2 1
      1 1 1

      1 5 15 35 70
      1 4 10 20 35
      1 3 6 10 15
      1 2 3 4 5
      1 1 1 1 1

      1

      1 1
      2 1


      The Task



      Given a square matrix containing positive numbers in any reasonable format, decide if it is a Pascal's matrix.



      Decide means to either return truthy or falsy values depending on whether the input is a Pascal's matrix, or to fix two constant values and return one for the true inputs and the other for false inputs.



      This is code-golf, so try to use as few bytes as possible in the language of your choice. The shortest code in each language wins, thus I will not accept an answer.



      Test cases



      True



      [[1, 1, 1, 1], [1, 2, 3, 4], [1, 3, 6, 10], [1, 4, 10, 20]]
      [[6, 3, 1], [3, 2, 1], [1, 1, 1]]
      [[1, 5, 15, 35, 70], [1, 4, 10, 20, 35], [1, 3, 6, 10, 15], [1, 2, 3, 4, 5], [1, 1, 1, 1, 1]]
      [[1]]
      [[1, 1], [2, 1]]


      False



      [[2]]
      [[1, 2], [2, 1]]
      [[1, 1], [3, 1]]
      [[1, 1, 1, 1], [1, 2, 3, 4], [1, 4, 6, 10], [1, 4, 10, 20]]
      [[6, 3, 1], [1, 1, 1], [3, 2, 1]]
      [[2, 2, 2, 2], [2, 4, 6, 8], [2, 6, 12, 20], [2, 8, 20, 40]]
      [[1, 5, 15, 34, 70], [1, 4, 10, 20, 34], [1, 3, 6, 10, 15], [1, 2, 3, 4, 5], [1, 1, 1, 1, 1]]






      code-golf decision-problem matrix






      share|improve this question













      share|improve this question











      share|improve this question




      share|improve this question










      asked 4 hours ago









      LaikoniLaikoni

      20.2k438101




      20.2k438101




















          3 Answers
          3






          active

          oldest

          votes


















          1












          $begingroup$


          Brachylog, 28 bytes



          This feels quite long but here it is anyway



          ⟨≡∋↔⟩⟨≡∋↔⟩h=₁&s₂ᶠ⟨a₀ᶠ+ᵐ⟩ᵐ


          Explanation



          ⟨≡∋↔⟩⟨≡∋↔⟩h=₁&s₂ᶠ⟨a₀ᶠ+ᵐ⟩ᵐ # Tests if this is a pascal matrix:
          ⟨≡∋↔⟩⟨≡∋↔⟩ # By trying to get a rows of 1's on top
          ⟨≡∋↔⟩ # Through optionally mirroring vertically
          # Transposing
          ⟨≡∋↔⟩ # Through optionally mirroring vertically

          h=₁&s₂ᶠ⟨a₀ᶠ+ᵐ⟩ᵐ # and checking the following
          h=₁ # first row is a rows of 1's
          s₂ᶠ # and for each 2 rows which follow each other
          ⟨a₀ᶠ+ᵐ⟩ᵐ # the 2nd is the partial sums of the 1st
          a₀ᶠ # take all prefixes of the 1st
          +ᵐ # which if summed are the 2nd


          Try it online!






          share|improve this answer











          $endgroup$












          • $begingroup$
            First thought on golfing: you can save 4 bytes by using for "optionally mirror" and calling the same predicate the second time with ↰₁: Try it online!
            $endgroup$
            – DLosc
            2 hours ago


















          0












          $begingroup$


          Charcoal, 41 bytes



          F‹¹⌈§θ⁰≔⮌θθF‹¹⌈Eθ§ι⁰≦⮌θ⌊⭆θ⭆ι⁼λ∨¬κΣ…§θ⊖κ⊕μ


          Try it online! Link is to verbose version of code. Explanation:



          F‹¹⌈§θ⁰


          If the minimum of its first row is greater than 1,



          ≔⮌θθ


          then flip the input array.



          F‹¹⌈Eθ§ι⁰


          If the minimum of its first column is greater than 1,



          ≦⮌θ


          then mirror the input array.



          ⌊⭆θ⭆ι


          Loop over the elements of the input array and print the minimum result (i.e. the logical And of all of the results),



          ⁼λ∨¬κΣ…§θ⊖κ⊕μ


          comparing each value to 1 if it is on the first row otherwise the sum of the row above up to and including the cell above.






          share|improve this answer









          $endgroup$




















            0












            $begingroup$

            JavaScript (ES6), 114 bytes





            m=>[m,m,m=m.map(r=>[...r].reverse()),m].some(m=>m.reverse(p=[1]).every(r=>p=!r.some((v,x)=>v-~~p[x]-~~r[x-1])&&r))


            Try it online!






            share|improve this answer









            $endgroup$












              Your Answer





              StackExchange.ifUsing("editor", function ()
              return StackExchange.using("mathjaxEditing", function ()
              StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
              StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["\$", "\$"]]);
              );
              );
              , "mathjax-editing");

              StackExchange.ifUsing("editor", function ()
              StackExchange.using("externalEditor", function ()
              StackExchange.using("snippets", function ()
              StackExchange.snippets.init();
              );
              );
              , "code-snippets");

              StackExchange.ready(function()
              var channelOptions =
              tags: "".split(" "),
              id: "200"
              ;
              initTagRenderer("".split(" "), "".split(" "), channelOptions);

              StackExchange.using("externalEditor", function()
              // Have to fire editor after snippets, if snippets enabled
              if (StackExchange.settings.snippets.snippetsEnabled)
              StackExchange.using("snippets", function()
              createEditor();
              );

              else
              createEditor();

              );

              function createEditor()
              StackExchange.prepareEditor(
              heartbeatType: 'answer',
              autoActivateHeartbeat: false,
              convertImagesToLinks: false,
              noModals: true,
              showLowRepImageUploadWarning: true,
              reputationToPostImages: null,
              bindNavPrevention: true,
              postfix: "",
              imageUploader:
              brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
              contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
              allowUrls: true
              ,
              onDemand: true,
              discardSelector: ".discard-answer"
              ,immediatelyShowMarkdownHelp:true
              );



              );













              draft saved

              draft discarded


















              StackExchange.ready(
              function ()
              StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodegolf.stackexchange.com%2fquestions%2f181742%2fis-this-pascals-matrix%23new-answer', 'question_page');

              );

              Post as a guest















              Required, but never shown

























              3 Answers
              3






              active

              oldest

              votes








              3 Answers
              3






              active

              oldest

              votes









              active

              oldest

              votes






              active

              oldest

              votes









              1












              $begingroup$


              Brachylog, 28 bytes



              This feels quite long but here it is anyway



              ⟨≡∋↔⟩⟨≡∋↔⟩h=₁&s₂ᶠ⟨a₀ᶠ+ᵐ⟩ᵐ


              Explanation



              ⟨≡∋↔⟩⟨≡∋↔⟩h=₁&s₂ᶠ⟨a₀ᶠ+ᵐ⟩ᵐ # Tests if this is a pascal matrix:
              ⟨≡∋↔⟩⟨≡∋↔⟩ # By trying to get a rows of 1's on top
              ⟨≡∋↔⟩ # Through optionally mirroring vertically
              # Transposing
              ⟨≡∋↔⟩ # Through optionally mirroring vertically

              h=₁&s₂ᶠ⟨a₀ᶠ+ᵐ⟩ᵐ # and checking the following
              h=₁ # first row is a rows of 1's
              s₂ᶠ # and for each 2 rows which follow each other
              ⟨a₀ᶠ+ᵐ⟩ᵐ # the 2nd is the partial sums of the 1st
              a₀ᶠ # take all prefixes of the 1st
              +ᵐ # which if summed are the 2nd


              Try it online!






              share|improve this answer











              $endgroup$












              • $begingroup$
                First thought on golfing: you can save 4 bytes by using for "optionally mirror" and calling the same predicate the second time with ↰₁: Try it online!
                $endgroup$
                – DLosc
                2 hours ago















              1












              $begingroup$


              Brachylog, 28 bytes



              This feels quite long but here it is anyway



              ⟨≡∋↔⟩⟨≡∋↔⟩h=₁&s₂ᶠ⟨a₀ᶠ+ᵐ⟩ᵐ


              Explanation



              ⟨≡∋↔⟩⟨≡∋↔⟩h=₁&s₂ᶠ⟨a₀ᶠ+ᵐ⟩ᵐ # Tests if this is a pascal matrix:
              ⟨≡∋↔⟩⟨≡∋↔⟩ # By trying to get a rows of 1's on top
              ⟨≡∋↔⟩ # Through optionally mirroring vertically
              # Transposing
              ⟨≡∋↔⟩ # Through optionally mirroring vertically

              h=₁&s₂ᶠ⟨a₀ᶠ+ᵐ⟩ᵐ # and checking the following
              h=₁ # first row is a rows of 1's
              s₂ᶠ # and for each 2 rows which follow each other
              ⟨a₀ᶠ+ᵐ⟩ᵐ # the 2nd is the partial sums of the 1st
              a₀ᶠ # take all prefixes of the 1st
              +ᵐ # which if summed are the 2nd


              Try it online!






              share|improve this answer











              $endgroup$












              • $begingroup$
                First thought on golfing: you can save 4 bytes by using for "optionally mirror" and calling the same predicate the second time with ↰₁: Try it online!
                $endgroup$
                – DLosc
                2 hours ago













              1












              1








              1





              $begingroup$


              Brachylog, 28 bytes



              This feels quite long but here it is anyway



              ⟨≡∋↔⟩⟨≡∋↔⟩h=₁&s₂ᶠ⟨a₀ᶠ+ᵐ⟩ᵐ


              Explanation



              ⟨≡∋↔⟩⟨≡∋↔⟩h=₁&s₂ᶠ⟨a₀ᶠ+ᵐ⟩ᵐ # Tests if this is a pascal matrix:
              ⟨≡∋↔⟩⟨≡∋↔⟩ # By trying to get a rows of 1's on top
              ⟨≡∋↔⟩ # Through optionally mirroring vertically
              # Transposing
              ⟨≡∋↔⟩ # Through optionally mirroring vertically

              h=₁&s₂ᶠ⟨a₀ᶠ+ᵐ⟩ᵐ # and checking the following
              h=₁ # first row is a rows of 1's
              s₂ᶠ # and for each 2 rows which follow each other
              ⟨a₀ᶠ+ᵐ⟩ᵐ # the 2nd is the partial sums of the 1st
              a₀ᶠ # take all prefixes of the 1st
              +ᵐ # which if summed are the 2nd


              Try it online!






              share|improve this answer











              $endgroup$




              Brachylog, 28 bytes



              This feels quite long but here it is anyway



              ⟨≡∋↔⟩⟨≡∋↔⟩h=₁&s₂ᶠ⟨a₀ᶠ+ᵐ⟩ᵐ


              Explanation



              ⟨≡∋↔⟩⟨≡∋↔⟩h=₁&s₂ᶠ⟨a₀ᶠ+ᵐ⟩ᵐ # Tests if this is a pascal matrix:
              ⟨≡∋↔⟩⟨≡∋↔⟩ # By trying to get a rows of 1's on top
              ⟨≡∋↔⟩ # Through optionally mirroring vertically
              # Transposing
              ⟨≡∋↔⟩ # Through optionally mirroring vertically

              h=₁&s₂ᶠ⟨a₀ᶠ+ᵐ⟩ᵐ # and checking the following
              h=₁ # first row is a rows of 1's
              s₂ᶠ # and for each 2 rows which follow each other
              ⟨a₀ᶠ+ᵐ⟩ᵐ # the 2nd is the partial sums of the 1st
              a₀ᶠ # take all prefixes of the 1st
              +ᵐ # which if summed are the 2nd


              Try it online!







              share|improve this answer














              share|improve this answer



              share|improve this answer








              edited 3 hours ago

























              answered 3 hours ago









              KroppebKroppeb

              1,326210




              1,326210











              • $begingroup$
                First thought on golfing: you can save 4 bytes by using for "optionally mirror" and calling the same predicate the second time with ↰₁: Try it online!
                $endgroup$
                – DLosc
                2 hours ago
















              • $begingroup$
                First thought on golfing: you can save 4 bytes by using for "optionally mirror" and calling the same predicate the second time with ↰₁: Try it online!
                $endgroup$
                – DLosc
                2 hours ago















              $begingroup$
              First thought on golfing: you can save 4 bytes by using for "optionally mirror" and calling the same predicate the second time with ↰₁: Try it online!
              $endgroup$
              – DLosc
              2 hours ago




              $begingroup$
              First thought on golfing: you can save 4 bytes by using for "optionally mirror" and calling the same predicate the second time with ↰₁: Try it online!
              $endgroup$
              – DLosc
              2 hours ago











              0












              $begingroup$


              Charcoal, 41 bytes



              F‹¹⌈§θ⁰≔⮌θθF‹¹⌈Eθ§ι⁰≦⮌θ⌊⭆θ⭆ι⁼λ∨¬κΣ…§θ⊖κ⊕μ


              Try it online! Link is to verbose version of code. Explanation:



              F‹¹⌈§θ⁰


              If the minimum of its first row is greater than 1,



              ≔⮌θθ


              then flip the input array.



              F‹¹⌈Eθ§ι⁰


              If the minimum of its first column is greater than 1,



              ≦⮌θ


              then mirror the input array.



              ⌊⭆θ⭆ι


              Loop over the elements of the input array and print the minimum result (i.e. the logical And of all of the results),



              ⁼λ∨¬κΣ…§θ⊖κ⊕μ


              comparing each value to 1 if it is on the first row otherwise the sum of the row above up to and including the cell above.






              share|improve this answer









              $endgroup$

















                0












                $begingroup$


                Charcoal, 41 bytes



                F‹¹⌈§θ⁰≔⮌θθF‹¹⌈Eθ§ι⁰≦⮌θ⌊⭆θ⭆ι⁼λ∨¬κΣ…§θ⊖κ⊕μ


                Try it online! Link is to verbose version of code. Explanation:



                F‹¹⌈§θ⁰


                If the minimum of its first row is greater than 1,



                ≔⮌θθ


                then flip the input array.



                F‹¹⌈Eθ§ι⁰


                If the minimum of its first column is greater than 1,



                ≦⮌θ


                then mirror the input array.



                ⌊⭆θ⭆ι


                Loop over the elements of the input array and print the minimum result (i.e. the logical And of all of the results),



                ⁼λ∨¬κΣ…§θ⊖κ⊕μ


                comparing each value to 1 if it is on the first row otherwise the sum of the row above up to and including the cell above.






                share|improve this answer









                $endgroup$















                  0












                  0








                  0





                  $begingroup$


                  Charcoal, 41 bytes



                  F‹¹⌈§θ⁰≔⮌θθF‹¹⌈Eθ§ι⁰≦⮌θ⌊⭆θ⭆ι⁼λ∨¬κΣ…§θ⊖κ⊕μ


                  Try it online! Link is to verbose version of code. Explanation:



                  F‹¹⌈§θ⁰


                  If the minimum of its first row is greater than 1,



                  ≔⮌θθ


                  then flip the input array.



                  F‹¹⌈Eθ§ι⁰


                  If the minimum of its first column is greater than 1,



                  ≦⮌θ


                  then mirror the input array.



                  ⌊⭆θ⭆ι


                  Loop over the elements of the input array and print the minimum result (i.e. the logical And of all of the results),



                  ⁼λ∨¬κΣ…§θ⊖κ⊕μ


                  comparing each value to 1 if it is on the first row otherwise the sum of the row above up to and including the cell above.






                  share|improve this answer









                  $endgroup$




                  Charcoal, 41 bytes



                  F‹¹⌈§θ⁰≔⮌θθF‹¹⌈Eθ§ι⁰≦⮌θ⌊⭆θ⭆ι⁼λ∨¬κΣ…§θ⊖κ⊕μ


                  Try it online! Link is to verbose version of code. Explanation:



                  F‹¹⌈§θ⁰


                  If the minimum of its first row is greater than 1,



                  ≔⮌θθ


                  then flip the input array.



                  F‹¹⌈Eθ§ι⁰


                  If the minimum of its first column is greater than 1,



                  ≦⮌θ


                  then mirror the input array.



                  ⌊⭆θ⭆ι


                  Loop over the elements of the input array and print the minimum result (i.e. the logical And of all of the results),



                  ⁼λ∨¬κΣ…§θ⊖κ⊕μ


                  comparing each value to 1 if it is on the first row otherwise the sum of the row above up to and including the cell above.







                  share|improve this answer












                  share|improve this answer



                  share|improve this answer










                  answered 1 hour ago









                  NeilNeil

                  81.7k745178




                  81.7k745178





















                      0












                      $begingroup$

                      JavaScript (ES6), 114 bytes





                      m=>[m,m,m=m.map(r=>[...r].reverse()),m].some(m=>m.reverse(p=[1]).every(r=>p=!r.some((v,x)=>v-~~p[x]-~~r[x-1])&&r))


                      Try it online!






                      share|improve this answer









                      $endgroup$

















                        0












                        $begingroup$

                        JavaScript (ES6), 114 bytes





                        m=>[m,m,m=m.map(r=>[...r].reverse()),m].some(m=>m.reverse(p=[1]).every(r=>p=!r.some((v,x)=>v-~~p[x]-~~r[x-1])&&r))


                        Try it online!






                        share|improve this answer









                        $endgroup$















                          0












                          0








                          0





                          $begingroup$

                          JavaScript (ES6), 114 bytes





                          m=>[m,m,m=m.map(r=>[...r].reverse()),m].some(m=>m.reverse(p=[1]).every(r=>p=!r.some((v,x)=>v-~~p[x]-~~r[x-1])&&r))


                          Try it online!






                          share|improve this answer









                          $endgroup$



                          JavaScript (ES6), 114 bytes





                          m=>[m,m,m=m.map(r=>[...r].reverse()),m].some(m=>m.reverse(p=[1]).every(r=>p=!r.some((v,x)=>v-~~p[x]-~~r[x-1])&&r))


                          Try it online!







                          share|improve this answer












                          share|improve this answer



                          share|improve this answer










                          answered 48 mins ago









                          ArnauldArnauld

                          79k795328




                          79k795328



























                              draft saved

                              draft discarded
















































                              If this is an answer to a challenge…



                              • …Be sure to follow the challenge specification. However, please refrain from exploiting obvious loopholes. Answers abusing any of the standard loopholes are considered invalid. If you think a specification is unclear or underspecified, comment on the question instead.


                              • …Try to optimize your score. For instance, answers to code-golf challenges should attempt to be as short as possible. You can always include a readable version of the code in addition to the competitive one.
                                Explanations of your answer make it more interesting to read and are very much encouraged.


                              • …Include a short header which indicates the language(s) of your code and its score, as defined by the challenge.


                              More generally…



                              • …Please make sure to answer the question and provide sufficient detail.


                              • …Avoid asking for help, clarification or responding to other answers (use comments instead).




                              draft saved


                              draft discarded














                              StackExchange.ready(
                              function ()
                              StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodegolf.stackexchange.com%2fquestions%2f181742%2fis-this-pascals-matrix%23new-answer', 'question_page');

                              );

                              Post as a guest















                              Required, but never shown





















































                              Required, but never shown














                              Required, but never shown












                              Required, but never shown







                              Required, but never shown

































                              Required, but never shown














                              Required, but never shown












                              Required, but never shown







                              Required, but never shown







                              Popular posts from this blog

                              Are there any AGPL-style licences that require source code modifications to be public? Planned maintenance scheduled April 23, 2019 at 23:30 UTC (7:30pm US/Eastern) Announcing the arrival of Valued Associate #679: Cesar Manara Unicorn Meta Zoo #1: Why another podcast?Force derivative works to be publicAre there any GPL like licenses for Apple App Store?Do you violate the GPL if you provide source code that cannot be compiled?GPL - is it distribution to use libraries in an appliance loaned to customers?Distributing App for free which uses GPL'ed codeModifications of server software under GPL, with web/CLI interfaceDoes using an AGPLv3-licensed library prevent me from dual-licensing my own source code?Can I publish only select code under GPLv3 from a private project?Is there published precedent regarding the scope of covered work that uses AGPL software?If MIT licensed code links to GPL licensed code what should be the license of the resulting binary program?If I use a public API endpoint that has its source code licensed under AGPL in my app, do I need to disclose my source?

                              2013 GY136 Descoberta | Órbita | Referências Menu de navegação«List Of Centaurs and Scattered-Disk Objects»«List of Known Trans-Neptunian Objects»

                              Mortes em março de 2019 Referências Menu de navegação«Zhores Alferov, Nobel de Física bielorrusso, morre aos 88 anos - Ciência»«Fallece Rafael Torija, o bispo emérito de Ciudad Real»«Peter Hurford dies at 88»«Keith Flint, vocalista do The Prodigy, morre aos 49 anos»«Luke Perry, ator de 'Barrados no baile' e 'Riverdale', morre aos 52 anos»«Former Rangers and Scotland captain Eric Caldow dies, aged 84»«Morreu, aos 61 anos, a antiga lenda do wrestling King Kong Bundy»«Fallece el actor y director teatral Abraham Stavans»«In Memoriam Guillaume Faye»«Sidney Sheinberg, a Force Behind Universal and Spielberg, Is Dead at 84»«Carmine Persico, Colombo Crime Family Boss, Is Dead at 85»«Dirigent Michael Gielen gestorben»«Ciclista tricampeã mundial e prata na Rio 2016 é encontrada morta em casa aos 23 anos»«Pagan Community Notes: Raven Grimassi dies, Indianapolis pop-up event cancelled, Circle Sanctuary announces new podcast, and more!»«Hal Blaine, Wrecking Crew Drummer, Dies at 90»«Morre Coutinho, que editou dupla lendária com Pelé no Santos»«Cantor Demétrius, ídolo da Jovem Guarda, morre em SP»«Ex-presidente do Vasco, Eurico Miranda morre no Rio de Janeiro»«Bronze no Mundial de basquete de 1971, Laís Elena morre aos 76 anos»«Diretor de Corridas da F1, Charlie Whiting morre aos 66 anos às vésperas do GP da Austrália»«Morreu o cardeal Danneels, da Bélgica»«Morreu o cartoonista Augusto Cid»«Morreu a atriz Maria Isabel de Lizandra, de "Vale Tudo" e novelas da Tupi»«WS Merwin, prize-winning poet of nature, dies at 91»«Atriz Márcia Real morre em São Paulo aos 88 anos»«Mauritanie: décès de l'ancien président Mohamed Mahmoud ould Louly»«Morreu Dick Dale, o rei da surf guitar e de "Pulp Fiction"»«Falleció Víctor Genes»«João Carlos Marinho, autor de 'O Gênio do Crime', morre em SP»«Legendary Horror Director and SFX Artist John Carl Buechler Dies at 66»«Morre em Salvador a religiosa Makota Valdina»«مرگ بازیکن‌ سابق نساجی بر اثر سقوط سنگ در مازندران»«Domingos Oliveira morre no Rio»«Morre Airton Ravagniani, ex-São Paulo, Fla, Vasco, Grêmio e Sport - Notícias»«Morre o escritor Flavio Moreira da Costa»«Larry Cohen, Writer-Director of 'It's Alive' and 'Hell Up in Harlem,' Dies at 77»«Scott Walker, experimental singer-songwriter, dead at 76»«Joseph Pilato, Day of the Dead Star and Horror Favorite, Dies at 70»«Sheffield United set to pay tribute to legendary goalkeeper Ted Burgin who has died at 91»«Morre Rafael Henzel, sobrevivente de acidente aéreo da Chapecoense»«Morre Valery Bykovsky, um dos primeiros cosmonautas da União Soviética»«Agnès Varda, cineasta da Nouvelle Vague, morre aos 90 anos»«Agnès Varda, cineasta francesa, morre aos 90 anos»«Tania Mallet, James Bond Actress and Helen Mirren's Cousin, Dies at 77»e