QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #645247 | #6418. Ah, It's Yesterday Once More | rush-from-behind# | AC ✓ | 0ms | 3836kb | C++17 | 3.0kb | 2024-10-16 17:22:39 | 2024-10-16 17:23:01 |
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("11111000111110111110\n");
printf("10001111001011001011\n");
printf("11110001101101101101\n");
printf("00011110110110110110\n");
printf("11100011011011011011\n");
printf("10111101101101101101\n");
printf("10000110110110110111\n");
printf("11111011011011011001\n");
printf("00001101101101101101\n");
printf("11110110110110110110\n");
printf("10011011011011011010\n");
printf("11101101101101101011\n");
printf("10110110110110101101\n");
printf("00011011011010110101\n");
printf("11101101101011010111\n");
printf("10110110101101011001\n");
printf("11011010110101101101\n");
printf("01101011010110100101\n");
printf("00101101011010101101\n");
printf("11100111101110111011\n");
return 0;
printf("11101111101111101111\n");
printf("00101010000010101000\n");
printf("11111011101110111111\n");
printf("10100000101000001010\n");
printf("10111011111110111011\n");
printf("00001010000010100000\n");
printf("00000000000000100000\n");
printf("11101111101111101111\n");
printf("00101010000010101000\n");
printf("11111011101110111111\n");
printf("10100000101000001010\n");
printf("10111011111110111011\n");
printf("00001010000010100000\n");
printf("00001000000000000000\n");
printf("11101111101111101111\n");
printf("00101010000010101000\n");
printf("11111011101110111111\n");
printf("10100000101000001010\n");
printf("10111011111110111011\n");
printf("00001010000010100000\n");
return 0;
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("00000000000000000000\n");
// printf("011010 0 000000 0 000000\n");
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3836kb
input:
output:
20 20 11111000111110111110 10001111001011001011 11110001101101101101 00011110110110110110 11100011011011011011 10111101101101101101 10000110110110110111 11111011011011011001 00001101101101101101 11110110110110110110 10011011011011011010 11101101101101101011 10110110110110101101 00011011011010110101 ...
result:
ok 125 successful hack.