Submission #942902

#	Time	Username	Problem	Language	Result	Execution time	Memory
942902		vjudge1	Toys (CEOI18_toy)	C++17	59 / 100	169 ms	262144 KiB

toy

#include <bits/stdc++.h>

using namespace std;
#define ff first
#define ss second
#define all(a) a.begin(), a.end()



signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    auto split=[&](int n){
        set<int> ans;
        ans.insert(n-1);
        vector<int> p;
        for(int i = 2; i * i <= n; i++){
            if(n%i == 0){
                p.push_back(i);
                if(n / i != i) p.push_back(n / i);
            }
        }
        sort(all(p));
        
            function<void(int, int, int, int)> f=[&](int cur, int have, int sum, int last){
                    if(cur > n) return;
                    if(cur == n){
                        ans.insert(sum);
                        return;
                    }
                    for(int id = last; id < (int)p.size(); id++){
                        int x = p[id];
                        if(cur * x > n) break;
                        f(cur*x, have + 1, sum + x - 1, id);
                    }
            };
            f(1, 0, 0, 0);
        
        return ans;
    };
    int n; cin >> n;
    int N = n;
    /*
    vector<pair<int, int>> factors;
    for(int i = 2; i * i <= n; i++){
        pair<int, int> s = {i, 0};
        while(n > 0 && n % i == 0){
            n/= i;
            s.ss++;
        }
        if(s.ss > 0) factors.push_back(s);
    }
    */
    set<int> st = split(N);
    cout << st.size() << '\n';
    for(auto x : st){
        cout << x << ' ';
    }
    
    
    return 0;
}

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