Problem - 1005 Euler theoremt(杭电多校签到题)

Dingle_Captain

于 2017-08-15 13:24:21 发布

阅读量531

点赞数 5

CC 4.0 BY-SA版权

分类专栏：杭电多校

本文链接：https://blog.youkuaiyun.com/Dingle_Captain/article/details/77187745

杭电多校专栏收录该内容

2 篇文章

订阅专栏

本文介绍了一种快速计算给定整数a时，amodb运算可能产生的不同余数结果数量的方法。通过分析a的奇偶性，可以确定可能的不同结果数。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

分析：
找规律，两个一组，前两个输出2，之后输出3,4,5依次递增。
#include<bits/stdc++.h>
using namespace std;
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        long long a;
        cin>>a;
        if(a%2==0) cout<<a/2+1<<endl;
        else cout<<(a+1)/2+1<<endl;
    }
    return 0;
}