This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
// [CEOI2018] toys
#include <bits/stdc++.h>
using namespace std;
void dfs(int last, const int s, const int n, set<int>& A) {
if (n == 1) A.insert(s);
for (int a = last + (last == 1); a <= n; ++a)
if (n % a == 0) dfs(a, s + a - 1, n / a, A);
}
int main() {
ios::sync_with_stdio(false), cin.tie(0);
int n;
cin >> n;
set<int> A;
dfs(1, 0, n, A);
cout << A.size() << "\n";
for (int a : A) cout << a << " ";
return 0;
}
// ❓❓ 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... |