HDOJ--6124--Euler theorem

题目描述：
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.
输入描述:
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).
输出描述:
For each test case:
A single line contains a nonnegative integer, denoting the answer.
输入：
2
1
3
输出：
2
3
题意：
有两个正整数A，B，她想计算A mod B。但现在她忘记了B的值，只记住了A的值。你现在要做的就是帮助计算出答案一共有多少中可能。
题解：

1. a小于等于b的时候有(n + 1)/2
2. a大于b的时候有1种

代码：

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;

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