Euler theorem
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 118 Accepted Submission(s): 101
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).
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.
A single line contains a nonnegative integer, denoting the answer.
Sample Input
2 1 3
Sample Output
2
3
找规律: ans=(n+1)/2+1
吐血,看了一个小时,完全搞错mod的含义了
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long int ll;
int main()
{
int t;
ll n;
scanf("%d",&t);
while(t--)
{
scanf("%lld",&n);
printf("%lld\n",(n+1)/2+1);
}
return 0;
}