| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1333736 | Hduong | Toys (CEOI18_toy) | C++20 | 0 ms | 344 KiB |
#include <bits/stdc++.h>
#define task "task"
using namespace std;
const long long INF = 1e18;
long long n;
set<long long> ans;
void dfs (long long rem, long long last, long long sum, int k) {
if (rem >= last) {
ans.insert(sum + rem - (k + 1));
}
for (long long i = last; i*i <= rem; i++) {
if (rem % i == 0) {
dfs(rem / i, i, sum + i, k + 1);
}
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
if (fopen(task".inp", "r")) {
freopen(task".inp", "r", stdin);
freopen(task".out", "w", stdout);
}
cin >> n;
dfs(n, 2, 0, 0);
cout << ans.size() << "\n";
for (auto x : ans) cout << x << " ";
}
컴파일 시 표준 에러 (stderr) 메시지
| # | 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... | ||||
