题目：Problem - 6124
http://acm.hdu.edu.cn/showproblem.php?pid=6124
Euler theorem
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)
Total Submission(s): 601 Accepted Submission(s): 481 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 Source 2017 Multi-University Training Contest - Team 7 Recommend
题意：题意是a除以一个数，所得到的余数，有几种可能。
思路：找规律，发现，如果a是偶数，那么有a/2+1种可能，如果a是奇数，那么有a/2+2可能。这个结论，可以记下来，免得以后怀疑自己。
代码 #include #include #include using namespace std; int main(){ int t; cin>>t; int n; while(t--){ cin>>n; if(n%2==0) cout<2+1<else cout<2+2<return 0; }