QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#426468 | #6320. Parallel Processing (Hard) | Kevin5307 | WA | 0ms | 3608kb | C++23 | 736b | 2024-05-31 12:27:09 | 2024-05-31 12:27:10 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
int main()
{
int id,n;
cin>>id>>n;
int s=(int)(ceil(0.4*(n-1)));
cout<<s<<endl;
vector<array<int,3>> vec;
auto print=[&](int a,int b,int c)
{
vec.push_back({c,a,b});
};
for(int i=1;i<n;i+=10)
{
print(i,i+1,i+1);
print(i+2,i+3,i+3);
print(i+4,i+5,i+5);
print(i+7,i+8,i+8);
print(i+1,i+2,i+2);
print(i+1,i+3,i+3);
print(i+5,i+6,i+6);
print(i+8,i+9,i+9);
print(i+3,i+4,i+4);
print(i+3,i+5,i+5);
print(i+3,i+6,i+6);
print(i+9,i+10,i+10);
print(i+6,i+7,i+7);
print(i+6,i+8,i+8);
print(i+6,i+9,i+9);
print(i+6,i+10,i+10);
}
for(int i=0;i<s*4;i++)
cout<<vec[i][0]<<" "<<vec[i][1]<<" "<<vec[i][2]<<endl;
return 0;
}
详细
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3608kb
input:
17
output:
0
result:
wrong answer A[2] is not (1, …, 2)