poj3150细胞自动机(循环矩阵降维)

#include<bits/stdc++.h>
#include<chrono>
#include<random>
#define f(i,a,b) for(register int i=a;i<=b;++i)
#define ff(i,a,b) for(register int i=a;i>=b;--i)
#define debug(x) cerr << #x << " : " << x << " " << endl
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<string, string> pss;
const ll mod = 1e9 + 7;
const ll mod2 = 998244353;
const int inf = 0x3f3f3f3f;
const double tiaohe = 0.57721566490153286060651209;
ll oula(ll x) { ll res = x;f(i, 2, x / i) { if (x % i == 0) { res = res / i * (i - 1);while (x % i == 0) x /= i; } }if (x > 1) res = res / x * (x - 1);return res; }
ll quickmod(ll a, ll n, ll m) { ll s = 1;while (n) { if (n & 1) { s = s * a % m; }a = (a*a) % m;n = n / 2; }return s; }
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
void ex_gcd(ll a, ll b, ll &x, ll &y, ll &d) { if (!b) { d = a, x = 1, y = 0; } else { ex_gcd(b, a % b, y, x, d);y -= x * (a / b); } }
ll inv(ll t, ll p) { ll d, x, y;ex_gcd(t, p, x, y, d);return d == 1 ? (x % p + p) % p : -1; }
bool isPrime(ll x) { if (x == 2)return true;if (x % 2 == 0)return false;for (ll i = 2;i*i <= x;i++) if (x % i == 0)return false; return true; }
inline int in() { char ch = getchar();int x = 0, f = 1;while (ch<'0' || ch>'9') { if (ch == '-')f = -1;ch = getchar(); }while (ch >= '0'&&ch <= '9') { x = x * 10 + ch - '0';ch = getchar(); }return x * f; }
//double a = log(n) +tiaohe + 1.0 / (2 * n);
double eqa = (1 + sqrt(5.0)) / 2.0;
const double eps = 1e-8;
const int N =505;

ll n, m,d,k;
void mul(ll c[], ll a[], ll b[])//循环矩阵的乘积还是循环矩阵，可以降成一维
{
	ll tmp[N] = { 0 };
	f(i, 0,n-1)
		f(j, 0, n - 1)
		tmp[j] = (tmp[j] + a[i] * b[(j-i+n)% n]) % m;
	memcpy(c, tmp, sizeof tmp);
}
void jzksm(ll a[])
{
	ll tmp[N]= { 0 };
	f(i, 0, 0)tmp[i]= 1;
	while (k)
	{
		if (k & 1)mul(tmp, tmp, a);
		mul(a, a, a);
		k >>= 1;
	}
	memcpy(a, tmp, sizeof tmp);
}
int main()
{
	//freopen("in.txt", "r", stdin);
	while (cin >> n >> m >> d >> k)
	{
		ll a[N] = { 0 };
		f(i, 0, n - 1)a[i] = in();
		ll f[N] = { 0 };
		f[0] = 1;
		f(i, 1, d)f[i] = 1;
		ff(i, n - 1, n - 1 - d + 1)f[i] = 1;
		jzksm(f);
		mul(a, a, f);
		f(i, 0,n-1)
		{
			printf("%d", a[i]);
			if (i == n - 1)printf("\n");
			else printf(" ");
		}
	}
	return 0;
}