Submission #124384

#	Time	Username	Problem	Language	Result	Execution time	Memory
124384		RafikHachana	Toys (CEOI18_toy)	C++14	79 / 100	5092 ms	37880 KiB

toy

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

set<int> s;
set<pair<int,int> > v;

void dp(int n,int x)
{
	if(n==1)
	{
		s.insert(x);
		return;
	}
	if(v.find({n,x})!=v.end()) return;
	for(int i=1;i<=sqrt(n);i++)
	{
		if(n%i==0)
		{
			if(i!=1) dp(n/i,x+i-1);
			dp(i,x+n/i-1);
			//v.insert()
		}
	}
	v.insert({n,x});
}

int main()
{
	int n;
	cin>>n;
	dp(n,0);
	cout<<s.size()<<endl;
	for(auto it:s) cout<<it<<" ";
		cout<<endl;
}

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