Submission #536865

#	Time	Username	Problem	Language	Result	Execution time	Memory
536865		joelau	Toys (CEOI18_toy)	C++14	100 / 100	1893 ms	59832 KiB

toy

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

long long X;
set<long long> ans;
unordered_set<long long> s;

void f(long long n, long long sum) {
    s.insert(n*1000000000+sum);
    ans.insert(sum+n-1);
    for (long long i = 2; i*i <= n; ++i) if (n % i == 0 && s.find(n/i*1000000000+sum+i-1) == s.end()) f(n/i,sum+i-1);
}

int main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL);
    cin >> X;
    f(X,0);
    cout << ans.size() << '\n';
    for (auto x: ans) cout << x << ' ';

    return 0;
}

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