제출 #942838

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
942838		vjudge1	Toys (CEOI18_toy)	C++17	59 / 100	4647 ms	1020 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);
        for(int len = 2; len <= 33; len++){
            function<void(int, int, int, int)> f=[&](int cur, int have, int sum, int last){
                    if(have == len){
                       if(cur == n) ans.insert(sum);
                       return; 
                    }
                    if(have == len-1){
                        int x = n / cur;
                        if(n % cur != 0 or x <= 1) return;
                        ans.insert(sum + x - 1);
                        return;
                    }
                    long long atleast = cur * (1LL<<(len - have));
                    if(atleast > n) return;
                    for(int x = last; ; x++){
                        atleast = cur * x * (1LL<<(len - have - 1));
                        if(atleast > n) return;
                        f(cur*x, have + 1, sum + x - 1, x);
                    }
            };
            f(1, 0, 0, 2);
        }
        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 << ' ';
    }
    cout << '\n';
    
    
    return 0;
}

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