hdu6124--Euler theorem

Problem Description

HazelFan is given two positive integersa,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 integerT(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

213

Sample Output

23

 

分析

以为是欧拉，各种打表找规律

mmp写出前10个立刻出结果

就是(a+1)/2+1呵呵

代码

#include<cstdio>#include<iostream>using namespace std;int main(){    int t;    scanf("%d",&t);    while(t--)    {        int a;        scanf("%d",&a);        cout<<(a+1)/2+1<<endl;    }    return 0;}

链接