| [ SoGang ] in KIDS 글 쓴 이(By): cabot (Summer) 날 짜 (Date): 1993년09월06일(월) 01시47분51초 KST 제 목(Title): RE: antaeus I tried to e-mail to you. But, It seems that your id does not exit anymore] for some reason. I just tried to solve the problem you posted with curiosity. The following is the solution that I came up with. (It might be wrong....) Q: Can........? A: No! 0 1 0 1 0 1 0 1 0 1 1 0 1 0 1 0 1 0 1 0 0 1 0 1 0 1 0 1 0 1 1 0 1 0 1 0 1 0 1 0 0 1 0 1 0 1 0 1 0 1 (before) ===> (after) Is this possible? (count the number of 1's and 0's) * 1. assign 1 or 0 to every student as shown above (before) 2. then, the fiqure(after) is the only way to make it happen with only one move for each student I hope that you would find some rigorous ways to prove this. no warranty !!!!!! :) |