# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
73452 | jiaqing23 | Toys (CEOI18_toy) | C++14 | 5098 ms | 3972 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;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define pop pop_back
typedef long long ll;
set<ll> ans;
ll n;
vector<ll> fac,factor_tem, factor;
ll sum = 0;
void factorize(ll n, ll now, ll smallfac){
if(now == n) ans.insert(sum);
for(int i = smallfac; factor[i]*now <= n ; i++){
if((n/now) % factor[i] == 0){
fac.pb(factor[i]);
sum+=(factor[i]-1);
factorize(n, now*factor[i], i);
sum-=(factor[i]-1);
fac.pop();
}
}
}
int main()
{
scanf("%lld",&n);
for(int i = 1; i * i <= n; i++){
if(n%i==0) {
factor.pb(i);
if(i*i!=n)factor_tem.pb(n/i);
}
}
reverse(factor_tem.begin(),factor_tem.end());
factor_tem.pb((ll)1e10);
factor.resize(factor_tem.size()+factor.size());
copy_backward(factor_tem.begin(),factor_tem.end(),factor.end());
factorize(n, 1, 1);
printf("%d\n",ans.size());
for(set<ll>::iterator it = ans.begin(); it!=ans.end(); it++){
printf("%lld ",*it);
}
return 0;
}
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... |