Submission #2105585

---

Source Code Expand

#include <cstdio>
#include <cstring>

using namespace std;

const int Max_N(2050);
const int MOD(924844033);
typedef long long int LL;

inline int Mult(const int &a, const int &b)
{
	return static_cast<int>(static_cast<LL>(a) * static_cast<LL>(b) % static_cast<LL>(MOD));
}

inline void update(int &a, const int &b)
{
	((a += b) >= MOD) ? (a -= MOD) : 0;
}

int N, K, Ans[Max_N], ANS, Fac[Max_N];
int M, V[Max_N], F[Max_N][Max_N][2][2];

//考虑容斥
//强制选一些点不合法
//在mod K意义下dp
//F[i][j][a][b]表示dp到第i个数，选了j个不合法，V[i]是否可用，V[i + 1]是否可用 

int main()
{
	scanf("%d%d", &N, &K);
	Fac[0] = 1;
	for (int i = 1;i <= N;++i)
		Fac[i] = Mult(Fac[i - 1], i);
	Ans[0] = 1;
	for (int m = 1;m <= K;++m)
	{
		M = 0;
		for (int i = m;i <= N;i += K)
			V[++M] = i;
		memset(F[1], 0, sizeof(F[1]));
		if (M == 1)
			F[1][0][1][0] = 1;
		else
		{
			F[1][0][1][1] = 1;
			F[1][1][1][0] = 1;
			for (int i = 2;i <= M;++i)
			{
				memset(F[i], 0, sizeof(F[i]));
				for (int j = 0;j <= i - 1;++j)
					for (int a = 0;a <= 1;++a)
						for (int b = 0;b <= 1;++b)
						{
							update(F[i][j][b][(i + 1) <= M], F[i - 1][j][a][b]);
							if (a)
								update(F[i][j + 1][b][(i + 1) <= M], F[i - 1][j][a][b]);
							if (i + 1 <= M)
								update(F[i][j + 1][b][0], F[i - 1][j][a][b]);
						}
			}
		}
		for (int j = N;j >= 0;--j)
			for (int k = 1;k <= M && k <= j;++k)
			{
				int Ret(0);
				for (int a = 0;a <= 1;++a)
					update(Ret, F[M][k][a][0]);
				update(Ans[j], Mult(Ans[j - k], Ret));
			}
	}
	for (int i = 0;i <= N;++i)
	{
		Ans[i] = Mult(Ans[i], Fac[N - i]);
		if (i & 1)
			update(ANS, (-Ans[i] % MOD + MOD) % MOD);
		else
			update(ANS, Ans[i]);
	}
	printf("%d", ANS);
	return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:31: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