| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1353373 | top1svtin | Toys (CEOI18_toy) | C++17 | 282 ms | 33384 KiB |
#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a);i<=(b);++i)
#define FORD(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
#define kien long long
#define int long long
#define pb push_back
const int MXN = 1e5 + 5;
const int INF = 1e18;
kien n, k, a[MXN];
kien minn;
vector <int> ans;
//kien dp[315][305][155];
void dnc (kien n, kien minn, kien sum) {
ans.pb(sum + n - 1);
for (int i = minn; i <= sqrt(n); i++) {
if (n % i == 0) {
dnc(n / i, i, sum + i - 1);
}
}
}
main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n;
dnc(n, 2, 0);
sort(ans.begin(), ans.end());
ans.erase(unique(ans.begin(), ans.end()), ans.end());
cout << ans.size() << "\n";
for (auto x : ans) {
cout << x << " ";
}
// cout << v.size() << "\n";
}컴파일 시 표준 에러 (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... | ||||
