HDU 6124

Euler theorem

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 524288/524288 K (Java/Others)

Total Submission(s): 636    Accepted Submission(s): 509


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%b（任意值）的个数。

源代码：

#include<iostream>
#include<cstdio>
using namespace std;
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
long long a;
scanf("%lld",&a);
if(a&1) printf("%lld\n",a/2+2);
else printf("%lld\n",a/2+1);
}
return 0;
}