看来是公布答案的时候了
所在版块:求学狮城 发贴时间:2003-06-01 02:53

用户信息
复制本帖HTML代码
高亮: 今天贴 X 昨天贴 X 前天贴 X 
答案: 用2种颜色给24个点染色,相邻的点颜色不同(如下图)。

假设存在这样的一条线,依题意可知,这条线上的点是红蓝相间。但我们得到的红色的点有13个,蓝色的点有11个,13-11>1。
这是不可能的
.
欢迎来到华新中文网,踊跃发帖是支持我们的最好方法!

编程 = ? ? = ? !
 相关帖子 我要回复↙ ↗回到正文
一道思索数年的小学题目 冷色蓝天   (724 bytes , 1011reads )
Newton knows the answer 顽哆拉   (0 bytes , 144reads )
答案就在下面的帖子里 冷色蓝天   (0 bytes , 177reads )
看来是公布答案的时候了 冷色蓝天   (264 bytes , 273reads )
还是哪位高人提出个答案统一一下吧 陀螺   (123 bytes , 322reads )
嗬嗬,知道了,原来好简单!!! 汪!   (0 bytes , 183reads )
dun have, becoz got points with odd linking MrDJay   (0 bytes , 198reads )
wrong... 冷色蓝天   (71 bytes , 213reads )
well, can group it and use peogeon hole to MrDJay   (94 bytes , 255reads )
not sure about your solution, pls enlighten me 陀螺   (40 bytes , 342reads )
如果不知道这个概念 冷色蓝天   (14 bytes , 189reads )
ha? is the simplified version of Euler circle? MrDJay   (203 bytes , 282reads )
wrong... 冷色蓝天   (131 bytes , 209reads )
ft 汪!   (66 bytes , 259reads )
我想   (160 bytes , 224reads )
ft,我的第一万贴阿!!不小心用错id了 汪!   (75 bytes , 204reads )
汪!汪! 乖乖龙   (0 bytes , 155reads )
well, you are right..:^P, mixing with Euler and He MrDJay   (17 bytes , 217reads )
some of your statement is wrong fool   (494 bytes , 242reads )
sorry, should be EXACTLY 2 odd vertex if it has MrDJay   (20 bytes , 201reads )
wrong again, fool   (94 bytes , 180reads )