# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
398273 | mars | Sequence (BOI14_sequence) | C++14 | 338 ms | 36092 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 <iostream>
#include <cstdio>
using namespace std;
#define N 100000
int mas[N][10][9];
long long best = 102345678900000LL;
int atb[17];
int K;
int B[N];
void check(int gar)
{
long long rez = 0;
for (int i = gar; i >= 0; i--)
{
rez = rez * 10 + atb[i];
}
if (rez < best)
{
best = rez;
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |