polya

 17青岛现场赛polya计数

转自https://www.cnblogs.com/Just--Do--It/p/7806923.html

#include <bits/stdc++.h>
using namespace std;
#define LL long long
#define LLL __int128
const int maxn = 1010;
int tr[4][30] = {
    {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29},
    {6, 3, 0, 7, 4, 1, 8, 5, 2, 15, 12, 9, 16, 13, 10, 17, 14, 11, 27, 28, 29, 18, 19, 20, 21, 22, 23, 24, 25, 26},
    {15, 16, 17, 12, 13, 14, 9, 10, 11, 6, 7, 8, 3, 4, 5, 0, 1, 2, 26, 25, 24, 23, 22, 21, 20, 19, 18, 29, 28, 27},
    {0, 1, 17, 3, 4, 14, 6, 7, 11, 9, 10, 8, 12, 13, 5, 15, 16, 2, 18, 19, 24, 23, 22, 21, 20, 25, 26, 27, 28, 29}
};
int temp[30];
int ans[maxn * 100][30];
int cnt;
int vis[30];
int C[maxn];
void dfs(int cur){
    for(int k = 1; k <= 3; k++){
        for(int i = 0; i < 30; i++){
            temp[i] = ans[cur][tr[k][i]];
        }
        int flag = 1;
        for(int i = 0; i <= cnt; i++){
            int vis = 1;
            for(int j = 0; j < 30; j++){
                if(ans[i][j] != temp[j]) vis = 0;
                if(!vis) break;
            }
            if(vis){
                flag = 0;
                break;
            }
        }
        if(flag){
            cnt++;
            for(int i = 0; i < 30; i++){
                ans[cnt][i] = temp[i];
            }
            dfs(cnt);
        }
    }
}
void init(){
    cnt = 0;
    for(int i = 0; i < 30; i++) ans[0][i] = tr[0][i];
    dfs(0);
    for(int i = 0; i <= cnt; i++){
        int cir = 0;
        memset(vis, 0, sizeof(vis));
        for(int j = 0; j < 30; j++){
            if(!vis[j]){
                vis[j] = 1;
                int u = ans[i][j];
                while(!vis[u]){
                    vis[u] = 1;
                    u = ans[i][u];
                }
                cir++;
            }
        }
        C[cir]++;
    }
    //cout<<cnt + 1<<endl;
    //for(int i = 0; i < 32; i++) if(C[i]) printf("C[%d] = %d
", i, C[i]);
}
LLL quickpow(LLL a, LLL b, LLL mod){
    LLL temp = a % mod, res = 1;
    while(b){
        if(b & 1) res = res * temp % mod;
        b >>= 1;
        temp = temp * temp % mod;
    }
    return res;
}
int main(){
    init();
    LL c, p;
    int t;
    scanf("%d", &t);
    while(t--){
        scanf("%lld %lld", &c, &p);
        LLL tot = cnt + 1;
        LLL sum = 0;
        LLL mod = p * tot;
        for(int i = 0; i < 32; i++){
            if(C[i]){
                sum = sum + quickpow(c, i, mod) * C[i] % mod;
                sum %= mod;
            }
        }
        printf("%lld
", (LL)(sum / tot));
    }
}

DIY Cube

 HDU - 3547  

#include <bits/stdc++.h>
using namespace std;
#define LL long long
const int maxn = 1010;
int tr[4][8] = {
    {0, 1, 2, 3, 4, 5, 6, 7},
    {4, 5, 0, 1, 6, 7, 2, 3},
    {2, 0, 3, 1, 6, 4, 7, 5},
    {1, 5, 3, 7, 0, 4, 2, 6}
};
int temp[10];
int ans[maxn * 100][10];
int cnt;
int vis[10];
int C[maxn];
void dfs(int cur){
    for(int k = 1; k <= 3; k++){
        for(int i = 0; i < 8; i++){
            temp[i] = ans[cur][tr[k][i]];
        }
        int flag = 1;
        for(int i = 0; i <= cnt; i++){
            int vis = 1;
            for(int j = 0; j < 8; j++){
                if(ans[i][j] != temp[j]) vis = 0;
                if(!vis) break;
            }
            if(vis){
                flag = 0;
                break;
            }
        }
        if(flag){
            cnt++;
            for(int i = 0; i < 8; i++){
                ans[cnt][i] = temp[i];
            }
            dfs(cnt);
        }
    }
}
int main(){
    cnt = 0;
    for(int i = 0; i < 8; i++) ans[0][i] = tr[0][i];
    dfs(0);
    for(int i = 0; i <= cnt; i++){
        int cir = 0;
        memset(vis, 0, sizeof(vis));
        for(int j = 0; j < 8; j++){
            if(!vis[j]){
                vis[j] = 1;
                int u = ans[i][j];
                while(!vis[u]){
                    vis[u] = 1;
                    u = ans[i][u];
                }
                cir++;
            }
        }
        C[cir]++;
    }
    for(int i = 0; i < 10; i++) if(C[i]) printf("C[%d] = %d
", i, C[i]);
    cout<<cnt + 1<<endl;
}

/*************************************************************************
    > File Name: Main.java
    > Author: yijiull
    > Mail: 1147161372@qq.com 
    > Created Time: 2017年11月08日 星期三 22时35分25秒
 ************************************************************************/
import java.math.*;
import java.util.*;
import java.io.*;
public class Main{
    public static void main(String argsp[]){
        Scanner cin = new Scanner(System.in);
        int t = cin.nextInt();
        BigInteger m = new BigInteger("1000000000000000");
        for(int k = 1; k <= t; k++){
            BigInteger c = cin.nextBigInteger();
            BigInteger ans = BigInteger.ZERO;
            ans = ans.add(c.pow(2).multiply(BigInteger.valueOf(6)));
            ans = ans.add(c.pow(4).multiply(BigInteger.valueOf(17)));
            ans = ans.add(c.pow(8));
            ans = ans.divide(BigInteger.valueOf(24));
            System.out.print("Case " + k + ": ");
            if(ans.compareTo(m) > 0){
                ans = ans.mod(m);
                for(int i = ans.toString().length(); i < 15; i++){
                    System.out.print(0);
                }
            }
            System.out.println(ans);

        }
    }
}