QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#610861 | #6418. Ah, It's Yesterday Once More | gates_orz | WA | 0ms | 3552kb | C++20 | 1.4kb | 2024-10-04 17:48:37 | 2024-10-04 17:48:37 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
//int n,m,k;
int n,m;
const int N=1e6+10,M=5e3,mod=998244353;
int sa[N];
void solve() {
n=20,m=20;
vector<string>s(21);
s[1]= "11111111111111111111";
s[2]= "00000001000000000000";
s[3]= "11111111111111111111";
s[4]= "10000000000000000000";
s[5]= "11111111111111111111";
s[6]= "00000000000000000001";
s[7]= "11111111111111111111";
s[8]= "10000000000000000000";
s[9]= "11111111111111111111";
s[10]="00000000000000000001";
s[11]="11111111111111111111";
s[12]="10000000000000000000";
s[13]="11111111111111111111";
s[14]="00000000000000000001";
s[15]="11111111111111111111";
s[16]="10000000000000000000";
s[17]="11111111111111111111";
s[18]="00000000000000000001";
s[19]="11111111111111111111";
s[20]="10000000010000000001";
cout<<n<<" "<<m<<"\n";
/*for(int i=1;i<=n;i++) {
for(int j=0;j<m;j++) {
if(s[i][j]=='1')s[i][j]='0';
else s[i][j]='1';
}
}*/
for(int i=1;i<=n;i++) {
cout<<s[i]<<"\n";
}
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int T=1;
//cin>>T;
while(T--)solve();
return 0;
}
/*
1
6 8
1 2 5 3 4 7
2 4 1 4 3 4 2 5
1
12323 34534534534 45
*/
详细
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3552kb
input:
output:
20 20 11111111111111111111 00000001000000000000 11111111111111111111 10000000000000000000 11111111111111111111 00000000000000000001 11111111111111111111 10000000000000000000 11111111111111111111 00000000000000000001 11111111111111111111 10000000000000000000 11111111111111111111 00000000000000000001 ...
result:
wrong answer 96 successful hack.