Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <optional>
- #include <vector>
- std::optional<std::vector<int>> k_factorize(int number, int k) {
- int divisor = 2;
- std::vector<int> factorization;
- while (divisor * divisor <= number && factorization.size() + 1 < k) {
- if (number % divisor == 0) {
- number /= divisor;
- factorization.push_back(divisor);
- } else {
- divisor += 1;
- }
- if (number == 1) {
- return std::nullopt;
- }
- }
- factorization.push_back(number);
- if (factorization.size() == k) {
- return factorization;
- }
- return std::nullopt;
- }
- int main() {
- int number, k;
- std::cin >> number >> k;
- auto factorization = k_factorize(number, k);
- if (factorization) {
- for (auto factor: factorization.value()) {
- std::cout << factor << " ";
- }
- } else {
- std::cout << -1;
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement