Submission #81534

#	Time	Username	Problem	Language	Result	Execution time	Memory
81534		antimirage	Toys (CEOI18_toy)	C++17	59 / 100	2307 ms	263168 KiB

toy

#include <bits/stdc++.h>

#define mk make_pair
#define pb push_back
#define fr first
#define sc second

using namespace std;

int n;

vector <int> vec;
deque <int> en;

map <int, vector <int> > mp;

set <int> st;

int main() 
{
	cin >> n;
	en.pb(n);
	for (int i = 2; i * i <= n; i++)
	{
		if (n % i != 0) continue;
		vec.pb(i);
		if (i != n / i)
			en.push_front(n / i);
	}
	for (auto to : en)
		vec.pb(to);
	mp[1].pb(0);
	
	for (int i = 0; i < (int)vec.size(); i++)
	{
		for (int j = 0; j <= i; j++)
		{
			if (vec[i] % vec[j] != 0) continue;
			for (auto to : mp[ vec[i] / vec[j] ])
				mp[ vec[i] ].pb( to + vec[j] - 1 );
		}
	}
	for (auto to : mp[n])
		st.insert(to);
	cout << st.size() << endl;
	for (auto to : st)
		printf("%d ", to);
}

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