Submission #1093637

#	Time	Username	Problem	Language	Result	Execution time	Memory
1093637		vjudge1	Toys (CEOI18_toy)	C++17	79 / 100	5066 ms	4660 KiB

toy

#include <bits/stdc++.h>

using namespace std;
using ll = long long;

//#define int long long
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (b); i >= (a); i --)
#define REP(i, a) for (int i = 0; i < (a); ++i)
#define REPD(i, a) for (int i = (a) - 1; i >= 0; --i)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)


constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

/*
    Phu Trong from Nguyen Tat Thanh High School for gifted student
*/

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }
int N;
vector<int> divs;
vector<int> ans;
void Try(int last, int total, int n){
    if(n == 1){
        ans.emplace_back(total);
        return;
    }
    for (int i = last; i < (int)divs.size(); ++i){
        if(n % divs[i] == 0) {
            Try(i, total + divs[i] - 1, n / divs[i]);
        }
    }
}
void process(void){
    cin >> N;
    //at most 9 prime divisor

    for (int i = 2; i * i <= N; ++i) if(N % i == 0){
        divs.emplace_back(i);

        if(N / i != i) divs.emplace_back(N / i);
    }
    divs.emplace_back(N);
    sort(divs.begin(), divs.end());

    Try(0, 0, N);

    sort(ans.begin(), ans.end());
    ans.resize(unique(ans.begin(), ans.end()) - ans.begin());

    cout << (int)ans.size() << '\n';
    for (int&v : ans) {
        cout << v << " ";
    }
}
signed main(){
    #define name "Whisper"
    cin.tie(nullptr) -> sync_with_stdio(false);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    process();
    return (0 ^ 0);
}

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