玲珑杯-1068-Lights【规律】

最新推荐文章于 2017-10-30 18:20:13 发布

Somethingwll

最新推荐文章于 2017-10-30 18:20:13 发布

阅读量304

点赞数

分类专栏：找规律

本文链接：https://blog.csdn.net/wang907553141/article/details/53712027

版权

找规律专栏收录该内容

12 篇文章 0 订阅

订阅专栏

题目链接：点击打开链接

1068 - Lights

Time Limit：1s Memory Limit：1024MByte

Submissions：205Solved：106

DESCRIPTION

 Mr. Van is given a regular polygon of size N, which is a positive odd number. At each vertex there is a guard which can be rotated. Initially, all the guards face to the inner center of the vertex. Now Mr. Van wants to rotate all guards faced to the outside. A guard can only be rotated 180 degree in one step. When he rotates the a guard 180 degree, the guard itself and the two guards which are opposite to it will also rotate 180 degree. Now given N, please tell Mr.Van the minimum steps of rotating in order to turn all the guards faced to the outside.

INPUT

    The first line is a single integer 
     
   TT, indicating the number of test cases. 
   
 For each test case: 
   
 The input contains a single odd integer 
     
   N (3≤N≤1000)N (3≤N≤1000).

OUTPUT

    For each test case, output the answer in a single line. 
  

SAMPLE INPUT

SAMPLE OUTPUT

5

1

大意：给出一个奇多边形，每次操作可以使一个顶点和这个顶点所对应的对面的两个顶点旋转 180 度，每个点的初始状态都是朝向多边形中心，问最少需要几次操作使得所有的顶点都朝向外边。

思路：规律题，3 的倍数时需要 n/3 次，其他需要 n 次。

#include<cstdio>
using namespace std;
int n; 
int main()
{
	int t;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d",&n);
		if(n%3==0)
			printf("%d\n",n/3);
		else
			printf("%d\n",n);
	}
	return 0;
}