Submission #942969

#	Time	Username	Problem	Language	Result	Execution time	Memory
942969		vjudge1	Toys (CEOI18_toy)	C++14	79 / 100	5004 ms	2432 KiB

toy

#include <bits/stdc++.h>

using namespace std;
#define ff first
#define ss second
#define all(a) a.begin(), a.end()
#define int long long
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    int n; cin >> n;
    unordered_map<int, int> mp;
    mp[n-1] = 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){
                mp[sum] = 1;
                return;
            }
            for(int id = last; id < (int)p.size(); id++){
                int x = p[id];
                if((long long)(cur * x) > n) break;
                f(cur*x, have + 1, sum + x - 1, id);
            }
           
            
    };
    f(1, 0, 0, 0);
    vector<int> ans;
    for(auto x : mp) ans.push_back(x.ff);
    
    sort(all(ans));
    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: 0 / 21