QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #767153 | #8834. Formal Fring | jiamengtong | AC ✓ | 140ms | 11928kb | C++14 | 1022b | 2024-11-20 19:59:02 | 2024-11-20 19:59:05 |
Judging History
answer
#include<bits/stdc++.h>
#define M 1000005
#define mod 998244353
using namespace std;
int n, f[M], g[M], lg[M];
int hb(int x)
{
return 31 - __builtin_clz(x);
}
signed main()
{
scanf("%d", &n);
f[0] = 1;
for(int i = 0; i <= 20; i++) for(int j = (1 << i); j <= n; j++) f[j] = (f[j] + f[j - (1 << i)]) % mod;
g[0] = 1;
for(int i = 1; i <= n; i++)
{
// cout << "F: " << f[i] << endl;
for(int j = 0; j <= 20; j++) if(i >= (1 << j + 1) && i % (1 << j) == 0) g[i] = (g[i] + 1ll * f[1 << j] * g[i / (1 << j) - 2] % mod) % mod;// cout << j << " " << g[i] << endl;
// cout << g[i] << endl;
}
for(int i = 1; i <= n; i++)
{
int ans = 0;
// cout << hb(i + i % (1 << 0)) << " " << hb(i - i % (1 << 0)) << endl;
for(int j = 0; j <= 20; j++) if((i / (1 << j)) >= 1 && hb(i + (1 << j) - i % (1 << j)) != hb(i - (1 << j) + i % (1 << j))) ans = (ans + 1ll * f[i % (1 << j)] * g[i / (1 << j) - 1] % mod) % mod;// cout << "GANS: " << j << " " << ans << endl;
printf("%d ", ans);
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 8012kb
input:
10
output:
1 1 2 1 1 3 6 1 1 2
result:
ok 10 numbers
Test #2:
score: 0
Accepted
time: 1ms
memory: 7932kb
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: 140ms
memory: 11928kb
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