Submission #533831

#TimeUsernameProblemLanguageResultExecution timeMemory
533831alextodoranToys (CEOI18_toy)C++17
100 / 100
1930 ms86644 KiB
/**
 ____ ____ ____ ____ ____
||a |||t |||o |||d |||o ||
||__|||__|||__|||__|||__||
|/__\|/__\|/__\|/__\|/__\|

**/

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

int n;

unordered_map <int, set <int>> s;

int main () {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    cin >> n;
    vector <int> d;
    for (int i = 1; i * i <= n; i++) {
        if (n % i == 0) {
            d.push_back(i);
            if (i * i != n) {
                d.push_back(n / i);
            }
        }
    }
    sort(d.begin(), d.end());
    s[1].insert(0);
    for (int x : d) {
        if (x != 1) {
            for (int y : d) {
                if (x % y == 0) {
                    for (int v : s[x / y]) {
                        s[x].insert(v + y - 1);
                    }
                }
            }
        }
    }

    cout << (int) s[n].size() << "\n";
    for (int v : s[n]) {
        cout << v << " ";
    }
    cout << "\n";

    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...