Submission #25477186

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include<bits/stdc++.h>
#define int long long
using namespace std;
inline int read() {
  int s=1,a=0;
  char c=getchar();
  while(!isdigit(c)) {
    if(c=='-') s=-s;
    c=getchar();
  }
  while(isdigit(c)) {
    a=(a<<3)+(a<<1)+c-'0';
    c=getchar();
  }
  return s*a;
}
const int N=5e3+8,Mod=924844033;
int n,k,jc[N],f[N][N][2],vis[N],tot;
void init() {
  jc[0]=1;
  for(int i=1; i<=n; i++) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include<bits/stdc++.h>
#define int long long
using namespace std;
inline int read() {
	int s=1,a=0;
	char c=getchar();
	while(!isdigit(c)) {
		if(c=='-') s=-s;
		c=getchar();
	}
	while(isdigit(c)) {
		a=(a<<3)+(a<<1)+c-'0';
		c=getchar();
	}
	return s*a;
}
const int N=5e3+8,Mod=924844033;
int n,k,jc[N],f[N][N][2],vis[N],tot;
void init() {
	jc[0]=1;
	for(int i=1; i<=n; i++) {
		jc[i]=jc[i-1]*i%Mod;
	}
	for(int i=1; i<=k; i++) {
		for(int t=1; t<=2; t++) {
			for(int j=i; j<=n; j+=k) {
				tot++;
				if(j!=i) vis[tot]=1;
			}
		}
	}
}
signed main() {
	n=read(),k=read();
	init();
	f[0][0][0]=1;
	for(int i=1; i<=(n<<1); i++) {
		for(int j=0; j<=n; j++) {
			f[i][j][0]=(f[i-1][j][0]+f[i-1][j][1])%Mod;
			if(vis[i]&&j>0) f[i][j][1]=f[i-1][j-1][0];
		}
	}
	int ans=0;
	for(int i=0; i<=n; i++) {
		if(i&1) ans=(ans-(f[n<<1][i][0]+f[n<<1][i][1])*jc[n-i]%Mod+Mod)%Mod;
		else ans=(ans+(f[n<<1][i][0]+f[n<<1][i][1])*jc[n-i]%Mod)%Mod;
	}
	printf("%lld\n",ans);
	return 0;
}

Submission Info

Judge Result