| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1274655 | AksLolCoding | Toys (CEOI18_toy) | C++17 | 320 ms | 4576 KiB |
#include <bits/stdc++.h>
using namespace std;
set<int> ans;
void dfs(int n, int s, int m) {
ans.insert(n+s-1);
for (int i = m; i*i <= n; i++) {
if (n%i == 0) {
dfs(n/i, s+i-1, i);
}
}
}
void solve() {
int n;
cin >> n;
dfs(n, 0, 2);
cout << ans.size() << '\n';
for (int i : ans) cout << i << ' ';
}
signed main() {
cin.tie(0)->sync_with_stdio(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... | ||||
