编程介的小学生 2019-08-15 21:49 采纳率: 20.5%
浏览 128

正确运用C语言,解决Herbert问题

Problem Description
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

  • 写回答

0条回答 默认 最新

    报告相同问题?

    悬赏问题

    • ¥15 求差集那个函数有问题,有无佬可以解决
    • ¥15 【提问】基于Invest的水源涵养
    • ¥20 微信网友居然可以通过vx号找到我绑的手机号
    • ¥15 寻一个支付宝扫码远程授权登录的软件助手app
    • ¥15 解riccati方程组
    • ¥15 display:none;样式在嵌套结构中的已设置了display样式的元素上不起作用?
    • ¥15 使用rabbitMQ 消息队列作为url源进行多线程爬取时,总有几个url没有处理的问题。
    • ¥15 Ubuntu在安装序列比对软件STAR时出现报错如何解决
    • ¥50 树莓派安卓APK系统签名
    • ¥65 汇编语言除法溢出问题