QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #644976 | #6418. Ah, It's Yesterday Once More | rush-from-behind# | WA | 0ms | 3820kb | C++17 | 1.4kb | 2024-10-16 16:17:21 | 2024-10-16 16:17:23 |
Judging History
answer
// sis puella oier
#include <bits/stdc++.h>
using namespace std;
// #define int long long
typedef long long ll;
ll read(){
ll xx = 0, f = 1; char ch = getchar();
for (;!isdigit(ch); ch = getchar())
f = (ch == '-' ? -1 : 1);
for (; isdigit(ch); ch = getchar())
xx = (xx << 3) + (xx << 1) + ch - '0';
return xx * f;
}
int get(int l, int r){
return l + abs(rand() * rand()) % (r - l + 1);
}
int n = 20;
signed main(){
// freopen("a.out", "w", stdout);
srand(time(0));
printf("20 20\n");
printf("01011000101100010110\n");
printf("11110111111010111101\n");
printf("01010100101010010101\n");
printf("01011100101110010111\n");
printf("11100101110011111001\n");
printf("10101101010110101011\n");
printf("00000000000000000010\n");
printf("01011000101100010110\n");
printf("11110111111010111101\n");
printf("01010100101010010101\n");
printf("01011100101110010111\n");
printf("11100101110011111001\n");
printf("10101101010110101011\n");
printf("00001000000000000000\n");
printf("01011000101100010110\n");
printf("11110111111010111101\n");
printf("01010100101010010101\n");
printf("01011100101110010111\n");
printf("11100101110011111001\n");
printf("10101101010110101011\n");
// printf("011010 0 000000 0 000000\n");
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3820kb
input:
output:
20 20 01011000101100010110 11110111111010111101 01010100101010010101 01011100101110010111 11100101110011111001 10101101010110101011 00000000000000000010 01011000101100010110 11110111111010111101 01010100101010010101 01011100101110010111 11100101110011111001 10101101010110101011 00001000000000000000 ...
result:
wrong answer 1 successful hack.