QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#462392 | #8834. Formal Fring | Afterlife | AC ✓ | 66ms | 7796kb | C++17 | 805b | 2024-07-03 18:44:24 | 2024-07-03 18:44:24 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
const int N=1e6+1e3+7,P=998244353;
int f[N],g[N];
int n;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cin>>n;
f[0]=1;
for(int i=1;i<=n;i*=2)
for(int j=i;j<=n;j++)
f[j]=(f[j]+f[j-i])%P;
for(int i=1;i<=__lg(n);i++)
{
int w=(1<<i)-1;
g[i]=f[w];
for(int j=1;j<i;j++)
g[i]=(g[i]-1ll*f[(1<<j)-1]*g[i-j])%P;//break at j
g[i]=(g[i]+P)%P;
}
for(int i=1;i<=n;i++)
{
int c=0,ans=0,x=i;
for(int j=__lg(i);j>=0;j--)
{
if(!(i>>j&1))
break;
c++;
x-=1<<j;
ans=(ans+1ll*g[c]*f[x])%P;
}
cout<<ans<<" \n"[i==n];
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 5780kb
input:
10
output:
1 1 2 1 1 3 6 1 1 2
result:
ok 10 numbers
Test #2:
score: 0
Accepted
time: 0ms
memory: 5720kb
input:
70
output:
1 1 2 1 1 3 6 1 1 2 2 5 5 11 26 1 1 2 2 4 4 6 6 11 11 16 16 27 27 53 166 1 1 2 2 4 4 6 6 10 10 14 14 20 20 26 26 37 37 48 48 64 64 80 80 107 107 134 134 187 187 353 1626 1 1 2 2 4 4 6
result:
ok 70 numbers
Test #3:
score: 0
Accepted
time: 66ms
memory: 7796kb
input:
1000000
output:
1 1 2 1 1 3 6 1 1 2 2 5 5 11 26 1 1 2 2 4 4 6 6 11 11 16 16 27 27 53 166 1 1 2 2 4 4 6 6 10 10 14 14 20 20 26 26 37 37 48 48 64 64 80 80 107 107 134 134 187 187 353 1626 1 1 2 2 4 4 6 6 10 10 14 14 20 20 26 26 36 36 46 46 60 60 74 74 94 94 114 114 140 140 166 166 203 203 240 240 288 288 336 336 400 ...
result:
ok 1000000 numbers
Extra Test:
score: 0
Extra Test Passed