欧拉函数
Keep_Trying_Go
无
展开
-
欧拉函数算法模版
欧拉函数核心算法ll phi(ll n){ ll i,res=n; for(i=2;i*i<=n;i++) { if(n%i==0) { res=res-res/i; while(n%i==0) { n/=i; } } } if(n>1)res=res-res/n; return res;}ll Euler_1(ll n){ ll res=n; for(int i=2;i<=n/i;i++){ if(n%i==0){原创 2021-05-01 14:33:17 · 169 阅读 · 0 评论 -
poj2407
#include<iostream>#include<algorithm>#include<cstring>using namespace std;typedef long long ll;const int maxx=100;ll vis[maxx];ll n;ll Eoul(ll n){ ll res=n; for(int i=2;i<=n/i;i++){ if(n%i==0){ res=res/i*(i-1); while(原创 2021-03-07 07:26:03 · 144 阅读 · 0 评论 -
HDU1286
#include<iostream>#include<algorithm>#include<cstring>using namespace std;typedef long long ll;ll n;ll Eoul(ll n){ ll res=n; for(int i=2;i<=n/i;i++){ if(n%i==0){ res=res/i*(i-1); while(n%i==0){ n/=i; } } } if原创 2021-03-06 11:57:28 · 128 阅读 · 0 评论 -
HDU2588
#include<iostream>#include<algorithm>#include<cstring>#include<cmath>using namespace std;typedef long long ll;ll n,m;ll Gcd(ll a,ll b){ return b==0?a:Gcd(b,a%b);}ll Eoul(ll n){ ll res=n; for(int i=2;i<=n/i;i++){ if(原创 2021-03-06 11:56:56 · 74 阅读 · 0 评论 -
HDU2824
#include<iostream>#include<algorithm>#include<cstring>using namespace std;typedef long long ll;const ll maxx=3e6+10;ll a,b;ll vis[maxx];//欧拉函数sqrt(n) ll Euler_1(ll n){ ll res=n; for(int i=2;i<=n/i;i++){ if(n%i==0){ res=原创 2021-03-06 11:55:52 · 77 阅读 · 0 评论 -
HDU3501
#include<iostream>#include<algorithm>#include<cstring>using namespace std;typedef unsigned long long ll;const ll mod=1000000007;const ll maxx=1e5+10;ll vis[maxx];ll ans[maxx];ll n;ll Euler(ll n){ ll res=n; for(int i=2;i<=n/原创 2021-03-06 11:54:45 · 71 阅读 · 0 评论