#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
using namespace std;
#define int long long
#define pii pair<int,int>
#define ff first
#define ss second
#define sp << " " <<
#define all(cont) cont.begin(),cont.end()
#define vi vector<int>
const int inf = 2e18,N = 1e6+1,MOD = 1e9+7;
void solve() {
int n;
cin >> n;
vi v;
for (int i=1;i*i<=n;i++) {
if (n%i) continue;
v.push_back(i);
if (n/i != i) v.push_back(n/i);
}
sort(all(v));
map<int,int> htable;
vi ans;
for (auto a : v) {
int nn = n/a;
for (auto b : v) {
if (nn%b) continue;
int nnn = nn/b;
for (auto c : v) {
if (nnn%c) continue;
if (!htable[a+b+c+nnn/c]) {
ans.push_back({a+b+c+nnn/c});
htable[a+b+c+nnn/c] = 1;
}
}
}
}
sort(all(ans));
cout << ans.size() << '\n';
for (auto& it : ans) cout << it-4 << ' ';
cout << '\n';
}
int32_t main() {
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#ifdef Dodi
freopen("in.txt","r",stdin);
freopen("out.txt","w",stdout);
#endif
int t = 1;
//cin >> t;
while (t --> 0) solve();
}
# | 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... |