跳蚤题！谢谢NN!

yaoyao99

是，我看你们几个跳了半天，我看都看累了。。。

[此贴子已经被作者于2006-7-31 0:50:08编辑过]

jandjshi

I need a beer. I can't believe I just wasted 15 minutes on this question.

codychen

從(0,0)->(1,0)  來回跳(2次),在直線前進(3次) 1種

  (0,0)->(0,1)  來回跳(2次),在直線前進(3次) 1種 

  (0,0)->(-1,0) 來回跳(2次),在直線前進(3次) 1種

  (0,0)->(0,-1) 來回跳(2次),在直線前進(3次) 1種

在來 (0,0)=>(0,1)=>(1,1)=>(2,1)=>(3,1)=>(3,0)1種

     (0,0)=>(1,0)=>(1,1)=>(2,1)=>(3,1)=>(3,0)1種

     (0,0)=>(1,0)=>(2,0)=>(2,1)=>(3,1)=>(3,0)1種

     (0,0)=>(0,-1)=>(1,-1)=>(2,-1)=>(3,-1)=>(3,0)1種

     (0,0)=>(1,0)=>(1,-1)=>(2,-1)=>(3,-1)=>(3,0)1種

     (0,0)=>(1,0)=>(2,0)=>(2,-1)=>(3,-1)=>(3,0)1種

總共十種

lexie

well...I think there are more than 10 roads to take.

So far, I got 13. 

3 more than above: (0,0)->(1,0)->(2,0)-> (3,0)->(4,0)->(3,0)

                       (0,0)-> (1,0)->(2,0)->(1,0) ->(2,0)->(3,0)

                       (0,0)->(1,0)-> (2,0)->(3,0)->(2,0) ->(3,0)

Open to discuss.

Although I am not sure whether the conditions are sufficiently given in this problem, it's pretty interesting to work on this math problem.

[此贴子已经被作者于2006-7-31 20:41:58编辑过]