QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#610791 | #6418. Ah, It's Yesterday Once More | gates_orz | WA | 0ms | 3528kb | C++20 | 1.2kb | 2024-10-04 17:25:51 | 2024-10-04 17:25:52 |
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]= "00000000000000000000";
s[2]= "11110111111111110111";
s[3]= "00000000000000000000";
s[4]= "11111111111111110111";
s[5]= "00000000000000000000";
s[6]= "11111011111111111111";
s[7]= "00000000000000000000";
s[8]= "10111111111111111111";
s[9]= "00000000000000000000";
s[10]="10111101111011101110";
s[11]="00000000000000000000";
s[12]="01111111111111111111";
s[13]="00000000000000000000";
s[14]="11101111111111111111";
s[15]="00000000000000000000";
s[16]="11111111111111011111";
s[17]="00000000000000000000";
s[18]="11111111111111111101";
s[19]="00000000000000000000";
s[20]="01010111010110101111";
cout<<n<<" "<<m<<"\n";
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
*/
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3528kb
input:
output:
20 20 00000000000000000000 11110111111111110111 00000000000000000000 11111111111111110111 00000000000000000000 11111011111111111111 00000000000000000000 10111111111111111111 00000000000000000000 10111101111011101110 00000000000000000000 01111111111111111111 00000000000000000000 11101111111111111111 ...
result:
wrong answer Not connected.