НачалоПодразделы
| 790. Word Ladder |
| 791. Bonus Word |
| 792. Contest |
| 793. Cycling |
| 794. Escape |
| 795. Settling Salesman Problem |
| 796. Space |
| 797. Herbert |
Другие разделы
| Тренировка 1 |
| Тренировка 2 |
| Тренировка 3 |
| Тренировка 4 |
Дата и время
17/11/2024 01:17:17
Тренировка 5
A. Word Ladder B. Bonus Word C. Contest D. Cycling E. Escape F. Settling Salesman Problem G. Space H. Herbert
H. Herbert
Вывод формулыОлимпиадные задачи на английском языке
| 08/02/2008 | Тренировка (задачи Benelux APC preliminary 2007) (H) |
| 11/07/2013 | Лето 2013-8 (H) |
| 09/01/2017 | Марафон 1 (командный) "Hatter's riddles" (I) |
Ограничения: время – 1s/2s, память – 64MiB Ввод: input.txt или стандартный ввод Вывод: output.txt или стандартный вывод 
Послать решение Blockly Посылки Темы Где Обсудить (0)
Herbert is a game in which you control a robot on an infinite two-dimensional grid. There
are three commands available to you:
- s: Go one square forward in the current direction.
- l: Turn ninety degrees counterclockwise.
- r: Turn ninety degrees clockwise.
After playing this game for a while, you wonder how many squares you can reach within a
certain number of moves. Write a program to calculate the answer to this question.
Input
On the first line an integer `t` (`1\ ≤\ t\ ≤\ 100`): the number of test cases. Then for each test
case:
- One line with an integer `n` (`0\ ≤\ n\ ≤\ 1\ 000\ 000\ 000`): the maximum number of moves.
Output
For each test case:
- One line with the number of reachable squares.
Sample input
4 0 1 2 3
Sample output
1 2 5 11
