Submission #1243222

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef complex<double> point;
#define xx real()
#define yy imag()

#define REP(i, a, b) for(int i = (a); i < (int)(b); i++)
#define REPN(i, a, b) for(int i = (a); i <= (int)(b); i++)
#define FA(it, x) for(__typeof((x).begin()) it = (x).begin(); it != (x).end(); it++)
#define SZ(x) (int)(x).size()
#define BE(x) (x).begin(), (x).end()
#define SORT(x) sort(BE(x))
#define _1 first
#define _2 second

#define x1 gray_cat_x1
#define y1 gray_cat_y1

template<class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }

#define file "cycle"

const double EPS = 1e-9;
const double PI = acos(-1.);
const int INF = 1e9;
const ll MOD = 924844033;

const int MAXN = 2e3 + 5;

ll f[MAXN];

int dp[2 * MAXN][MAXN][2];

int nxt[2 * MAXN], used[MAXN];

void solve(){
	int n, k;
	scanf("%d%d", &n, &k);
	f[0] = 1;
	REPN(i, 1, n){
		f[i] = (f[i - 1] * i) % MOD;
	}
	int top = 0;
	nxt[top++] = 0;
	REPN(i, 1, n){
		if (!used[i]){
			for(int j = i; j <= n; j += k){
				used[j] = 1;
				nxt[top++] = 1;
			}
			nxt[top - 1] = 0;
			for(int j = i; j <= n; j += k){
				nxt[top++] = 1;
			}
			nxt[top - 1] = 0;
		}
	}
	dp[0][0][0] = 1;
	REP(i, 0, 2 * n){
		REP(j, 0, n){
			if (nxt[i]){
				dp[i + 1][j + 1][1] = (dp[i + 1][j + 1][1] + dp[i][j][0]) % MOD;
			}
		}
		REPN(j, 0, n){
			dp[i + 1][j][0] = (dp[i + 1][j][0] + dp[i][j][0]) % MOD;
			dp[i + 1][j][0] = (dp[i + 1][j][0] + dp[i][j][1]) % MOD;
		}
	}
	
	/*REPN(i, 0, 2 * n){
		printf("%d %d\n", i, nxt[i]);
		REPN(j, 0, n){
			printf("%d ", dp[i][j][0] + dp[i][j][1]);
		}
		putchar('\n');
	}*/
	
	ll ans = 0ll;
	REPN(i, 0, n){
		ll add = ((ll)(dp[2 * n][i][0] + dp[2 * n][i][1]) * f[n - i]) % MOD;
		//printf("%d %lld\n", i, add);
		if (i % 2 == 1){
			ans = (ans + MOD - add) % MOD;
		} else {
			ans = (ans + add) % MOD;
		}
	}
	printf("%lld\n", ans);
}	

int main(){

	//freopen(file".in", "r", stdin); freopen(file".out", "w", stdout);
	int t = 1;
	//cin >> t;
	while(t--){
		solve();	
	}
}

Submission Info

Compile Error

./Main.cpp: In function ‘void solve()’:
./Main.cpp:44: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