# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
651983 | ducbrick | Non-boring sequences (CERC12_D) | C++17 | 5050 ms | 2008 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
template <typename T> inline void read(T &n) {
char digit;
do
digit = getchar();
while (isdigit(digit) == false && digit != '-');
bool negative = (digit == '-');
if (negative)
digit = getchar();
n = 0;
do
n = n * 10 + digit - '0',
digit = getchar();
while (isdigit(digit));
if (negative)
n = -n;
}
const int MAX_N = 2e5;
int a[MAX_N + 1];
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |