Reflect
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 174 Accepted Submission(s): 112
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.
![](../../data/images/C628-1004-1.jpg)
![](../../data/images/C628-1004-1.jpg)
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) .
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
#include <map>
#include <set>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <vector>
#include <queue>
#include <iostream>
#include <string>
#include <sstream>
#include <cstdlib>
#include <ctime>
#include <cctype>
#include <algorithm>
using namespace std;
#define pb push_back
#define mp make_pair
#define fillchar(a, x) memset(a, x, sizeof(a))
#define copy(a, b) memcpy(a, b, sizeof(a))
#define S_queue<P> priority_queue<P, vector<P>,greater<P> >
typedef long long LL;
typedef pair<int, string > PII;
typedef unsigned long long uLL;
template<typename T>
void print(T* p, T* q, string Gap = " ") {
int d = p < q ? 1 : -1;
while(p != q) {
cout << *p;
p += d;
if(p != q) cout << Gap;
}
cout << endl;
}
template<typename T>
void print(const T &a, string bes = "") {
int len = bes.length();
if(len >= 2)cout << bes[0] << a << bes[1] << endl;
else cout << a << endl;
}
const int INF = 0x3f3f3f3f;
const int MAXM = 1e2 + 5;
const int MAXN = 1e6 +5;
LL getOL(LL n) {
LL res = n;
for(int i = 2; i <= sqrt(n); i ++) {
if(n % i == 0) {
res = res / i * (i - 1);
while(n % i == 0) n /= i;
}
}
if(n > 1) res = res / n * (n - 1);
return res;
}
int main() {
int T, n;
cin >> T;
while(T --){
cin >> n;
print(getOL(n + 1));
}
return 0;
}