摘要：
1.1 At first,the proof seems perfect!Horses 1 through n-1 are the same color,and horses2 through n are the same color,but when the n=2 ,that 1 and 1 are same color, 2 and 2 are same color,so it can't ... 阅读全文
posted @ 2007-12-24 21:39
CC
阅读(487)
评论(0)
推荐(0)
浙公网安备 33010602011771号