QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#767606 | #8834. Formal Fring | chrhaa | RE | 0ms | 0kb | C++14 | 611b | 2024-11-20 21:25:23 | 2024-11-20 21:25:29 |
answer
#define _CRT_SECURE_NO_WARNINGS 1
#include<stdio.h>
const int N=1000005;
#define ll long long
const ll P=998244353;
int n,h[N];
ll ans,f[N],g[66];
signed main(){
int i,j,k;
scanf("%d",&n);
f[0]=1;
for(i=1,k=0;i<=n;i<<=1,k++)
for(j=i;j<=n;j++){
h[j]=k;
f[j]=(f[j]+f[j-i])%P;
}
for(i=1;i<22;i++){
g[i]=f[(1<<i)-1];
for(j=1;j<i;j++) g[i]=(g[i]+(P-g[j])*f[(1<<i-j)-1])%P;
}
for(i=1;i<=n;i++){
ans=0;
for(j=h[i];j>=0;j--) if(i>>j&1)
ans=(ans+g[h[i]-j+1]*f[i&((1<<j)-1)])%P;
else break;
printf("%lld ",ans);
}
puts("");
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Runtime Error
input:
10