# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
920813 | Faisal_Saqib | Toys (CEOI18_toy) | C++17 | 893 ms | 22224 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 <iostream>
#include <map>
#include <vector>
#include <algorithm>
using namespace std;
map<int,vector<int>> mp;
void pos(long long&x)
{
auto it=mp.find(x);
if(it!=mp.end())
return;
vector<int> cur={x-1};
for(long long d=2;(d*d)<=x;d++)
{
if(x%d==0)
{
long long rem=x/d;
pos(rem);
for(auto&j:mp[rem])
cur.push_back(j+(d-1));
if((d*d)!=x)
{
d=x/d;
long long rem=x/d;
pos(rem);
for(auto&j:mp[rem])
cur.push_back(j+(d-1));
d=x/d;
}
}
}
sort(begin(cur),end(cur));
cur.resize(unique(begin(cur),end(cur))-begin(cur));
mp[x]=cur;
}
int main()
{
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(0);
long long n;
cin>>n;
pos(n);
auto tlp=mp[n];
cout<<tlp.size()<<endl;
for(auto j:tlp)
{
cout<<j<<' ';
}
cout<<endl;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |