제출 #1090888

#제출 시각아이디문제언어결과실행 시간메모리
1090888vjudge1Toys (CEOI18_toy)C++14
59 / 100
5045 ms1640 KiB
// [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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...