Submission #1476002

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
#define fi first
#define se second
template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typename A, typename B> inline bool chmin(A &a, B b) { if (a>b) { a=b; return 1; } return 0; }
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, pii> pip;
typedef pair<pll, pll> P;
const ll INF = 1ll<<29;
const ll MOD = 1000000007;
const double EPS = 1e-9;
const bool debug = 0;
//---------------------------------//

ll dp[2][2001][2];
ll fact[2001];
bool cf[2001];
ll mod = 924844033;

int main() {
	int n, k; cin >> n >> k;
	
	int cp = 1;
	REP(j, 2) {
		REP(i, k) {
			int now = i;
			cf[cp++] = false;
			now += k;
			
			while (now < n) {
				cf[cp++] = true;
				now += k;
			}
		}
	}
	
	dp[0][0][0] = 1;
	FOR(i, 1, 2 * n + 1) {
		int now = i & 1;
		int bef = !now;
		
		memset(dp[now], 0, sizeof(dp[now]));
		REP(j, n + 1) {
			if (cf[i]) {
				dp[now][j][0] += dp[bef][j][0] + dp[bef][j][1];
				if (j > 0) dp[now][j][1] += dp[bef][j - 1][0];
			}
			else {
				dp[now][j][0] += dp[bef][j][0] + dp[bef][j][1];
			}
			dp[now][j][0] %= mod; dp[now][j][1] %= mod;
		}
	}
	
	fact[0] = 1;
	FOR(i, 1, n + 1) fact[i] = fact[i - 1] * i % mod;
	
	ll ans = 0;
	REP(i, n + 1) {
		ll now = (dp[0][i][0] + dp[0][i][1]) % mod;
		now = now * fact[n - i] % mod;		
		ans += now * (i & 1 ? -1 : 1);
		ans = (ans + mod) % mod;
	}
	
	cout << ans << endl;
	
	return 0;
}

Submission Info

Judge Result