There are nine rings, each ring has "up" and "down" two states, denoted as : "∧" and "∨". Started nine rings are " on " state , namely : ∧ 9 ∧ 8 ∧ 7 ∧ 6 ∧ 5 ∧ 4 ∧ 3 ∧ 2 ∧ 1. Suppose we want to change the status of the i-th ring (∧ i -> ∨ i or ∨ i -> ∧ i), you must meet ∧ i-1 ∨ i-2 ... ∨ 1 ; . That is, only the first i-1 ring for the last state , the other in front of it ring (1 -> i-2) are the next state , i was able to change the status of the ring . It is required that nine are " on " state of the ring , to nine are "down" state , and asked how many steps need at least operate ( when conditions permit, to change the status of any one ring is called a step ) ? ( Please programming given code )
------ Solution ------------------------------------ --------
/ / array is nine ring circle , circle [8] to the left of the ninth ring , circle [0] to the right of the first ring
/ / true indicates a downward "∨", false indicates an upward "∧"
/ **
*
* @ author afunx
* /
public class NineCircle {
public static final int N = 9;
static boolean circle [] = new boolean [N];
static int count = 0;
public static void main (String args []) {
/ / 8 changes, making the circle [8] = true, namely "∨"
change (N-1);
/ / 7 starts , first determine the current status is true, namely "∨"
/ / do not meet , then converted one
for (int k = N-2; k> = 0; k -) {
if (circle [k]! = true)
change (k);
}
System.out.println (count);
}
static void change (int index) {
/ / counter is incremented by one
count + +;
/ / right there is 0 , the direct conversion
if (index == 0) {
inverse (index);
return;
}
/ / Right only one
else if (index == 1) {
/ / right one if not for the false ("∧"), which requires the transformation
if (circle [index-1]! = false) change (index-1);
}
/ / Right greater than or equal 2
else {
/ / right one if not for the false ("∧"), which requires the transformation
if (circle [index-1]! = false) change (index-1);
/ / right from the first two , if not for the true ("∨"), which requires the transformation
while (index-2> = 0) {
if (circle [index-2]! = true)
change (index-2) ;
index -;
}
}
}
/ **
* ture, false inverted
* @ param index an array of inverted position
* /
static void inverse (int index) {
if (circle [index] == true)
circle [index] = false;
else
circle [index] = true;
}
}
operating results for the 97
------ Solution -------------------------------- ------------
first saw the question I thought it was nine rings , come see the problem is not found , a closer look at the problem found really are. . . . .
I had a go of how popular the company is now a ghost out of the bird problem, Baidu to search for nine chain solution is a recursive
but not all subject to the conditions , should be given on condition that the 1st ring uncontrolled
under way under a 3 1 of 2 Next 1 Next 5 123 for 2 for 1 4 12 next next 1 next three ; the next 2 1 7 ...... continue under the next one right
------ Solution -------------------- ------------------------
code is not written by me , I just put someone into a C language java Bale ... LZ are interested can carefully study ,
Also this is not the most efficient , because there is no way to consider a loop in the end not to hang up problems ( such as your next three rings , a ring would not hang back , but the next four rings , one ring must hang back before the next two rings ~ ~ )
public class test1{
private static int upstep = 0;
private static int downstep = 0;
public static void DownRing(int n) /*下环的逻辑就体现在这里*/
{
if(n>2) DownRing(n-2);
downstep++;
if(n>2) UpRing(n-2);
if(n>1) DownRing(n-1);
}
public static void UpRing(int n) /*上环的逻辑则体现在这里*/
{
if(n>1) UpRing(n-1);
if(n>2) DownRing(n-2);
upstep++;
if(n>2) UpRing(n-2);
}
public static void main(String[] args) {
DownRing(9);
System.err.println(upstep+downstep);
}
}
------ Solution ------------------------------------ --------
brother look after you run the answer ah , 9 rings to step 341 , a ring fixed once even a step , your results are far worse now < br> ------ Solution ----------------------------------------- ---
wrote a test , do not know the correct
import java.util.*;
class Huan {
int state = 0;
public Huan() {
state = 0;
}
public String toString() {
return String.format("%d", state);
}
public static void main(String[] args) {
Huan[] h = new Huan[9];
for (int i=0; i<9; i++) {
h[i] = new Huan();
}
int step = 0;
for (int i=8; i>=0; i--) {
step += change(h, i);
}
System.out.println(step);
}
public static int change(Huan[] h, int n) {
int step = 0;
if (n == 0) {
step++;
h[n].state = (h[n].state+1)%2;
System.out.println(Arrays.toString(h));
return step;
} else if (n == 1) {
if (h[n-1].state != 0) {
step++;
h[n-1].state = (h[n-1].state+1)%2;
System.out.println(Arrays.toString(h));
}
step++;
h[n].state = (h[n].state+1)%2;
System.out.println(Arrays.toString(h));
return step;
}
if (h[n-1].state != 0) {
step += change(h, n-1);
}
for (int i=n-2; i>=0; i--) {
if (h[i].state == 0) {
step += change(h, i);
}
}
step++;
h[n].state = (h[n].state+1)%2;
System.out.println(Arrays.toString(h));
return step;
}
}
------ Solution ------------------------------------ --------
me with the most stupid way
public class Test10 {
static int pc = 0;
public static void main(String[] args) {
int[] test = new int [10];
final Integer start = new Integer(0);
test[0] = start;
for(int i = 1; i < test.length;i++) {
test[i] = 1;
}
move(test,1);
System.out.println(pc);
}
public static int m(int[] a,int i) {
int r = 0;
for(int j = i-2;j>=0 ;j--){
r = r | a[j];
}
return r;
}
public static void move(int[] a,int i) {
if(a[1]==0&&a[2]==0&&a[3]==0&&a[4]==0&&a[5]==0&&a[6]==0&&a[7]==0&&a[8]==0&&a[9]==0) {
return;
}
else if(i==1) {//i=1改变自己，向前移动
a[i] = set(a[i]);
table(a);
pc++;
move(a,++i);
}
else if(a[i]==1&&a[i-1]==0) {//前面都向下，自己为上，继续移动
move(a,++i);
}
else if(a[i]==1&&a[i-1]==1&&m(a,i)==0) {//正常判断
a[i] = set(a[i]);
table(a);
pc++;
move(a,1);
}
else if(a[i]==0&&a[i-1]==1&&m(a,i)==0) {
a[i] = set(a[i]);
table(a);
pc++;
move(a,1);
}
else if(a[i]==0&&m(a,i)==0) {//自己和后面都是下，继续移动
move(a,++i);
}
}
public static int set(int a) {
if(a==0) {
a = 1;
}
else {
a = 0;
}
return a;
}
public static void table(int[] a) {
for(int i = 1; i < a.length;i++) {
System.out.print(a[i]+" ");
}
System.out.println();
}
}
------ For reference only ----------------------------------- ----
for i = 0, how to explain ? Please indicate
------ For reference only ---------------------------------- -----
对ah , i = 0 is what ah , and now this one can not move .
------ For reference only -------------------------------------- -
i should not be considered equal to 0 , or else really can not move.
------ For reference only -------------------------------------- -
looks like the Tower of Hanoi ? Problem Statute
------ For reference only ------------------------------------ ---
4 floor could provide clues · · ·
------ For reference only ------------------ ---------------------
feel this topic is not complete, so if it looks like only began to change from a ; and then change 2 . . The second possible future changes did not turn it
------ For reference only ------------------------- --------------
title seemingly does not finish
or personal apprehension ......
first thought is recursive .
------ For reference only -------------------------- -------------
Suppose we want to change the status of the i-th ring (∧ i -> ∨ i or ∨ i -> ∧ i), you must meet ∧ i-1 ∨ i-2 ... ∨ 1.
that is only the first i-1 ring on the state , the other in front of it ring (1 -> i-2) are the next state , i was able to change the status of the ring .
now needs to be nine are " on " state of the ring , to nine are "down" state
change the first ring of the conditions are not met , how to change ?
------ For reference only ---------------------------------- -----
tangle · · · ·
------ For reference only --------------------- ------------------
you do not own the title to make it clear tangled ah ah
------ For reference only - --------------------------------------
print results
[1, 0, 0, 0, 0, 0, 0, 0, 0]
[1, 0, 1, 0, 0, 0, 0, 0, 0]
[0, 0, 1, 0, 0, 0, 0, 0, 0]
[0, 1, 1, 0, 0, 0, 0, 0, 0]
[1, 1, 1, 0, 0, 0, 0, 0, 0]
[1, 1, 1, 0, 1, 0, 0, 0, 0]
[0, 1, 1, 0, 1, 0, 0, 0, 0]
[0, 0, 1, 0, 1, 0, 0, 0, 0]
[1, 0, 1, 0, 1, 0, 0, 0, 0]
[1, 0, 0, 0, 1, 0, 0, 0, 0]
[0, 0, 0, 0, 1, 0, 0, 0, 0]
[0, 1, 0, 0, 1, 0, 0, 0, 0]
[1, 1, 0, 0, 1, 0, 0, 0, 0]
[1, 1, 0, 1, 1, 0, 0, 0, 0]
[0, 1, 0, 1, 1, 0, 0, 0, 0]
[0, 0, 0, 1, 1, 0, 0, 0, 0]
[1, 0, 0, 1, 1, 0, 0, 0, 0]
[1, 0, 1, 1, 1, 0, 0, 0, 0]
[0, 0, 1, 1, 1, 0, 0, 0, 0]
[0, 1, 1, 1, 1, 0, 0, 0, 0]
[1, 1, 1, 1, 1, 0, 0, 0, 0]
[1, 1, 1, 1, 1, 0, 1, 0, 0]
[0, 1, 1, 1, 1, 0, 1, 0, 0]
[0, 0, 1, 1, 1, 0, 1, 0, 0]
[1, 0, 1, 1, 1, 0, 1, 0, 0]
[1, 0, 0, 1, 1, 0, 1, 0, 0]
[0, 0, 0, 1, 1, 0, 1, 0, 0]
[0, 1, 0, 1, 1, 0, 1, 0, 0]
[1, 1, 0, 1, 1, 0, 1, 0, 0]
[1, 1, 0, 0, 1, 0, 1, 0, 0]
[0, 1, 0, 0, 1, 0, 1, 0, 0]
[0, 0, 0, 0, 1, 0, 1, 0, 0]
[1, 0, 0, 0, 1, 0, 1, 0, 0]
[1, 0, 1, 0, 1, 0, 1, 0, 0]
[0, 0, 1, 0, 1, 0, 1, 0, 0]
[0, 1, 1, 0, 1, 0, 1, 0, 0]
[1, 1, 1, 0, 1, 0, 1, 0, 0]
[1, 1, 1, 0, 0, 0, 1, 0, 0]
[0, 1, 1, 0, 0, 0, 1, 0, 0]
[0, 0, 1, 0, 0, 0, 1, 0, 0]
[1, 0, 1, 0, 0, 0, 1, 0, 0]
[1, 0, 0, 0, 0, 0, 1, 0, 0]
[0, 0, 0, 0, 0, 0, 1, 0, 0]
[0, 1, 0, 0, 0, 0, 1, 0, 0]
[1, 1, 0, 0, 0, 0, 1, 0, 0]
[1, 1, 0, 1, 0, 0, 1, 0, 0]
[0, 1, 0, 1, 0, 0, 1, 0, 0]
[0, 0, 0, 1, 0, 0, 1, 0, 0]
[1, 0, 0, 1, 0, 0, 1, 0, 0]
[1, 0, 1, 1, 0, 0, 1, 0, 0]
[0, 0, 1, 1, 0, 0, 1, 0, 0]
[0, 1, 1, 1, 0, 0, 1, 0, 0]
[1, 1, 1, 1, 0, 0, 1, 0, 0]
[1, 1, 1, 1, 0, 1, 1, 0, 0]
[0, 1, 1, 1, 0, 1, 1, 0, 0]
[0, 0, 1, 1, 0, 1, 1, 0, 0]
[1, 0, 1, 1, 0, 1, 1, 0, 0]
[1, 0, 0, 1, 0, 1, 1, 0, 0]
[0, 0, 0, 1, 0, 1, 1, 0, 0]
[0, 1, 0, 1, 0, 1, 1, 0, 0]
[1, 1, 0, 1, 0, 1, 1, 0, 0]
[1, 1, 0, 0, 0, 1, 1, 0, 0]
[0, 1, 0, 0, 0, 1, 1, 0, 0]
[0, 0, 0, 0, 0, 1, 1, 0, 0]
[1, 0, 0, 0, 0, 1, 1, 0, 0]
[1, 0, 1, 0, 0, 1, 1, 0, 0]
[0, 0, 1, 0, 0, 1, 1, 0, 0]
[0, 1, 1, 0, 0, 1, 1, 0, 0]
[1, 1, 1, 0, 0, 1, 1, 0, 0]
[1, 1, 1, 0, 1, 1, 1, 0, 0]
[0, 1, 1, 0, 1, 1, 1, 0, 0]
[0, 0, 1, 0, 1, 1, 1, 0, 0]
[1, 0, 1, 0, 1, 1, 1, 0, 0]
[1, 0, 0, 0, 1, 1, 1, 0, 0]
[0, 0, 0, 0, 1, 1, 1, 0, 0]
[0, 1, 0, 0, 1, 1, 1, 0, 0]
[1, 1, 0, 0, 1, 1, 1, 0, 0]
[1, 1, 0, 1, 1, 1, 1, 0, 0]
[0, 1, 0, 1, 1, 1, 1, 0, 0]
[0, 0, 0, 1, 1, 1, 1, 0, 0]
[1, 0, 0, 1, 1, 1, 1, 0, 0]
[1, 0, 1, 1, 1, 1, 1, 0, 0]
[0, 0, 1, 1, 1, 1, 1, 0, 0]
[0, 1, 1, 1, 1, 1, 1, 0, 0]
[1, 1, 1, 1, 1, 1, 1, 0, 0]
[1, 1, 1, 1, 1, 1, 1, 0, 1]
[0, 1, 1, 1, 1, 1, 1, 0, 1]
[0, 0, 1, 1, 1, 1, 1, 0, 1]
[1, 0, 1, 1, 1, 1, 1, 0, 1]
[1, 0, 0, 1, 1, 1, 1, 0, 1]
[0, 0, 0, 1, 1, 1, 1, 0, 1]
[0, 1, 0, 1, 1, 1, 1, 0, 1]
[1, 1, 0, 1, 1, 1, 1, 0, 1]
[1, 1, 0, 0, 1, 1, 1, 0, 1]
[0, 1, 0, 0, 1, 1, 1, 0, 1]
[0, 0, 0, 0, 1, 1, 1, 0, 1]
[1, 0, 0, 0, 1, 1, 1, 0, 1]
[1, 0, 1, 0, 1, 1, 1, 0, 1]
[0, 0, 1, 0, 1, 1, 1, 0, 1]
[0, 1, 1, 0, 1, 1, 1, 0, 1]
[1, 1, 1, 0, 1, 1, 1, 0, 1]
[1, 1, 1, 0, 0, 1, 1, 0, 1]
[0, 1, 1, 0, 0, 1, 1, 0, 1]
[0, 0, 1, 0, 0, 1, 1, 0, 1]
[1, 0, 1, 0, 0, 1, 1, 0, 1]
[1, 0, 0, 0, 0, 1, 1, 0, 1]
[0, 0, 0, 0, 0, 1, 1, 0, 1]
[0, 1, 0, 0, 0, 1, 1, 0, 1]
[1, 1, 0, 0, 0, 1, 1, 0, 1]
[1, 1, 0, 1, 0, 1, 1, 0, 1]
[0, 1, 0, 1, 0, 1, 1, 0, 1]
[0, 0, 0, 1, 0, 1, 1, 0, 1]
[1, 0, 0, 1, 0, 1, 1, 0, 1]
[1, 0, 1, 1, 0, 1, 1, 0, 1]
[0, 0, 1, 1, 0, 1, 1, 0, 1]
[0, 1, 1, 1, 0, 1, 1, 0, 1]
[1, 1, 1, 1, 0, 1, 1, 0, 1]
[1, 1, 1, 1, 0, 0, 1, 0, 1]
[0, 1, 1, 1, 0, 0, 1, 0, 1]
[0, 0, 1, 1, 0, 0, 1, 0, 1]
[1, 0, 1, 1, 0, 0, 1, 0, 1]
[1, 0, 0, 1, 0, 0, 1, 0, 1]
[0, 0, 0, 1, 0, 0, 1, 0, 1]
[0, 1, 0, 1, 0, 0, 1, 0, 1]
[1, 1, 0, 1, 0, 0, 1, 0, 1]
[1, 1, 0, 0, 0, 0, 1, 0, 1]
[0, 1, 0, 0, 0, 0, 1, 0, 1]
[0, 0, 0, 0, 0, 0, 1, 0, 1]
[1, 0, 0, 0, 0, 0, 1, 0, 1]
[1, 0, 1, 0, 0, 0, 1, 0, 1]
[0, 0, 1, 0, 0, 0, 1, 0, 1]
[0, 1, 1, 0, 0, 0, 1, 0, 1]
[1, 1, 1, 0, 0, 0, 1, 0, 1]
[1, 1, 1, 0, 1, 0, 1, 0, 1]
[0, 1, 1, 0, 1, 0, 1, 0, 1]
[0, 0, 1, 0, 1, 0, 1, 0, 1]
[1, 0, 1, 0, 1, 0, 1, 0, 1]
[1, 0, 0, 0, 1, 0, 1, 0, 1]
[0, 0, 0, 0, 1, 0, 1, 0, 1]
[0, 1, 0, 0, 1, 0, 1, 0, 1]
[1, 1, 0, 0, 1, 0, 1, 0, 1]
[1, 1, 0, 1, 1, 0, 1, 0, 1]
[0, 1, 0, 1, 1, 0, 1, 0, 1]
[0, 0, 0, 1, 1, 0, 1, 0, 1]
[1, 0, 0, 1, 1, 0, 1, 0, 1]
[1, 0, 1, 1, 1, 0, 1, 0, 1]
[0, 0, 1, 1, 1, 0, 1, 0, 1]
[0, 1, 1, 1, 1, 0, 1, 0, 1]
[1, 1, 1, 1, 1, 0, 1, 0, 1]
[1, 1, 1, 1, 1, 0, 0, 0, 1]
[0, 1, 1, 1, 1, 0, 0, 0, 1]
[0, 0, 1, 1, 1, 0, 0, 0, 1]
[1, 0, 1, 1, 1, 0, 0, 0, 1]
[1, 0, 0, 1, 1, 0, 0, 0, 1]
[0, 0, 0, 1, 1, 0, 0, 0, 1]
[0, 1, 0, 1, 1, 0, 0, 0, 1]
[1, 1, 0, 1, 1, 0, 0, 0, 1]
[1, 1, 0, 0, 1, 0, 0, 0, 1]
[0, 1, 0, 0, 1, 0, 0, 0, 1]
[0, 0, 0, 0, 1, 0, 0, 0, 1]
[1, 0, 0, 0, 1, 0, 0, 0, 1]
[1, 0, 1, 0, 1, 0, 0, 0, 1]
[0, 0, 1, 0, 1, 0, 0, 0, 1]
[0, 1, 1, 0, 1, 0, 0, 0, 1]
[1, 1, 1, 0, 1, 0, 0, 0, 1]
[1, 1, 1, 0, 0, 0, 0, 0, 1]
[0, 1, 1, 0, 0, 0, 0, 0, 1]
[0, 0, 1, 0, 0, 0, 0, 0, 1]
[1, 0, 1, 0, 0, 0, 0, 0, 1]
[1, 0, 0, 0, 0, 0, 0, 0, 1]
[0, 0, 0, 0, 0, 0, 0, 0, 1]
[0, 1, 0, 0, 0, 0, 0, 0, 1]
[1, 1, 0, 0, 0, 0, 0, 0, 1]
[1, 1, 0, 1, 0, 0, 0, 0, 1]
[0, 1, 0, 1, 0, 0, 0, 0, 1]
[0, 0, 0, 1, 0, 0, 0, 0, 1]
[1, 0, 0, 1, 0, 0, 0, 0, 1]
[1, 0, 1, 1, 0, 0, 0, 0, 1]
[0, 0, 1, 1, 0, 0, 0, 0, 1]
[0, 1, 1, 1, 0, 0, 0, 0, 1]
[1, 1, 1, 1, 0, 0, 0, 0, 1]
[1, 1, 1, 1, 0, 1, 0, 0, 1]
[0, 1, 1, 1, 0, 1, 0, 0, 1]
[0, 0, 1, 1, 0, 1, 0, 0, 1]
[1, 0, 1, 1, 0, 1, 0, 0, 1]
[1, 0, 0, 1, 0, 1, 0, 0, 1]
[0, 0, 0, 1, 0, 1, 0, 0, 1]
[0, 1, 0, 1, 0, 1, 0, 0, 1]
[1, 1, 0, 1, 0, 1, 0, 0, 1]
[1, 1, 0, 0, 0, 1, 0, 0, 1]
[0, 1, 0, 0, 0, 1, 0, 0, 1]
[0, 0, 0, 0, 0, 1, 0, 0, 1]
[1, 0, 0, 0, 0, 1, 0, 0, 1]
[1, 0, 1, 0, 0, 1, 0, 0, 1]
[0, 0, 1, 0, 0, 1, 0, 0, 1]
[0, 1, 1, 0, 0, 1, 0, 0, 1]
[1, 1, 1, 0, 0, 1, 0, 0, 1]
[1, 1, 1, 0, 1, 1, 0, 0, 1]
[0, 1, 1, 0, 1, 1, 0, 0, 1]
[0, 0, 1, 0, 1, 1, 0, 0, 1]
[1, 0, 1, 0, 1, 1, 0, 0, 1]
[1, 0, 0, 0, 1, 1, 0, 0, 1]
[0, 0, 0, 0, 1, 1, 0, 0, 1]
[0, 1, 0, 0, 1, 1, 0, 0, 1]
[1, 1, 0, 0, 1, 1, 0, 0, 1]
[1, 1, 0, 1, 1, 1, 0, 0, 1]
[0, 1, 0, 1, 1, 1, 0, 0, 1]
[0, 0, 0, 1, 1, 1, 0, 0, 1]
[1, 0, 0, 1, 1, 1, 0, 0, 1]
[1, 0, 1, 1, 1, 1, 0, 0, 1]
[0, 0, 1, 1, 1, 1, 0, 0, 1]
[0, 1, 1, 1, 1, 1, 0, 0, 1]
[1, 1, 1, 1, 1, 1, 0, 0, 1]
[1, 1, 1, 1, 1, 1, 0, 1, 1]
[0, 1, 1, 1, 1, 1, 0, 1, 1]
[0, 0, 1, 1, 1, 1, 0, 1, 1]
[1, 0, 1, 1, 1, 1, 0, 1, 1]
[1, 0, 0, 1, 1, 1, 0, 1, 1]
[0, 0, 0, 1, 1, 1, 0, 1, 1]
[0, 1, 0, 1, 1, 1, 0, 1, 1]
[1, 1, 0, 1, 1, 1, 0, 1, 1]
[1, 1, 0, 0, 1, 1, 0, 1, 1]
[0, 1, 0, 0, 1, 1, 0, 1, 1]
[0, 0, 0, 0, 1, 1, 0, 1, 1]
[1, 0, 0, 0, 1, 1, 0, 1, 1]
[1, 0, 1, 0, 1, 1, 0, 1, 1]
[0, 0, 1, 0, 1, 1, 0, 1, 1]
[0, 1, 1, 0, 1, 1, 0, 1, 1]
[1, 1, 1, 0, 1, 1, 0, 1, 1]
[1, 1, 1, 0, 0, 1, 0, 1, 1]
[0, 1, 1, 0, 0, 1, 0, 1, 1]
[0, 0, 1, 0, 0, 1, 0, 1, 1]
[1, 0, 1, 0, 0, 1, 0, 1, 1]
[1, 0, 0, 0, 0, 1, 0, 1, 1]
[0, 0, 0, 0, 0, 1, 0, 1, 1]
[0, 1, 0, 0, 0, 1, 0, 1, 1]
[1, 1, 0, 0, 0, 1, 0, 1, 1]
[1, 1, 0, 1, 0, 1, 0, 1, 1]
[0, 1, 0, 1, 0, 1, 0, 1, 1]
[0, 0, 0, 1, 0, 1, 0, 1, 1]
[1, 0, 0, 1, 0, 1, 0, 1, 1]
[1, 0, 1, 1, 0, 1, 0, 1, 1]
[0, 0, 1, 1, 0, 1, 0, 1, 1]
[0, 1, 1, 1, 0, 1, 0, 1, 1]
[1, 1, 1, 1, 0, 1, 0, 1, 1]
[1, 1, 1, 1, 0, 0, 0, 1, 1]
[0, 1, 1, 1, 0, 0, 0, 1, 1]
[0, 0, 1, 1, 0, 0, 0, 1, 1]
[1, 0, 1, 1, 0, 0, 0, 1, 1]
[1, 0, 0, 1, 0, 0, 0, 1, 1]
[0, 0, 0, 1, 0, 0, 0, 1, 1]
[0, 1, 0, 1, 0, 0, 0, 1, 1]
[1, 1, 0, 1, 0, 0, 0, 1, 1]
[1, 1, 0, 0, 0, 0, 0, 1, 1]
[0, 1, 0, 0, 0, 0, 0, 1, 1]
[0, 0, 0, 0, 0, 0, 0, 1, 1]
[1, 0, 0, 0, 0, 0, 0, 1, 1]
[1, 0, 1, 0, 0, 0, 0, 1, 1]
[0, 0, 1, 0, 0, 0, 0, 1, 1]
[0, 1, 1, 0, 0, 0, 0, 1, 1]
[1, 1, 1, 0, 0, 0, 0, 1, 1]
[1, 1, 1, 0, 1, 0, 0, 1, 1]
[0, 1, 1, 0, 1, 0, 0, 1, 1]
[0, 0, 1, 0, 1, 0, 0, 1, 1]
[1, 0, 1, 0, 1, 0, 0, 1, 1]
[1, 0, 0, 0, 1, 0, 0, 1, 1]
[0, 0, 0, 0, 1, 0, 0, 1, 1]
[0, 1, 0, 0, 1, 0, 0, 1, 1]
[1, 1, 0, 0, 1, 0, 0, 1, 1]
[1, 1, 0, 1, 1, 0, 0, 1, 1]
[0, 1, 0, 1, 1, 0, 0, 1, 1]
[0, 0, 0, 1, 1, 0, 0, 1, 1]
[1, 0, 0, 1, 1, 0, 0, 1, 1]
[1, 0, 1, 1, 1, 0, 0, 1, 1]
[0, 0, 1, 1, 1, 0, 0, 1, 1]
[0, 1, 1, 1, 1, 0, 0, 1, 1]
[1, 1, 1, 1, 1, 0, 0, 1, 1]
[1, 1, 1, 1, 1, 0, 1, 1, 1]
[0, 1, 1, 1, 1, 0, 1, 1, 1]
[0, 0, 1, 1, 1, 0, 1, 1, 1]
[1, 0, 1, 1, 1, 0, 1, 1, 1]
[1, 0, 0, 1, 1, 0, 1, 1, 1]
[0, 0, 0, 1, 1, 0, 1, 1, 1]
[0, 1, 0, 1, 1, 0, 1, 1, 1]
[1, 1, 0, 1, 1, 0, 1, 1, 1]
[1, 1, 0, 0, 1, 0, 1, 1, 1]
[0, 1, 0, 0, 1, 0, 1, 1, 1]
[0, 0, 0, 0, 1, 0, 1, 1, 1]
[1, 0, 0, 0, 1, 0, 1, 1, 1]
[1, 0, 1, 0, 1, 0, 1, 1, 1]
[0, 0, 1, 0, 1, 0, 1, 1, 1]
[0, 1, 1, 0, 1, 0, 1, 1, 1]
[1, 1, 1, 0, 1, 0, 1, 1, 1]
[1, 1, 1, 0, 0, 0, 1, 1, 1]
[0, 1, 1, 0, 0, 0, 1, 1, 1]
[0, 0, 1, 0, 0, 0, 1, 1, 1]
[1, 0, 1, 0, 0, 0, 1, 1, 1]
[1, 0, 0, 0, 0, 0, 1, 1, 1]
[0, 0, 0, 0, 0, 0, 1, 1, 1]
[0, 1, 0, 0, 0, 0, 1, 1, 1]
[1, 1, 0, 0, 0, 0, 1, 1, 1]
[1, 1, 0, 1, 0, 0, 1, 1, 1]
[0, 1, 0, 1, 0, 0, 1, 1, 1]
[0, 0, 0, 1, 0, 0, 1, 1, 1]
没有评论:
发表评论