QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#571851 | #6418. Ah, It's Yesterday Once More | Zhi_zI# | WA | 0ms | 3584kb | C++17 | 1.3kb | 2024-09-18 09:26:51 | 2024-09-18 09:26:51 |
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];
}
}
cout << "20 20\n";
for (int i = 0; i < 20 ; i ++ ) {
for (int j = 0 ; j < 20; j ++ ) {
cout << g[i][j];
} cout << '\n';
}
}
signed main()
{
IOS;
int _ = 1;
// cin >> _;
while ( _ -- )
Rainbow_();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3584kb
input:
output:
20 20 10111100110101100000 10110001111000111010 11110100101010010001 11010101110101010010 10000011010000100001 10001110100010011101 01111111111011010110 01011100010101010111 10001010000010111110 01101101011111001101 00111000000011100101 01010011001000111001 00110000101110010000 01000001000001100111 ...
result:
wrong answer Cycle Detected.