Can anyone tell actually what's the behind that problem.I proved many individual cases but didn't find any formula or pattern, except for the numbers given by n(n+1)/2.
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3757 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 171 |
2 | awoo | 165 |
3 | adamant | 164 |
4 | TheScrasse | 159 |
5 | maroonrk | 155 |
6 | nor | 154 |
7 | -is-this-fft- | 152 |
8 | Petr | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
slycelote
|
14 лет назад,
#
|
0
It's quite easy to prove by induction that the set of points accessible after n jumps is {-n(n+1)/2, -n(n+1)/2 + 2, ... , n*(n+1)/2-2, n*(n+1)/2}. Just move this set by (n+1) and -(n+1) and see what happens.
→
Ответить
|
Название |
---|