hdu_6124_打表_找规律

Euler theorem

Prev Submit Status Statistics Next
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

给你一个数a 让它mod b b未知,求不同的余数有几个,打表一看便知.

#include<iostream>
#include<cstdio>
#include<cstring>
#include<map>
typedef long long ll;
using namespace std;

int main()
{
    ll n,i,j;
   int t;
   scanf("%d",&t);
   while(t--)
   {
       scanf("%lld",&n);
       if(n==1)
       {
           puts("2");
           continue;
       }
       if(n%2==0)
        printf("%lld\n",n/2+1);
       else
        printf("%lld\n",n/2+2);
   }

    return 0;
}