欧拉函数
UCAS王小二
不念过去,不畏未来...
展开
-
51nod 1136
1136欧拉函数对正整数n,欧拉函数是少于或等于n的数中与n互质的数的数目。此函数以其首名研究者欧拉命名,它又称为Euler's totient function、φ函数、欧拉商数等。例如:φ(8) = 4(Phi(8) = 4),因为1,3,5,7均和8互质。Input输入一个数N。(2 Output输出Phi(n)。Input示例8O原创 2017-03-17 00:55:38 · 245 阅读 · 0 评论 -
LightOJ 1370 Bi-shoe and Phi-shoe【欧拉打表】
Bamboo Pole-vault is a massively popular sport in Xzhiland. And Master Phi-shoe is a very popular coach for his success. He needs some bamboos for his students, so he asked his assistant Bi-Shoe to go原创 2018-02-02 17:02:40 · 214 阅读 · 0 评论 -
容斥原理 && 欧拉函数 && 抽屉原理 总结
转载博客(1)容斥原理 :求在区间[1,m]里有多少个数,与n互质。假设数据不超过int型。实现过程分为两步:1, 求出n的质因子 并保存在数组里面;2, 求出区间[1,m]里面有多少个数与n不互质。 代码:[cpp] view plain copyprint?#include #include int p[10]转载 2017-04-18 00:07:05 · 602 阅读 · 0 评论 -
数论总结
前言:走进区域赛,切实的发现数论和思维的重要性,于是弱鸡努力总结一波!一:约数个数定理定义g(x),为x的约数个数,对于一个数i,可分解成若干质数幂次的乘积,即: i=prime[1]a∗prime[2]b∗….. g(i)=(a+1)∗(b+1)∗……二:整除的基本性质a|b b|c => a|c a|b a|c => a|bc a|b a|c => a|ib±jc原创 2017-11-06 22:27:54 · 700 阅读 · 0 评论 -
zzuli 2182 不是签到题XD【数论定理】
Description小明是一个贪心的孩子,他天天想着怎么让自己省钱。有一天他去商店买物品,然而他不是普通人,他有一个马基雅把库内的能力,可以只花掉商品价格与他今日幸运数字x的最大公约数的钱就能买走这个商品。那么问题来了,如果他要买价值从1到x元的x个商品,一共要花掉多少钱。 Input本题有多组测试数据,每组包含一个整数,代表小明今日的幸运数字x,1<=x<=1e11 Output对于每组输入原创 2017-08-25 22:08:30 · 578 阅读 · 0 评论 -
hdu 2588 GCD【欧拉+gcd推导*经典】
GCDTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2312 Accepted Submission(s): 1167Problem DescriptionThe greatest common di原创 2017-07-26 11:45:13 · 414 阅读 · 0 评论 -
LightOJ - 1370【欧拉筛法*经典】
Bamboo Pole-vault is a massively popular sport in Xzhiland. And Master Phi-shoe is a very popular coach for his success. He needs some bamboos for his students, so he asked his assistant Bi-Shoe to go原创 2017-07-26 10:52:13 · 392 阅读 · 0 评论 -
hdu 1695 GCD【容斥+欧拉】
GCD Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 9524 Accepted Submission(s): 3544Problem Description Given 5 integers: a, b, c, d, k,原创 2017-07-31 10:17:20 · 1165 阅读 · 0 评论 -
LightOJ - 1341 【唯一分解定理】
It's said that Aladdin had to solve seven mysteries before getting the Magical Lamp which summons a powerful Genie. Here we are concerned about the first mystery.Aladdin was about to enter to a magi原创 2017-07-26 16:06:01 · 2059 阅读 · 1 评论 -
hdoj1286 欧拉函数模板
找新朋友Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8942 Accepted Submission(s): 4715Problem Description新年快到了,“猪头帮协会”准备搞一个聚原创 2017-04-19 00:16:15 · 333 阅读 · 0 评论 -
bzoj 2705: [SDOI2012]Longge的问题【欧拉函数+gcd】
bzoj 2705: [SDOI2012]Longge的问题 题意:给你一个整数n,求 ∑i=1ngcd(i,n)" role="presentation" style="position: relative;">∑ni=1gcd(i,n)∑i=1ngcd(i,n)\sum_{i=1}^{n}gcd(i,n) . 分析: k=gcd(i,n)=>1=gcd(i/k,n/原创 2018-02-06 15:54:34 · 218 阅读 · 0 评论