数学计数原理（Pólya，高精度）：SGU 294 He's Circles

 

He's Circles

He wrote n letters "X" and "E" in a circle. He thought that there were 2n possibilities to do it, because each letter may be either "X" or "E". But Qc noticed that some different sequences of letters can be transformed one to another with a circular shift (thus representing actually the same circular string).
For example, strings "XXE"-"XEX"-"EXX" are actually the same.

Qc wants to know how many different circular strings of n letters exist. Help him to find that out.

Input

The input file contains a single integer 1 <= n <= 200000.

Output

Output a single integer --- the number circular strings of length n.

Sample Input

Sample test(s)

Input

Test #1
3

Test #2
4

Output

Test #1
4

Test #2
6

　　这道题是等价类计数问题。

　　由于是我写的第一题，我会把过程写的尽量详细，用以纪念。

　　题意：有一个长度为N的环，上面写着’X’和’E’，问本质不同的环有多少种。(N不超过200000)。

　　考虑用Pólya定理，答案是Σ（每个置换的不动点个数）/n，如何求不动点个数？这里枚举所有置换，假设当前枚举到的置换为"循环移动k位",d=（n，k）,若1位置在当前置换下可以到3位置，则1位置和3位置处在同一循环，这时循环的个数就是d（每个循环经过n*k/d个点，由于每个间距为k，所以一个循环有n/d个点，那么就有d个循环），这对答案的贡献就是2^d（每个循环中可涂任意相同颜色，不影响其为不动点），所以就可以枚举d，这时我们可以知道与n的GCD为d的数有φ（n/d）个，那么这里答案则为1/n*Σ2^d*φ（n/d）。

　　然后还要用高精度，真羡慕JAVA。

 #include <iostream>
 #include <cstring>
 #include <cstdio>
 using namespace std;
 const int maxn=;
 int n,tot;
 int phi[maxn],pri[maxn];

 void Linear_Shaker(){
     phi[]=;
     for(int i=;i<=n;i++){
         if(!phi[i]){
             phi[i]=i-;
             pri[++tot]=i;
         }
         for(int j=;j<=n;j++){
             if(i*pri[j]>n)break;
             if(i%pri[j]!=)
                 phi[i*pri[j]]=phi[i]*(pri[j]-);
             else{
                 phi[i*pri[j]]=phi[i]*pri[j];
                 break;
             }
         }
     }
 }

 int POW[]={,,,};
 const int mod=;
 struct ExtInt{
     int num[],len;
     ExtInt(int x){len=;
         memset(num,,sizeof(num));
         do{
             num[++len]=x%mod;
             x/=mod;
         }while(x);
     }

     void Scf(){
         char s[];scanf("%s",s+);
         memset(num,,sizeof(num));len=;
         for(int i=strlen(s+),cnt=;i>=;i--){
             num[len]+=POW[cnt++]*(s[i]-'');
             if(cnt==)cnt=,len+=;
         }
     }

     int operator [](int x){
         return num[x];
     }    

     void Prf(){
         printf("%d",num[len]);
         for(int i=len-;i>=;i--)
             printf("%04d",num[i]);
         printf("\n");
     }
 };

 ExtInt operator +(ExtInt a,int b){
     ExtInt ret();
     ret.len=a.len;
     for(int i=,in=;i<=ret.len||in;i++){
         ret.num[i]=a[i]+b+in;in=ret[i]/mod;
         ret.num[i]%=mod;ret.len=max(ret.len,i);
     }
     return ret;
 }

 ExtInt operator +(ExtInt a,ExtInt b){
     ExtInt ret();
     ret.len=max(a.len,b.len);
     for(int i=,in=;i<=ret.len||in;i++){
         ret.num[i]=a[i]+b[i]+in;in=ret[i]/mod;
         ret.num[i]%=mod;ret.len=max(ret.len,i);
     }
     return ret;
 }

 ExtInt operator *(ExtInt a,ExtInt b){
     ExtInt ret();
     for(int i=;i<=a.len;i++){
         for(int j=,in=;j<=b.len||in;j++){
             ret.num[i+j-]+=a[i]*b[j]+in;in=ret[i+j-]/mod;
             ret.num[i+j-]%=mod;ret.len=max(ret.len,i+j-);
         }
         while(!ret[ret.len])
             ret.num[ret.len--]=;
         ret.len=max(ret.len,);
     }
     return ret;
 }

 ExtInt operator ^(ExtInt a,int k){
     ExtInt ret();
     while(k){
         if(k&)ret=ret*a;
         k>>=;a=a*a;
     }
     return ret;
 }

 ExtInt operator /(ExtInt a,int k){
     for(int i=a.len,tot=;i>=;i--){
         tot=tot*+a[i];
         a.num[i]=tot/k;
         tot%=k;
     }
     while(!a[a.len])
         a.num[a.len--]=;
     return a;
 }

 int GCD(int a,int b){
     return b?GCD(b,a%b):a;
 }

 int main(){
     scanf("%d",&n);
     Linear_Shaker();
     ExtInt ans();
     for(int d=;d<=n;d++)
         if(n%d==){
             ExtInt x();
             ans=ans+(x^d)*phi[n/d];
         }
     ans=ans/n;
     ans.Prf();
     return ;
 }