HDU6124

Euler theorem

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 524288/524288 K (Java/Others)
Total Submission(s): 742    Accepted Submission(s): 584

Problem Description

HazelFan is given two positive integers a,b， and he wants to calculate amodb. But now he forgets the value of b and only remember the value of a, please tell him the number of different possible results.

 

Input

The first line contains a positive integer T(1≤T≤5), denoting the number of test cases.
For each test case:
A single line contains a positive integer a(1≤a≤109).

 

Output

For each test case:
A single line contains a nonnegative integer, denoting the answer.

 

Sample Input

2
1
3

 

Sample Output

2
3

 

Source

2017 Multi-University Training Contest - Team 7

 

 //2017-09-22
 #include <cstdio>
 #include <cstring>
 #include <iostream>
 #include <algorithm>
 #define ll long long

 using namespace std;

 int main()
 {
     int T;
     ll n;
     cin>>T;
     while(T--){
         cin>>n;
         if(n == )cout<<<<endl;
         else if(n&)cout<<n/+<<endl;
         else cout<<n/+<<endl;
     }

     return ;
 }