HDU-Euler theorem(欧拉定理)

最新推荐文章于 2021-11-25 22:52:36 发布

空巷挽清风

最新推荐文章于 2021-11-25 22:52:36 发布

阅读量443

点赞数

分类专栏： ACM_数学

本文链接：https://blog.csdn.net/kong_xiang/article/details/77452990

版权

ACM_数学专栏收录该内容

12 篇文章 0 订阅

订阅专栏

Euler theorem

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)
Total Submission(s): 1322 Accepted Submission(s): 868

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

解析

题目的意思是给出一个a，对于任意的b，得到c=a%b,求c的种类
思路：很明显0和a本身是符合的，然后多于a/2都符合，所以答案就是(a-1)/2+2;

代码

#include <iostream>
#include <cstdio>
using namespace std;

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