Submission #1274653

#	Time	Username	Problem	Language	Result	Execution time	Memory
1274653		AksLolCoding	Toys (CEOI18_toy)	C++17	59 / 100	5090 ms	1068 KiB

toy

#include <bits/stdc++.h>
using namespace std;

set<int> ans;

void dfs(int n, int s) {
    // remaining divisors multiply to n, s sum is used
    ans.insert(n+s-1);
    for (int i = 2; i*i <= n; i++) {
        if (n%i == 0) {
            dfs(n/i, s+i-1);
        }
    }
}

void solve() {
    int n;
    cin >> n;
    dfs(n, 0);
    cout << ans.size() << '\n';
    for (int i : ans) cout << i << ' ';
}

signed main() {
    cin.tie(0)->sync_with_stdio(0);
    solve();
}

• Subtask 1: 19 / 19
• Subtask 2: 20 / 20
• Subtask 3: 20 / 20
• Subtask 4: 0 / 20
• Subtask 5: 0 / 21