hdu 6124 Euler theorem（水题）

http://acm.hdu.edu.cn/showproblem.php?pid=6124
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，输出a的余数个数。
解题思路：打表可以发现规律a的取值从1到10，余数个数分别是2，2，3，3，4，4，5，5，6，6……，可以找出通项公式a【n】=(n+1)/2+1；
最后直接输出就可以了。

#include <bits/stdc++.h>

using namespace std;

int main()
{
    int T;scanf("%d",&T);
    while(T--){
        int n;
        scanf("%d",&n);
        printf("%d\n",(n+1)/2+1);
    }
    return 0;
}