# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
826048 | faruk | Toys (CEOI18_toy) | C++17 | 5024 ms | 6472 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>
#define mp make_pair
#define all(a) a.begin(), a.end()
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int maxn = 1e6 + 2;
vector<int> min_prim(maxn);
void sito() {
for (ll i = 2; i < maxn; i++) {
if (min_prim[i] != 0)
continue;
for (ll j = i ; j < maxn; j += i)
if (min_prim[j] == 0)
min_prim[j] = i;
}
}
vector<int> facs;
void get_small_primes(int a) {
if (a == 1)
return;
facs.push_back(min_prim[a]);
get_small_primes(a / min_prim[a]);
}
Compilation message (stderr)
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |