QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#565311 | #9310. Permutation Counting 4 | Yukii_P | WA | 0ms | 3660kb | C++14 | 1.6kb | 2024-09-15 20:56:28 | 2024-09-15 20:56:29 |
Judging History
answer
#include <bits/stdc++.h>
#define FIO cin.tie(0); ios::sync_with_stdio(false)
#define mkp make_pair
#define mkt make_tuple
#define fi first
#define se second
#define inf 0x3f3f3f3f
#ifndef ONLINE_JUDGE
#define debug(x) cerr << #x << "=" << x << '\n'
#else
#define debug(x)
#endif
using namespace std;
using i64 = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using pii = pair<int, int>;
inline char nc() {
static char buf[1 << 20], *p1, *p2;
return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1<<20, stdin), p1 == p2) ? EOF : *p1++;
}
#ifndef ONLINE_JUDGE
#define nc getchar
#endif
void read() {}
template<typename T, typename... T2>
inline void read(T &x, T2 &... oth) {
x = 0; char c = nc(), up = c;
while(!isdigit(c)) up = c, c = nc();
while(isdigit(c)) x = x * 10 + c - '0', c = nc();
up == '-' ? x = -x : 0;
read(oth...);
}
void solve() {
//int n;
//cin >> n;
mt19937_64 rng{};
cout << rand() % 2 << '\n';
}
signed main() {
FIO;
int t;
cin >> t;
while (t--) solve();
return 0;
}
/*
_ _ _ _____ _ _ _ __ _
| \| | (_) |_ _| | || | | '_ \ | |_ ___ ___ _ _
| .` | | | | | \_, | | .__/ | ' \ / _ \ / _ \ | ' \
|_|\_| _|_|_ _|_|_ _|__/ |_|__ |_||_| \___/ \___/ |_||_|
_|"""""|_|"""""|_|"""""|_| """"|_|"""""|_|"""""|_|"""""|_|"""""|_|"""""|
"`-0-0-'"`-0-0-'"`-0-0-'"`-0-0-'"`-0-0-'"`-0-0-'"`-0-0-'"`-0-0-'"`-0-0-'
*/
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3660kb
input:
4 5 1 2 1 5 1 2 1 2 2 2 5 1 1 2 4 2 3 5 5 3 4 5 3 5 1 2 3 4 3 5 3 3 5 1 5 1 4 4 5 5 5 1 2
output:
1 0 1 1
result:
wrong answer 1st words differ - expected: '0', found: '1'