# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
112411 | reda | Toys (CEOI18_toy) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
vector <int> ans;
void dfs (int a, vector <int> v)
{
ans.push_back(a-1);
for (int m:v)
if (a%m == 0)
dfs(a/m,v,m-1);
}
int main()
{
int n;
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin>>n;
vector <int> v;
for (int i=2;i*i<=n;i++)
{
if(n%i!=0) continue;
v.push_back(i);
if(i!=n/i)
v.push_back(n/i);
}
dfs(n,v);
set <int> r;
for (auto i:ans)
r.insert(i);
cout << r.size() << endl;
for (auto it:r)
cout<<it<<' ';
return 0;
}