[HDU 3923] Invoker polya

http://acm.hdu.edu.cn/showproblem.php?pid=3923

题意：有条n长度的项链，m种不同的颜色，问可以组成多少种不同的项链（翻转与旋转后相同的都算是同一条项链）

解法：polya+乘法逆元

polya的原理不太懂，以后有时间看去了。

#include <cmath>
#include <cstdio>
#include <cstring>
#include<iostream>

using namespace std;

typedef long long ll;

ll pow(ll a, ll b, ll mod) //快速幂
{
    ll res = 1;
    while(b){
        if(b & 1)
            res = (res * a) % mod;
        a = (a * a) % mod;
        b = b >> 1;
    }
    return res;
}

ll gcd(ll n, ll m){
    return m ? gcd(m, n%m) : n;
}

void Euild(ll a, ll b, ll &x, ll &y)  //欧几里得扩展求a 关于 b 的逆元
{
    if(0 == b){
        x = 1, y = 0;
        return ;
    }
    Euild(b, a%b, x, y);
    ll flag = x;
    x = y;
    y = flag - a/b * y;
}

ll Polya(int num, int color, ll mod) //长度为 num 环, 颜色有color种
{  
    ll res = 0;
    for(int i = 1; i <= num; i++){
        res = (res + pow(color, gcd(num, i), mod)) % mod;
    }
    if(num & 1){
        res = (res + (num * pow(color, (num+1)/2, mod)) % mod) % mod;
    }
    else{
        res = (res + (pow(color, num/2+1, mod) + pow(color, num/2, mod)) * num/2) % mod;
    }
    ll x, y;
    Euild(num<<1, mod, x, y);
    x = (x % mod + mod) % mod;
    return (res * x) % mod;
}
int main()
{   
    int Test, tt = 1;
    cin>>Test;
    while(Test--){
        int n, m;
        cin>>m>>n;
        cout<<"Case #"<<tt++<<": "<<(n ? Polya(n, m, 1000000007) : 0)<<endl;
    }
    return 0;
}