oj.uz

Submission #426339

# Submission time Handle Problem Language Result Execution time Memory
426339 2021-06-13T18:34:55 Z lukadupli Toys (CEOI18_toy) C++14
0 / 100
 0 ms 204 KB 
#include <bits/stdc++.h>

using namespace std;

int n;
map <int, set <int>> memo;

set <int> rek(int x){
    if(x == 1) return {};
    if(memo[x].size() != 0) return memo[x];

    set <int> ret = {x - 1};
    for(int i = 2; i <= sqrt(x); i++){
        set <int> s = rek(x / i);
        for(auto e : s) ret.insert(e + i - 1);
    }

    memo[x] = ret;
    return ret;
}

int main() {
    cin >> n;

    set <int> sol = rek(n);
    if(sqrt(n) * sqrt(n) == n) sol.erase(sqrt(n) - 1);

    cout << sol.size() << '\n';
    for(int e : sol) cout << e << ' ';

	return 0;
}

Subtask #1
0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -