note
Kenosis
<p>The OP's code answers these questions.</p>
<p>Given the OP's dataset:</p>
<c>
1,1,,,,
1,2,,,,
3,4,1,1,,
1,1,1,1,,
5,6,3,4,1,2
1,1,,,,
1,1,1,1,1,1
</c>
<p>the code indicates that "Success" obtains when at least one of the following tuples is <c>'1,1'</c> and "Fail" obtains when one is <c>'1,2'</c>:</p>
<c>
(n,n),(n,n),(n,n)
^ ^ ^
| | |
| | + - Tuple 3
| + - Tuple 2
+ - Tuple 1
</c>
<p><strong>Edit:</strong> Added the "Fail" condition. Thank you, [http://perlmonks.org/index.pl?node_id=546548|Jim].</p>
1074126
1074165