| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1353017 | Newtonabc | Toys (CEOI18_toy) | C++20 | 5094 ms | 972 KiB |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll n;
set<ll> ans;
void f(ll n,ll sum){
if(n==1){
ans.insert(sum);
return;
}
vector<int> v;
for(ll i=1;i<=sqrt(n);i++){
if(n%i) continue;
if(i!=1) f(n/i,sum+i-1);
if(n/i!=i) f(i,sum+n/i-1);
}
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cin>>n;
f(n,0);
cout<<ans.size() <<"\n";
for(auto x:ans) cout<<x <<" ";
}| # | 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... | ||||
