Time for test: 1 sec Place for test: 256 MB On the

Question

Time for test: 1 sec Place for test: 256 MB On the

axis X coordinate 0 there's a grasshopper, he can jump to the point with same distance, as divider where it sits. When it is on point 0, he can jump only to 1, when it is on point 1, it can also jump to 1, when it's on point 2, it can jump to 1 or 2, on point 9 it can jump to 1, 3 or 9
Question:
You have an integer N(....), how many possibilities you have to get grasshopper to the point N?

0

02.01.2018

3 ответов

6 просмотров

Пользователь 61529

it's dynamic programming, not c++

0

02.01.2018

Michael

Am I just really dumb, or is this translated wrongly? I mean, how do you ever want to reach 2 or greater when you can only jump from 0 to 1 and then from 1 to 1 again???

0

02.01.2018

Пользователь 61663 · Accepted Answer

Пользователь 61663

Thank you for your translate! 😊

0

02.01.2018

Похожие чаты

Time for test: 1 sec Place for test: 256 MB On the

3 ответов

Похожие вопросы