欧拉函数用于计算小于给定正整数n且与n互质的正整数数量。当n为素数时，答案为n-1；否则，可用通式φ(x) = x * (1 - 1/p1) * (1 - 1/p2) * ... * (1 - 1/pn)计算，其中p1, p2,...,pn是x的所有质因数。"
103352388,8566618,初入产品行业：如何通过坚持积累提升产品思维,"['产品设计', '用户体验', '日程管理', '产品分析', '个人成长']
Relatives
use MathJax to parse formulas
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
0Sample Output
6
4首先讲一下欧拉函数 例如
订阅专栏 解锁全文
扫一扫
224
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
