제출 #1039062

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1039062		slivajan	Toys (CEOI18_toy)	C++17	79 / 100	5054 ms	74648 KiB

toy

#include <bits/stdc++.h>
using namespace std;

typedef long long un;
typedef vector<un> vuc;
typedef set<un> sun;

#define vec vector
#define REP(i, a, b) for (un i = (un)a; i < (un)b; i++)
#define FEAC(i, a) for (auto&& i : a)
#define ALL(x) (x).begin(), (x).end()


map<un, sun> cache;

void answer(un a){
    if (cache.count(a) != 0) return;

    sun ret;
    ret.insert(a-1);

    for(un i = 2; i*i <= a; i++){
        if (a%i != 0) continue;

        answer(i);
        answer(a/i);

        FEAC(sa, cache[i]) FEAC(sb, cache[a/i]){
            ret.insert(sa + sb);
        }
    }

    cache[a] = ret;
}

int main(){
    un N;
    cin >> N;

    answer(N);
    sun ans = cache[N];

    cout << ans.size() << endl;
    FEAC(i, ans) cout << i << " ";
}

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