HDU1787

最新推荐文章于 2019-08-21 11:23:32 发布

bupt_zbybr

最新推荐文章于 2019-08-21 11:23:32 发布

阅读量469

点赞数

分类专栏： ACM-数论

本文链接：https://blog.csdn.net/u014598631/article/details/34828949

版权

ACM-数论专栏收录该内容

3 篇文章 0 订阅

订阅专栏

HDU 1787

GCD Again

Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2293 Accepted Submission(s): 928

Problem Description

Do you have spent some time to think and try to solve those unsolved problem after one ACM contest?
No? Oh, you must do this when you want to become a "Big Cattle".
Now you will find that this problem is so familiar:
The greatest common divisor GCD (a, b) of two positive integers a and b, sometimes written (a, b), is the largest divisor common to a and b. For example, (1, 2) =1, (12, 18) =6. (a, b) can be easily found by the Euclidean algorithm. Now I am considering a little more difficult problem:
Given an integer N, please count the number of the integers M (0<M<N) which satisfies (N,M)>1.
This is a simple version of problem “GCD” which you have done in a contest recently,so I name this problem “GCD Again”.If you cannot solve it still,please take a good think about your method of study.
Good Luck!

Input

Input contains multiple test cases. Each test case contains an integers N (1<N<100000000). A test case containing 0 terminates the input and this test case is not to be processed.

Output

For each integers N you should output the number of integers M in one line, and with one line of output for each line in input.

Sample Input

Sample Output

0
1

Author

lcy

Source

2007省赛集训队练习赛（10）_以此感谢DOOMIII

题意是输入一个n，求i<=n且gcd(i,n)>1（也就是不互质）i的数目，大概思路是求出phi(n)，那么n-phi(n)就是不互质数的数目，还要再除去那个"1"，所以再减1

#include<cstdio>
#include<iostream>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<ctype.h>
#include<algorithm>
#include<time.h>
using namespace std;
#pragma comment(linker,"/STACK:102400000,102400000")
#define pi acos(-1.0)
#define eps 1e-7
#define mod 1000000007
#define INF 0x3f3f3f3f
typedef long long LL;

int euler(int x)
{
	int i,res=x;
	for (i=2;i*i<=x;i++)
		if(x%i==0)
		{
			res=res/i*(i-1);
			while(x%i==0) 
				x/=i;
		}
	if(x>1) 
		res=res/x*(x-1);
	return res;
}

int main(void)
{
	int t,n;
	while(scanf("%d",&n)!=EOF&&n)
	{
		printf("%d\n",n-euler(n)-1);
	}
	return 0;
}