QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#374501#5275. Joking?zhouhuanyiWA 1ms3728kbC++141.8kb2024-04-02 14:47:052024-04-02 14:47:28

Judging History

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

  • [2024-04-02 14:47:28]
  • 评测
  • 测评结果:WA
  • 用时:1ms
  • 内存:3728kb
  • [2024-04-02 14:47:05]
  • 提交

answer

#include<iostream>
#include<cstdio>
#include<algorithm>
#define N 600
using namespace std;
int read()
{
	char c=0;
	int sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
int n,delta[N+1]={2,3,5,1,4,4,1,5,2,3,3,5,1,4,2,1,2,3,5,4,5,4,1,3,2,1,2,3,4,5,5,2,3,1,4,5,1,3,2,4,4,5,2,1,3,3,4,1,2,5,3,2,4,1,5,1,4,5,2,3,2,4,3,1,5,4,1,3,2,5,3,2,5,4,1,4,1,3,5,2,5,2,3,4,1,4,1,5,3,2,3,4,2,1,5,3,4,5,2,1,2,5,3,1,4,3,1,5,4,2,5,2,4,1,3,5,2,1,3,4,4,2,3,5,1,4,5,1,3,2,2,4,5,1,3,2,5,1,4,3,5,3,1,2,4,2,3,1,4,5,1,4,3,2,5,1,5,4,3,2,4,3,2,5,1,1,2,4,5,3,5,3,4,2,1,4,3,2,1,5,1,4,2,5,3,1,2,5,4,3,4,3,5,2,1,5,4,3,2,1,3,1,4,2,5,5,1,4,2,3,5,1,3,4,2,3,1,2,5,4,2,1,5,4,3,1,5,3,2,4,2,3,1,5,4,1,5,4,2,3,2,4,1,5,3,1,5,2,3,4,3,2,4,5,1,5,3,1,4,2,1,3,2,4,5,2,4,3,5,1,3,2,1,5,4,5,4,2,1,3,4,3,1,5,2,4,3,5,1,2,2,3,5,4,1,2,1,4,5,3,3,5,2,1,4,5,1,2,3,4,2,3,4,1,5,4,2,5,3,1,1,4,2,3,5,1,3,5,2,4,3,5,4,2,1,4,2,3,1,5,5,2,4,3,1,5,1,2,4,3,5,4,2,3,1,1,5,3,4,2,1,3,4,2,5,4,1,2,3,5,4,3,1,2,5,5,3,4,1,2,3,1,5,2,4,3,4,1,5,2,1,3,4,5,2,4,5,1,2,3,5,3,2,4,1,1,3,2,5,4,4,5,3,2,1,2,1,4,3,5,2,1,3,5,4,5,2,1,4,3,3,5,2,4,1,4,2,1,5,3,4,5,2,3,1,2,3,4,5,1,4,1,2,5,3,4,2,5,1,3,3,5,1,2,4,2,4,1,3,5,1,3,5,4,2,2,5,1,3,4,3,2,5,1,4,2,1,3,4,5,1,5,2,4,3,3,4,5,1,2,1,2,4,3,5,2,5,3,4,1,1,4,5,3,2,2,4,5,3,1,5,1,4,3,2,5,4,3,1,2,3,4,2,5,1,1,4,3,5,2,5,3,2,1,4,5,4,1,2,3,3,1,4,5,2,2,5,4,3,1,4,5,3,1,2,3,2,1,4,5,1,2,5,3,4,3,5,4,1,2,2,1,5,3,4,3,1,2,4,5,2,5,4,1,3,4,2,1,3,5},num[N+1];
bool used[N+1];
int main()
{
	n=read();
	for (int i=1;i<=n;++i)
		for (int j=1;j<=N;++j)
			if (delta[j]==i)
				used[j]=1;
	for (int i=1;i<=N;++i) num[i]=num[i-1]+used[i];
	puts("120");
	for (int i=1;i<=n;++i)
	{
		for (int j=1;j<=N;++j)
			if (delta[j]==i)
				printf("%d ",num[j]);
		puts("");
	}
	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 0
Wrong Answer
time: 1ms
memory: 3728kb

input:

2

output:

120
1 2 4 6 8 10 13 14 17 18 21 22 25 26 29 30 33 34 37 39 41 42 45 47 49 50 53 55 56 59 60 62 65 66 69 71 72 74 77 79 80 82 84 86 89 90 93 94 97 98 101 102 104 107 109 111 112 114 117 119 121 122 125 127 128 130 133 135 137 138 141 142 144 146 148 150 152 154 156 158 161 162 165 167 169 171 173 175...

result:

wrong output format Unexpected end of file - int32 expected