Submission #1865319

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <queue>
#include <vector>
#include <bitset>
#include <string>
#include <cmath>
#include <set>
#include <map>
#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)
#define ev g[i].y
#define eps 1e-10
using namespace std;
typedef long long ll;
typedef double db;
const int N = 2005, mod = 924844033;
int n, m;
ll fac[N], f[N][N][2][2], ans, res;
int main()
{
	scanf ("%d%d", &n, &m);
	fac[0] = 1;
	Rep(i, 1, n) fac[i] = fac[i - 1] * i % mod;
	int i = 1;
	f[0][0][0][0] = 1;
	Rep(r, 1, n) {
		bool f1, f2;
		if (r > 1) {
			if (i + m > n) i = i % m + 1, f1 = 0;
			else i = i + m, f1 = 1;
		} else f1 = 0;
		// cout << i<<endl;
		f2 = (i + m <= n);
		Rep(j, 0, r) Rep(p1, 0, 1) Rep(p2, 0, 1) {
			Rep(q1, 0, f1) Rep(q2, 0, f2) if (!(p1 & q1) && !(q1 & q2)) {
				(f[r][j + (q1 | q2)][p2][q2] += f[r - 1][j][p1][p2]) %= mod;
			}
		}
	}
	int k = 1;
	Rep(i, 0, n) {
		res = 0;
		Rep(p1, 0, 1) Rep(p2, 0, 1) (res += f[n][i][p1][p2]) %= mod;
		(ans += res * fac[n - i] * k) %= mod;
		k *= -1;
	}
	printf("%lld\n", (ans + mod) % mod);

	return 0;
}

Submission Info

Compile Error

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

Judge Result