码迷,mamicode.com
首页 > 其他好文 > 详细

POJ 2407 Relatives

时间:2016-11-07 22:05:27      阅读:165      评论:0      收藏:0      [点我收藏+]

标签:any   str   函数   scan   answering   sed   print   oca   ati   

Time Limit: 1000MS   Memory Limit: 65536K
Total Submissions: 13920   Accepted: 6965

Description

Given n, a positive integer, how many positive integers less than n are relatively prime to n? Two integers a and b are relatively prime if there are no integers x > 1, y > 0, z > 0 such that a = xy and b = xz.

Input

There are several test cases. For each test case, standard input contains a line with n <= 1,000,000,000. A line containing 0 follows the last case.

Output

For each test case there should be single line of output answering the question posed above.

Sample Input

7
12
0

Sample Output

6
4

Source

 1 #include<cstdio>
 2 int euler_phi(int p){
 3     int phi=p;
 4     for(int i=2;i*i<=p;i++){
 5         if(!(p%i)){
 6             phi=phi-phi/i;
 7             while(!(p%i))
 8                 p/=i;
 9         }
10     }
11     if(p>1)
12         phi=phi-phi/p;
13     return phi;
14 }
15 int main(){
16     int p;
17     while(scanf("%d",&p),p)
18         printf("%d\n",euler_phi(p));
19     return 0;
20 }

裸的欧拉函数

 

POJ 2407 Relatives

标签:any   str   函数   scan   answering   sed   print   oca   ati   

原文地址:http://www.cnblogs.com/suishiguang/p/6040764.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!