SGU 102

102. Coprimes time limit per test: 0.25 sec. memory limit per test: 4096 KB For given integer N (1<=N<=104) find amount of positive numbers not greater than N that coprime with N. Let us call two positive integers (say, A and B, for example) coprime if (and only if) their greatest common divisor is 1. (i.e. A and B are coprime iff gcd(A,B) = 1). Input Input file contains integer N. Output Write answer in output file. Sample Input 9 Sample Output 6

水题

#include<stdio.h>

const bool isOJ = 0;

int GCD(int a,int b){
	if (b == 0) return a;
	else return GCD(b,a%b);
}

int Work(){
	int n;
	if (scanf("%d",&n) == EOF)
		return 0;
	int sum = 0,i;
	for (i = 1;i <= n;i++)
		sum += GCD(n,i) == 1;
	printf("%d\n",sum);
	return 1;
}

int main(){
	if (!isOJ)
		freopen("/Users/mac/Desktop/test.in","r",stdin);
	while(Work());
	return 0;
}