欢迎查询 |
|
备份档案: 当前 | 2023 | 2022 | 2021 | 2020 | 2019 | 2018 | 2017 | 2016 | 2015 | 2014 | 2013 | 2012 | 2011 | 2010 | 2009 | 2008 | 2007 | 2006 | 2005 | 2004 | 2003 | |
页次:1/1 每页50条记录, 本页显示1 到35, 共35 分页: [1] | |
• #跟帖# See these links [脑筋急转] - innercool(463 bytes ) 2011-11-03 | |
• #跟帖# 回复:Seven Ten Cap - Fill in the Blank [脑筋急转] - innercool(14 bytes ) 2011-04-05 | |
• #跟帖# If you have a computer/calculator [脑筋急转] - innercool(226 bytes ) 2010-07-29 | |
• #跟帖# Very nice and enlightening argument. [脑筋急转] - innercool(0 bytes ) 2010-06-10 | |
• #跟帖# Very good point! This reminds me "mathematical maturity" [脑筋急转] - innercool(3904 bytes ) 2010-06-10 | |
• #跟帖# Sorry, you are right. And here is the proof of the correctness. [脑筋急转] - innercool(463 bytes ) 2010-06-07 | |
• #跟帖# Do not think it is going to work... [脑筋急转] - innercool(259 bytes ) 2010-06-07 | |
• #跟帖# Yes, there is one. [脑筋急转] - innercool(320 bytes ) 2010-06-05 | |
• #跟帖# 回复:呵呵,看见您的名字,想起一个笑话。。呵呵,别生气啊。。:) [脑筋急转] - innercool(189 bytes ) 2010-05-25 | |
• #跟帖# So sad to learn this. [脑筋急转] - innercool(115 bytes ) 2010-05-24 | |
• #跟帖# Very nice! [脑筋急转] - innercool(27 bytes ) 2010-04-28 | |
• #跟帖# This is called "envy-free division problem" [脑筋急转] - innercool(101 bytes ) 2010-03-11 | |
• #跟帖# 回复:回复:Let me try [脑筋急转] - innercool(593 bytes ) 2010-01-15 | |
• #跟帖# Let me try [脑筋急转] - innercool(766 bytes ) 2010-01-14 | |
• #跟帖# 回复:thanks. I am just curious. [脑筋急转] - innercool(72 bytes ) 2010-01-03 | |
• #跟帖# 回复:Yes. Do you have a fast and easy way to explain it? [脑筋急转] - innercool(259 bytes ) 2009-12-30 | |
• Round table problem [脑筋急转] - innercool(716 bytes ) 2009-11-19 | |
• #跟帖# Impossible. [脑筋急转] - innercool(154 bytes ) 2009-10-23 | |
• #跟帖# One simple argument [脑筋急转] - innercool(229 bytes ) 2009-10-21 | |
• #跟帖# Sorry, try again. [脑筋急转] - InnerCool(121 bytes ) 2009-10-11 | |
• #跟帖# By Fano plane I meant this. [脑筋急转] - innercool(90 bytes ) 2009-10-11 | |
• #跟帖# It is possible using the Fano plane [脑筋急转] - innercool(245 bytes ) 2009-10-10 | |
• #跟帖# By copy and paste [脑筋急转] - innercool(659 bytes ) 2009-10-10 | |
• #跟帖# You may know that there is a so called "Komogorov complexity" [脑筋急转] - innercool(160 bytes ) 2009-10-08 | |
• #跟帖# No, it is simple if you care only about the prob. of extinction [脑筋急转] - innercool(80 bytes ) 2009-09-27 | |
• #跟帖# Unbelievable! [脑筋急转] - innercool(69 bytes ) 2009-09-26 | |
• #跟帖# Would you please show your reasoning for 4 and 5? Thanks! [脑筋急转] - innercool(0 bytes ) 2009-09-19 | |
• #跟帖# 回复:公务员考试: 数列推理: 看看你能做几道 [脑筋急转] - InnerCool(212 bytes ) 2009-09-17 | |
• #跟帖# 回复:公务员考试: 数列推理: 看看你能做几道 [脑筋急转] - InnerCool(212 bytes ) 2009-09-17 | |
• #跟帖# 回复:印度奥赛题(2星半):无穷序列的最大值 [脑筋急转] - innercool(211 bytes ) 2009-09-17 | |
• #跟帖# 回复:印度奥赛题:16个数(2星) [脑筋急转] - innercool(40 bytes ) 2009-09-12 | |
• #跟帖# 回复:请大家帮忙做个Puzzle: [脑筋急转] - innercool(114 bytes ) 2009-09-06 | |
• #跟帖# 回复:give you an interesting one. LOL [脑筋急转] - innercool(35 bytes ) 2009-08-28 | |
• #跟帖# And here is what I googled to get [脑筋急转] - innercool(291 bytes ) 2009-08-15 | |
• #跟帖# Good question. [脑筋急转] - innercool(338 bytes ) 2009-08-14 | |
页次:1/1 每页50条记录, 本页显示1 到35, 共35 分页: [1] | |
备份档案: 当前 | 2023 | 2022 | 2021 | 2020 | 2019 | 2018 | 2017 | 2016 | 2015 | 2014 | 2013 | 2012 | 2011 | 2010 | 2009 | 2008 | 2007 | 2006 | 2005 | 2004 | 2003 | |