panel please problem urn return bottom -1 fan std

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 題意：有兩個正整數a,b。a已知，b未知,求a mod b有幾種情況 題解：手算幾個即可發現規律。以7為例，有如下5種情況 7(b>7),1(b==6||b==3||b==2),2(b==5),3(b==4),0(b==1||b==7);

 1 #include<iostream>
 2 #include<cstdio>
 3 using namespace std;
 4 
 5 int T;
 6 long long a;
 7 int main()
 8 {
 9     scanf("%d",&T);
10     while(T--)
11     {
12         scanf("%lld",&a);
13         printf("%lld\n",(a+1)/2+1);
14     }
15     return 0;
16
 
 }

HDU 6124 17多校7 Euler theorem（簡單思維題）