Euler theorem

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


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  
Recommend liuyiding   |   We have carefully selected several similar problems for you:  6216 6215 6214 6213 6212   
打表，观察，其实打出来，从1开始就是2，2，3，3，4， 也就是（n+1）/2+1,然后化简下 My ugly code #include #include #include #include #include #include #define ll long long using namespace std; ll t,a; int main(){ scanf("%d",&t); while(t--){ scanf("%d",&a); if(a==1) printf("2 "); else printf("%d ",(a+3)/2); } return 0; }