# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
652890 | lto5 | Non-boring sequences (CERC12_D) | C++14 | 5017 ms | 3460 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;
const int N = 2e5 + 5;
template <typename T> inline void read (T &x) {
char ch;
while (!isdigit(ch = getchar()) && ch != '-') ;
bool sign = ch == '-';
x = isdigit(ch) ? ch - '0' : 0;
while (isdigit(ch = getchar()))
x = x * 10 + ch - '0';
if (sign)
x = -x;
}
template <typename T> inline void write_pos (T x) {
if (x > 9) {
write_pos(x / 10);
}
putchar(x % 10 + '0');
}
template <typename T> inline void write (T x) {
if (x < 0)
putchar('-'), x = -x;
write_pos(x);
}
int n;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |