제출 #537354

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
537354		Hydroxic_Acid	Toys (CEOI18_toy)	C++17	59 / 100	5063 ms	77592 KiB

toy

#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <set>
#include <map>
using namespace std;

int n;
vector<int> v;
set<int> ans;
map<pair<int, pair<int, int> >, int > memo;

void dp(int N, int i, int summ){
	if(N == 1){
		ans.insert(summ); return;
	}
	if(memo[make_pair(N, make_pair(i, summ))] == 1) return;
	for(int x = i; x < (int)v.size(); x++){
		if(N % v[x] == 0){
			dp(N / v[x], x, summ + v[x] - 1);
		}
	}
	memo[make_pair(N, make_pair(i, summ))] = 1;
}

signed main(){
	cin >> n;
	int f = 1;
	while(f <= (int)sqrt(n)){
		if(n % f == 0){
			if(f != 1) v.push_back(f);
			if(n/f != f) v.push_back(n/f);
		}
		f++;
	}
	sort(v.begin(), v.end());
	dp(n, 0, 0);
	cout << (int)ans.size() << "\n";
	for(set<int>::iterator it = ans.begin(); it != ans.end(); it++){
		cout << (*it) << " ";
	}
}

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