QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#767613#8834. Formal FringchrhaaAC ✓69ms13296kbC++14611b2024-11-20 21:27:142024-11-20 21:27:17

Judging History

你现在查看的是最新测评结果

  • [2024-11-20 21:27:17]
  • 评测
  • 测评结果:AC
  • 用时:69ms
  • 内存:13296kb
  • [2024-11-20 21:27:14]
  • 提交

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<20;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;
}

详细

Test #1:

score: 100
Accepted
time: 0ms
memory: 3668kb

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: 3660kb

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: 69ms
memory: 13296kb

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