Submission #1806895

---

Source Code Expand

#include <cstdio>
#include <algorithm>
typedef long long ll;
const int N = 2e3 + 5;
const int Mod = 924844033;
int n, K;
int g[N][N][4], w[2][N], fac[N], ans;
int main() {
	scanf("%d%d", &n, &K);
	g[0][0][2] = 1;
	for (int i = 0; i < n; ++i)
		for (int j = 0; j <= i; ++j) 
			for (int opt = 0; opt < 4; ++opt) 
				if (g[i][j][opt]) {
					(g[i + 1][j][(opt & 1) << 1] += g[i][j][opt]) %= Mod;
					(g[i + 1][j + 1][((opt & 1) << 1) | 1] += g[i][j][opt]) %= Mod;
					if (!(opt >> 1)) (g[i + 1][j + 1][(opt & 1) << 1] += g[i][j][opt]) %= Mod;
				}
	
	int x = 0, y = 1; w[0][0] = 1;
	for (int c = 0, pre = 0; c < K; ++c, std :: swap(x, y)) {
		int m = n / K + (c ? c <= (n % K) : 0); pre += m;
		for (int i = 0; i <= pre; ++i) w[y][i] = 0;
		for (int v = 0; v <= m; ++v) {
			int t = (g[m][v][0] + g[m][v][2]) % Mod;
			for (int i = v; i <= pre; ++i)
				(w[y][i] += (ll)w[x][i - v] * t % Mod) %= Mod; 
		}
	}
	
	fac[0] = 1;
	for (int i = 1; i <= n; ++i) fac[i] = (ll)fac[i - 1] * i % Mod;
	
	for (int i = 0; i <= n; ++i) 
		if (i & 1) (ans -= (ll)fac[n - i] * w[x][i] % Mod) %= Mod;
		else (ans += (ll)fac[n - i] * w[x][i] % Mod) %= Mod;
		
	if (ans < 0) ans += Mod;
	printf("%d\n", ans);
	
	return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:9:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &n, &K);
                       ^

Judge Result