Select Code to Download

Example:
...
A: 0 1 2 3 4 5 6 7 8 9 10 11
   1 0 0 1 0 1 0 0 0 1  0  0

if i start counting from 10 then B[0] = A[0]+10 = 11

B: 0  1  2  3  4  5  6  7  8  9 10 11
  11 10  9 10  9 10  9  8  7  8  7  6

i,j = B[1],B[7] (A[1],A[7])
i,j != B[6],B[10] -> then there are two min positions (B[1] and B[7]) 
+and this cannot be....