hdu 6124 Euler theorem

最新推荐文章于 2019-07-18 21:24:58 发布

原创最新推荐文章于 2019-07-18 21:24:58 发布 · 226 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#2017多校 #ACM #hdu

2017多校专栏收录该内容

31 篇文章

订阅专栏

本篇博客介绍了一道编程题目，任务是给定一个正整数a，在忘记b的情况下找出a mod b可能的不同结果数量。文章提供了一个简单的算法实现方案，通过观察样例数据得出规律并给出解答。

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

Euler theorem

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

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

找规律: ans=(n+1)/2+1

吐血，看了一个小时，完全搞错mod的含义了

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long int ll;

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