Polya定理
Keep_Trying_Go
无
展开
-
poj2409(纯Polya定理)
#include<iostream>#include<algorithm>#include<cstring>#include<cmath>using namespace std;const int mod=9937;int n,m;int exgcd(int a,int b,int&x,int&y){//欧几里得扩展 if(b==0){ x=1;y=0; return a; } int r=exgcd(b,a%b,x原创 2021-02-18 10:52:23 · 134 阅读 · 0 评论 -
poj1286(纯Polya定理)
#include<iostream>#include<algorithm>#include<cstring>#include<cmath>using namespace std;typedef long long ll;const int mod=9937;ll n,m;ll exgcd(ll a,ll b,ll&x,ll&y){//欧几里得扩展 if(b==0){ x=1;y=0; return a; } ll原创 2021-02-18 10:48:20 · 139 阅读 · 0 评论 -
poj2154(Polya+欧拉函数优化模版)
#include <cstdio>#include <cstring>#include<iostream>using namespace std;const int maxx=45000;int p;int vis[maxx];bool primes[maxx];int k=0;void prime(){//素数筛 int i,j; memset(primes,true,sizeof(primes)); for(i=2;i<原创 2021-02-18 10:23:11 · 174 阅读 · 0 评论 -
HDU2239(Polya+欧拉函数优化模版)
#include<cstdio>#include<iostream>#include<cstring>#include<string.h>#include<cstdlib>#include<cmath>#include<vector>#include<algorithm>using namespace std;const int maxx=1e6+10;const int mod=9937;原创 2021-02-18 10:16:03 · 104 阅读 · 0 评论