#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<queue>
//#define int long long
#define maxn 300005
using namespace std;
typedef long long ll;
const int mod = 1004535809, mx = 3e5;
int read() {
int x = 0, f = 1, ch = getchar();
while(!isdigit(ch)) {if(ch == '-') f = -1; ch = getchar();}
while(isdigit(ch)) x = (x << 1) + (x << 3) + ch - '0', ch = getchar();
return x * f;
}
ll pw(ll a, ll b) {ll res = 1; while(b) {if(b & 1) res = res * a % mod; a = a * a % mod; b >>= 1;} return res;}
int r[maxn], len, l;
void NTT(ll *c, int flag) {
for(int i = 1; i <= len; i++) if(i < r[i]) swap(c[i], c[r[i]]);
for(int mid = 1; mid < len; mid <<= 1) {
ll gn = pw(3, (mod - 1) / (mid << 1));
if(flag == -1) gn = pw(gn, mod - 2);
for(int ls = 0, L = mid << 1; ls < len; ls += L) {
ll g = 1;
for(int k = 0; k < mid; k++, g = g * gn % mod) {
ll x = c[ls + k], y = g * c[ls + mid + k] % mod;
c[ls + k] = (x + y) % mod, c[ls + mid + k] = (x - y + mod) % mod;
}
}
}
ll rev = pw(len, mod - 2);
if(flag == -1) for(int i = 0; i <= len; i++) c[i] = c[i] * rev % mod;
}
ll f[maxn], g[maxn], fac[maxn], inv[maxn], tmp[maxn], tmpb[maxn];
void get_inv(ll *a, ll *b, int n) {//多项式求逆元,有不同的板子,差别细微但致命
if(n == 1) {b[0] = pw(a[0], mod - 2); return;}
get_inv(a, b, (n + 1) >> 1);
len = 1, l = 0;
while(len <= n + n) len <<= 1, l++;
for(int i = 1; i <= len; i++) r[i] = (r[i >> 1] >> 1) | ((i & 1) << l - 1);
for(int i = 0; i < n; i++) tmp[i] = a[i];
for(int i = n; i <= len; i++) tmp[i] = 0;
NTT(tmp, 1), NTT(b, 1);
for(int i = 0; i <= len; i++) b[i] = b[i] * (1ll * 2 - tmp[i] * b[i] % mod + mod) % mod;
NTT(b, -1); for(int i = n; i <= len; i++) b[i] = 0;
}
int n;
signed main() {
n = read();
fac[0] = inv[0] = 1;
for(int i = 1; i <= mx; i++) fac[i] = fac[i - 1] * i % mod;
inv[mx] = pw(fac[mx], mod - 2);
for(int i = mx - 1; i > 0; i--) inv[i] = inv[i + 1] * (i + 1) % mod;
f[0] = 1;//一定要处理这里
for(int i = 1; i <= n; i++) f[i] = pw(2, 1ll * i * (i - 1) / 2 % (mod - 1)) * inv[i] % mod;
get_inv(f, g, n + 1);
for(int i = 1; i <= n; i++) f[i] = f[i] * i % mod; f[0] = 0;
len = 1, l = 0;
while(len <= n + n) len <<= 1, l++;
for(int i = 1; i <= len; i++) r[i] = (r[i >> 1] >> 1) | ((i & 1) << l - 1);
NTT(f, 1), NTT(g, 1);
for(int i = 0; i <= len; i++) f[i] = f[i] * g[i] % mod;
NTT(f, -1);
printf("%lld\n", f[n] * fac[n - 1] % mod);//从F到f
return 0;
}
[集训队作业2013]城市规划
最新推荐文章于 2024-04-27 00:31:58 发布