QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#571870 | #6418. Ah, It's Yesterday Once More | Zhi_zI# | WA | 0ms | 3588kb | C++17 | 1.9kb | 2024-09-18 09:35:15 | 2024-09-18 09:35:16 |
Judging History
answer
#include <bits/stdc++.h>
/* Orther */
#define int long long
#define YES cout<<"YES\n"
#define NO cout<<"NO\n"
#define IOS ios::sync_with_stdio(false);cin.tie(0); cout.tie(0)
using namespace std;
/* Pair */
#define x first
#define y second
/* Data type */
using ll = long long;
using ull = unsigned long long;
using PII = pair<int,int>;
using VI = vector<int>;
/* STL */
#define eb emplace_back
#define ef emplace_front
#define pb push_back
#define pf push_front
#define mp make_pair
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define all1(x) x.begin()+1,x.end()
/* Random */
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define random(a,b) rng()%(b-a+1)+a
/* Contest */
const int INF = 0x3f3f3f3f ; // 1e9
const int MOD = 998244353 ;
const int N = 2e5 + 10, M = 55;
char g[20][20];
void Rainbow_()
{
char ans[2] = {'0','1'};
for (int i = 0; i < 20 ; i ++ ) {
for (int j = 0 ; j < 20; j ++ ) {
g[i][j] = ans[rand() % 2];
}
}
puts("20 20");
puts("11111111111111111111");
puts("10000000000000000000");
puts("11111111111111111111");
puts("01000000000000000000");
puts("11111111111111111111");
puts("00100000000000000000");
puts("11111111111111111111");
puts("00010000000000000000");
puts("11111111111111111111");
puts("00001000000000000000");
puts("11111111111111111111");
puts("00000100000000000000");
puts("11111111111111111111");
puts("00000010000000000000");
puts("11111111111111111111");
puts("00000001000000000000");
puts("11111111111111111111");
puts("00000000100000000000");
puts("11111111111111111111");
puts("00000000010000000000");
}
signed main()
{
IOS;
int _ = 1;
// cin >> _;
while ( _ -- )
Rainbow_();
return 0;
}
詳細信息
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3588kb
input:
output:
20 20 11111111111111111111 10000000000000000000 11111111111111111111 01000000000000000000 11111111111111111111 00100000000000000000 11111111111111111111 00010000000000000000 11111111111111111111 00001000000000000000 11111111111111111111 00000100000000000000 11111111111111111111 00000010000000000000 ...
result:
wrong answer 0 successful hack.