제출 #942843

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
942843		vjudge1	Toys (CEOI18_toy)	C++17	59 / 100	5030 ms	1092 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);
    auto split=[&](int n){
        set<int> ans;
        map<int, int> mp;
        
            function<void(int, int, int, int)> f=[&](int cur, int have, int sum, int last){
                    if(cur == n){
                        mp[sum] = 1;
                        return;
                    }
                    if(cur > n) return;
                    for(int x = last; cur * x <= n; x++){
                        f(cur*x, have + 1, sum + x - 1, x);
                    }
            };
            f(1, 0, 0, 2);
        
        for(auto [x, y] : mp){
            ans.insert(x);
        }
        return ans;
    };
    int n; cin >> n;
   
    set<int> st = split(n);
    cout << st.size() << '\n';
    for(auto x : st){
        cout << x << ' ';
    }
    cout << '\n';
    
    
    return 0;
}

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