poj-2888-矩阵+polya

Magic Bracelet

Time Limit: 2000MS		Memory Limit: 131072K
Total Submissions: 6195		Accepted: 1969

Description

Ginny’s birthday is coming soon. Harry Potter is preparing a birthday present for his new girlfriend. The present is a magic bracelet which consists of n magic beads. The are m kinds of different magic beads. Each kind of beads has its unique characteristic. Stringing many beads together a beautiful circular magic bracelet will be made. As Harry Potter’s friend Hermione has pointed out, beads of certain pairs of kinds will interact with each other and explode, Harry Potter must be very careful to make sure that beads of these pairs are not stringed next to each other.

There infinite beads of each kind. How many different bracelets can Harry make if repetitions produced by rotation around the center of the bracelet are neglected? Find the answer taken modulo 9973.

Input

The first line of the input contains the number of test cases.

Each test cases starts with a line containing three integers n (1 ≤ n ≤ 10⁹, gcd(n, 9973) = 1), m (1 ≤ m ≤ 10), k (1 ≤ k ≤ m(m − 1) ⁄ 2). The next k lines each contain two integers a and b (1 ≤ a, b ≤ m), indicating beads of kind a cannot be stringed to beads of kind b.

Output

Output the answer of each test case on a separate line.

Sample Input

4
3 2 0
3 2 1
1 2
3 2 2
1 1
1 2
3 2 3
1 1
1 2
2 2

Sample Output

4
2
1
0

Source

POJ Monthly--2006.07.30, cuiaoxiang

　　用 inv[i]=(mod-mod/i)*inv[mod%i]的时候要保证i<mod才可，我一直WA最后换了种求逆元的方法就好了。

 　　题意是给出n个珠子组成一个环，m种颜色，k种限制，问不同的涂色方法（旋转可达的算同一种），还是找不动点，等价于求

d个珠子组成一个环的所有方案（重复的也算），m很小考虑矩阵，把可达矩阵A建立起来，res=A^（d） 表示选完d+1个珠子后的矩阵，

res[i][j]即第一个珠子是i最后一个珠子是j的方案个数，我们统计所有的res[i][i]就好了，等价于把最后一个珠子看做第一个珠子了。

其实就等价于求从i出发回到i的方案个数，这么说好理解点。

　　

#include<iostream>
#include<cstring>
#include<cstdio>
#include<map>
#include<set>
#include<vector>
#include<algorithm>
#include<cmath> 
using namespace std;
#define LL long long 
#define PI acos(-1.0)
LL mod=9973;
LL N,M,K;
vector<LL>prime;
bool isp[33333];
struct matrix{
    LL a[11][11];
    matrix(){
        memset(a,0,sizeof(a));
    }
    matrix operator*(matrix &tmp){
        matrix ans;
        for(int i=1;i<=M;++i){
            for(int j=1;j<=M;++j){
                for(int k=1;k<=M;++k){
                    (ans.a[i][j]+=a[i][k]*tmp.a[k][j]);
                }
                ans.a[i][j]%=mod;
            }
        }
        return ans;
    }
}A,U;
matrix qpow(matrix A,int b){
    matrix ans=U;
    while(b){
        if(b&1) ans=ans*A;
        A=A*A;
        b>>=1;
    }
    return ans;
}
void init(){
    for(int i=2;i<33333;++i){
        if(!isp[i]) prime.push_back(i);
        for(int j=0;j<prime.size()&&prime[j]*i<33333;++j){
            isp[i*prime[j]]=1;
            if(i%prime[j]==0)break;
        }
    }
}
LL phi(int n){
    LL ans=n,m=sqrt(n+0.5);
    for(int i=0;prime[i]<=m;++i){
        if(n%prime[i]==0){
            ans=ans/prime[i]*(prime[i]-1);
            while(n%prime[i]==0)n/=prime[i];
        }
    }
    if(n>1) ans=ans/n*(n-1);
    return ans%mod;
}
LL _qpow(LL a,LL b){
    LL r=1;
    while(b){
        if(b&1) r=r*a%mod;
        a=a*a%mod;
        b>>=1;
    }
    return r;
}
LL solve(int n){
    matrix res=qpow(A,n);
    LL ans=0;
    for(int i=1;i<=M;++i) ans+=res.a[i][i];
    return ans%mod;
}
int main()
{
    int t,i,j,k,u,v;
    init();
    for(i=0;i<11;++i)U.a[i][i]=1;
    scanf("%d",&t);
    while(t--){
        scanf("%lld%lld%lld",&N,&M,&K);
        for(i=1;i<=M;++i)
        for(j=1;j<=M;++j)A.a[i][j]=1;
        for(i=1;i<=K;++i){
            scanf("%d%d",&u,&v);
            A.a[u][v]=A.a[v][u]=0;
        }
        LL ans=0;
        for(i=1;i*i<=N;++i){
            if(N%i==0){
                ans=(ans+phi(N/i)*solve(i)%mod)%mod;
                if(i*i!=N) ans=(ans+phi(i)*solve(N/i)%mod)%mod;
            }
        }
        ans=ans*_qpow(N,mod-2)%mod;
        printf("%lld\n",ans);
    }
    return 0;
}