17多校contest 7- Euler theorem ( 数学规律

Euler theorem

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的余数个数。

题解：

明显的规律题 签个到TAT

AC代码

#include <bits/stdc++.h>
using namespace std;

#define LL long long
#define CLR(a,b) memset(a,(b),sizeof(a))

const int INF = 0x3f3f3f3f;
const LL INFLL = 0x3f3f3f3f3f3f3f3f;
const int N = 1e5+10;

int main()
{
    int T;
    scanf("%d",&T);
    while(T--) {
        int a;
        scanf("%d",&a);
        printf("%d\n",(a+1)/2+1);
    }
return 0;
}