杭电 Euler theorem

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

213

 

Sample Output

2
3
思路：找规律！！列出前几组递推可得规律
AC代码如下：
#include <iostream>#include <cstdio>using namespace std;int main(){    int n,num;    cin>>n;    while(n--)    {        cin>>num;        if(num%2==1) num++;        cout<<num/2+1<<endl;    }    return 0;}