# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
464955 | idk321 | Toys (CEOI18_toy) | C++17 | 5049 ms | 88160 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;
typedef long long ll;
unordered_map<int, unordered_set<int>> possibleAt;
const int N = 10000000;
int divFac[N];
void getDivisors(vector<int>& divisors, vector<array<int, 2>>& freqs, int ind, int cur) {
if (ind == freqs.size()) {
divisors.push_back(cur);
return;
}
for (int i = 0; i <= (freqs[ind][1]); i++) {
getDivisors(divisors, freqs, ind + 1, cur);
cur *= freqs[ind][0];
}
}
void solveFor(int num) {
if (possibleAt.find(num) != possibleAt.end()) return;
possibleAt[num].insert(num - 1);
if (num < N) {
map<int, int> mapp;
int cnum = num;
while (cnum != 1) {
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... |