QOJ.ac
QOJ
The 2nd Universal Cup Finals is coming! Check out our event page, schedule, and competition rules!
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#644819 | #6418. Ah, It's Yesterday Once More | rush-from-behind# | WA | 0ms | 3764kb | C++17 | 808b | 2024-10-16 15:32:55 | 2024-10-16 15:32:57 |
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(){
srand(time(0));
printf("20 20\n");
for (int i = 1; i <= n; ++i)if (i & 1){
for (int j = 1; j <= n; ++j)printf("1"); printf("\n");
}
else {
int x = get(1, n);
for (int j = 1; j <= n; ++j)if (j == x)printf("1");
else printf("0");
printf("\n");
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3764kb
input:
output:
20 20 11111111111111111111 00000000100000000000 11111111111111111111 00001000000000000000 11111111111111111111 00000001000000000000 11111111111111111111 01000000000000000000 11111111111111111111 00000000010000000000 11111111111111111111 00100000000000000000 11111111111111111111 00000000100000000000 ...
result:
wrong answer 2 successful hack.