题目: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
水题,直接上代码
#include <bits/stdc++.h> #include <iostream> #include <cstring> #include <stack> #include <cstdlib> #include <queue> #include <cmath> #include <cstdio> #include <algorithm> #include <string> #include <vector> #include <list> #include <iterator> #include <set> #include <map> #include <utility> #include <iomanip> #include <ctime> #include <sstream> #include <bitset> #include <deque> #include <limits> #include <numeric> #include <functional> #define gc getchar() #define mem(a) memset(a,0,sizeof(a)) #define mod 1000000007 #define sort(a,n,int) sort(a,a+n,less<int>()) #define fread() freopen("in.in","r",stdin) #define fwrite() freopen("out.out","w",stdout) using namespace std; typedef long long ll; typedef char ch; typedef double db; const int maxn=1e5+10; int main() { int t; cin>>t; while(t--) { ll n; cin>>n; cout<<(n+1)/2+1<<endl; } return 0; }