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 ff first
#define ss second
#define all(a) a.begin(), a.end()
#define int long long
signed main(){
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
auto split=[&](int n){
set<int> ans;
map<int, int> mp;
function<void(int, int, int, int)> f=[&](int cur, int have, int sum, int last){
if(cur == n){
mp[sum] = 1;
return;
}
if(cur > n) return;
for(int x = last; cur * x <= n; x++){
f(cur*x, have + 1, sum + x - 1, x);
}
};
f(1, 0, 0, 2);
for(auto [x, y] : mp){
ans.insert(x);
}
return ans;
};
int n; cin >> n;
set<int> st = split(n);
cout << st.size() << '\n';
for(auto x : st){
cout << x << ' ';
}
cout << '\n';
return 0;
}
| # | 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... |