Polya定理

burnside引理：

在一个置换群上的等价类为：(1 / n) * sigma(一个置换的不动点个数)

对于旋转的问题，暴力统计要枚举每种置换，则循环节长度为(n, i)，可以发现只要枚举n的约数k，统计后乘上phi(n / k)即可。

对于翻折是和奇偶有关, 通常有ans[n] = (1/2) * (f[n] + f[ floor(n + 1 / 2) ])，有时需根据奇偶分类处理。

给一个环黑白染色，要求包含一个给定的01串(l <= 30)，求方案数。n <= 10^9

对于一个循环节，用矩阵乘法优化递推即可，矩阵为从前缀a到后缀b的方案数，当循环节小于l时，暴力统计。

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
#define Rep(i, x, y) for (int i = x; i <= y; i ++)
#define Dwn(i, x, y) for (int i = x; i >= y; i --)
#define RepE(i, x) for(int i = pos[x]; i; i = g[i].nex)
using namespace std;
typedef long long LL;
const int M = 65, N = 100000, mod = 1000000007;
int n, m, mz, n2, nex[M], b[M][2], pr[M], pz, n1; LL ans;
char s[M];
struct Matr
{
	LL a[M][M];
	Matr() { memset(a, 0, sizeof(a)); }
} p[M], q, p0;
LL Phi(int x) {
	LL z = x;
	Rep(i, 1, pz) if (x % pr[i] == 0) z = z * (pr[i] - 1) / pr[i];
	return z;
}
Matr operator *(Matr a, Matr b) {
	Matr c;
	Rep(i, 0, mz)
		Rep(k, 0, mz)
			if (a.a[i][k])
			Rep(j, 0, mz) (c.a[i][j] += a.a[i][k] * b.a[k][j]) %= mod;
	return c;
}
LL Pow(LL x, int y) {
	LL z = 1;
	while (y) {
		if (y & 1) (z *= x) %= mod;
		(x *= x) %= mod, y >>= 1;
	}
	return z;
}
void Matr_pow(int y) {
	int z = 1;
	while (y) {
		if (y & 1) q = q * p[z];
		z ++, y >>= 1;
	}
}
LL Calc(int x) {
	LL sum = 0;
	if (x < m) {
		bool fl = 0;
		Rep(i, 1, x) {
			for (int j = x + i; j <= m; j += x) if (s[i] != s[j]) fl = 1;
		}
		if (fl) return 0;
		sum = 1;
		Rep(i, 1, x) {
			Rep(j, 1, i - 1) {
				fl = 0; Rep(k, 0, x - 1) if (s[ (i+k-1)%x+1 ] != s[ (j+k-1)%x+1 ]) fl = 1;
				if (!fl) break ;
			}
			sum += fl;
		}
		return sum;
	}
	memset(q.a, 0, sizeof(q.a));
	Rep(i, 0, m) q.a[i][i] = 1;
	Matr_pow(x);
	Rep(i, 0, m) (sum += q.a[i][m + i]) %= mod;
	return sum;
}
int main()
{
	scanf ("%d%d%s", &n, &m, s + 1), n1 = n;
	Rep(i, 1, m) s[i + m] = s[i];
	Rep(i, 1, m) {
		int k = nex[i - 1], z = (s[i] == 'R');
		while (k && s[k + 1] != s[i]) k = nex[k];
		if (i > 1) nex[i] = k + (s[k + 1] == s[i]);
		b[i - 1][z] = i, k = b[i - 1][z ^ 1] = b[ nex[i - 1] ][z ^ 1];
		p0.a[i - 1][i] = p0.a[i - 1][k] = p0.a[i + m - 1][i + m] = p0.a[i + m - 1][k + m] = 1;
	}
	p0.a[m - 1][2 * m] = 1, p0.a[m - 1][m] = 0;
	p0.a[2 * m][ m + b[ nex[m] ][0] ] = p0.a[2 * m][ m + b[ nex[m] ][1] ] = 1;
	mz = 2 * m;
	p[1] = p0;
	Rep(i, 2, 32) p[i] = p[i - 1] * p[i - 1];
	for (int i = 2; i * i <= n1; i ++) {
		if (n1 % i == 0) pr[++ pz] = i;
		while (n1 % i == 0) n1 /= i;
	}
	if (n1 > 1) pr[++ pz] = n1;
	for (int i = 1; i * i <= n; i ++) {
		if (n % i == 0) {
			(ans += Calc(i) * Phi(n / i)) %= mod;
			if (i * i != n) (ans += Calc(n / i) * Phi(i)) %= mod;
		}
	}
	printf("%I64d\n", ans * Pow(n, mod - 2) % mod);
	
	return 0;
}