B. Move and Turn（数论思维

lcxdz

于 2022-06-05 21:54:14 发布

阅读量176

点赞数

CC 4.0 BY-SA版权

分类专栏：思维数论文章标签： c++ 算法贪心算法

本文链接：https://blog.csdn.net/Minelois/article/details/125137430

思维同时被 2 个专栏收录

237 篇文章

订阅专栏

数论

111 篇文章

订阅专栏

本文探讨了一个机器人在二维平面上移动的问题。机器人每次可以向北、南、东、西四个方向移动一米，并在每一步之后必须左转或右转90度。问题要求计算在n步后机器人可以到达的不同位置数量。程序通过判断步数的奇偶性来计算结果，对于偶数步，答案是(n/2+1)的平方；对于奇数步，答案是(n/2+1)的平方加上(n/2+2)的平方。这个题目涉及到了动态规划和路径计数的概念。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

添加链接描述
如果是偶数，可以上下和左右分别走n/2+1
如果是奇数，左右上下分别为n/2+1或者n/2+2 两种情况要累加
A robot is standing at the origin of the infinite two-dimensional plane. Each second the robot moves exactly 1 meter in one of the four cardinal directions: north, south, west, and east. For the first step the robot can choose any of the four directions, but then at the end of every second it has to turn 90 degrees left or right with respect to the direction it just moved in. For example, if the robot has just moved north or south, the next step it takes has to be either west or east, and vice versa.

The robot makes exactly n steps from its starting position according to the rules above. How many different points can the robot arrive to at the end? The final orientation of the robot can be ignored.

Input
The only line contains a single integer n (1≤n≤1000) — the number of steps the robot makes.

Output
Print a single integer — the number of different possible locations after exactly n steps.

#include<bits/stdc++.h>
using namespace std;
int main(){
	
	int n;
	cin>>n;
	int p=n/2;
	if(n%2==0)cout<<(p+1)*(p+1);
	else cout<<(p+1)*(p+2)*2;
	
	
	return 0;
}