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

 1 //2017-09-22
 2 #include <cstdio>
 3 #include <cstring>
 4 #include <iostream>
 5 #include <algorithm>
 6 #define ll long long
 7
 8 using namespace std;
 9
10 int main()
11 {
12     int T;
13     ll n;
14     cin>>T;
15     while(T--){
16         cin>>n;
17         if(n == 1)cout<<2<<endl;
18         else if(n&1)cout<<n/2+2<<endl;
19         else cout<<n/2+1<<endl;
20     }
21
22     return 0;
23 }