# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
920764 | Faisal_Saqib | Toys (CEOI18_toy) | C++17 | 2550 ms | 90600 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 <set>
using namespace std;
map<int,set<int>> mp;
void pos(int&x)
{
auto it=mp.find(x);
if(it!=mp.end())
return;
set<int> cur={x-1};
for(long long d=2;(d*d)<=x;d++)
{
if(x%d==0)
{
x/=d;
pos(x);
auto nxt=mp[x];
for(auto&j:nxt)
cur.insert(j+(d-1));
x*=d;
if((d*d)!=x)
{
d=x/d;
x/=d;
pos(x);
auto nxt=mp[x];
for(auto&j:nxt)
cur.insert(j+(d-1));
x*=d;
d=x/d;
}
}
}
mp[x]=cur;
}
int main()
{
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(0);
int n;
cin>>n;
scanf("%d",&n);
pos(n);
auto tlp=mp[n];
printf("%d\n",tlp.size());
for(auto&i:tlp)
printf("%d ",i);
printf("\n");
}
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... |