제출 #113322

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
113322		Diuven	Toys (CEOI18_toy)	C++14	59 / 100	5012 ms	2856 KiB

toy

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

typedef long long lint;
typedef pair<int, int> pii;

const int INF = 2e9;
const int MOD = 1e9+7;
const int MAX = 1e5+10;
const lint LNF = 2e18;

vector<int> ans, D;
int n;

void solve(int x, int m, int sum){
	if(m==1){ ans.push_back(sum); return; }
	for(int d:D) if(x<=d && m%d==0) solve(d, m/d, sum+d-1); 
}

int main(){
	ios::sync_with_stdio(0); cin.tie(0);

	cin>>n;
	for(int i=1; i*i<=n; i++) if(n%i==0) D.push_back(i), D.push_back(n/i);
	sort(D.begin(), D.end());

	solve(2, n, 0);

	sort(ans.begin(), ans.end());
	ans.resize(unique(ans.begin(), ans.end())-ans.begin());
	cout<<ans.size()<<'\n';
	for(int x:ans) 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