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
分析:
找规律,两个一组,前两个输出2,之后输出3,4,5依次递增。
- #include<bits/stdc++.h>
- using namespace std;
- int main()
- {
- int t;
- cin>>t;
- while(t--)
- {
- long long a;
- cin>>a;
- if(a%2==0) cout<<a/2+1<<endl;
- else cout<<(a+1)/2+1<<endl;
- }
- return 0;
- }
本文来自CSDN博客,转载请标明出处: http://blog.csdn.net/Dingle_Captain/article/details/77187745