# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
581704 | 2022-06-23T04:14:29 Z | Memito08 | Toys (CEOI18_toy) | C++14 | 0 ms | 212 KB |
#include <bits/stdc++.h> using namespace std; vector<int> sumas; long long sum = 0; vector<bool> u; void solve(long long n, int act) { if (n == 1 && !u[sum]) { sumas.push_back(sum); u[sum] = 1; return; } for (int i = act ; i*i <= n ; i++) { if (n % i == 0) { sum += i-1; solve(n/i,i); sum -= i-1; } } if (n > 1) { sum += n-1; solve(1,n); sum -= n-1; } } int main() { long long n; cin >> n; u.assign(n, 0); solve(n, 2); sort(sumas.begin(),sumas.end()); for (int i = 0 ; i < sumas.size() ; i++) { cout << sumas[i]; if (i != sumas.size()-1) cout << " "; } cout << "\n"; return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |