|
||||||||||
ReflectTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 856 Accepted Submission(s): 452 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 \leq 10)$ which denotes the number of test cases. For each test case, there is an positive integer $N (N \leq 10^{6})$. Output For each case, output the answer. Sample Input
Sample Output
Source | ||||||||||
|