QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #152397 | #6418. Ah, It's Yesterday Once More | qzez# | WA | 0ms | 3424kb | C++14 | 1.0kb | 2023-08-28 07:26:14 | 2023-08-28 07:26:15 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
template<typename T>
ostream& operator << (ostream &out,const vector<T>&x){
if(x.empty())return out<<"[]";
out<<'['<<x[0];
for(int len=x.size(),i=1;i<len;i++)out<<','<<x[i];
return out<<']';
}
template<typename T>
vector<T> ary(const T *a,int l,int r){
return vector<T>{a+l,a+1+r};
}
template<typename T>
void debug(T x){
cerr<<x<<'\n';
}
template<typename T,typename ...S>
void debug(T x,S ...y){
cerr<<x<<' ',debug(y...);
}
int main(){
puts("\
20 20\n\
10111111111111111111\n\
10100000000000000001\n\
10101111111111111101\n\
10101000000000000101\n\
10101011111111110101\n\
10101010000000010101\n\
10101010111111010101\n\
10101010100001010101\n\
10101010101101010101\n\
10101010100101010101\n\
10101010100101010101\n\
10101010111101010101\n\
10101010000001010101\n\
10101011111111010101\n\
10101000000000010101\n\
10101111111111110101\n\
10100000000000000101\n\
10111111111111111101\n\
10000000000000000001\n\
11111111111111111111\
");
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3424kb
input:
output:
20 20 10111111111111111111 10100000000000000001 10101111111111111101 10101000000000000101 10101011111111110101 10101010000000010101 10101010111111010101 10101010100001010101 10101010101101010101 10101010100101010101 10101010100101010101 10101010111101010101 10101010000001010101 10101011111111010101 ...
result:
wrong answer 72 successful hack.