hdoj5430Reflect【欧拉函数】

Reflect

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 445    Accepted Submission(s): 270

Problem Description

We send a light from one point on a mirror material circle,it reflects  N  times and return the original point firstly.Your task is calcuate the number of schemes.

 

Input

First line contains a single integer  T(T≤10)  which denotes the number of test cases. 

For each test case, there is an positive integer  N(N≤106) .

 

Output

For each case, output the answer.

 

Sample Input

  
  

   
   1
4
  
  

 

Sample Output

  
  

   
   4
  
  

 

Source

BestCoder Round #54 (div.2)

既约分数即最简分数

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
using namespace std;
int Euler(int n){
	int ret=1,i;
	for(i=2;i*i<=n;++i){
		if(n%i==0){
			n/=i;ret*=i-1;
			while(n%i==0){
				n/=i;ret*=i;
			}
		}
	}
	if(n>1)ret*=n-1;
	return ret;
}
int main()
{
	int t,i,j,k,n;
	scanf("%d",&t);
	while(t--){
		scanf("%d",&n);
		printf("%d\n",Euler(n+1));
	}
	return 0;
}