{"request":{"endpoint":"https://exercism.org/api/v2/tracks/cpp/exercises/prime-factors/community_solutions","query":{},"options":{"initial_data":{"results":[{"uuid":"7e46c32933d343ffbf13e898480dfac1","snippet":"std::vector prime_factors::of(unsigned int n){ std::vector out; unsigned int fact = 2; while (n != 1){ if (n % fact == 0){ n = n / fact; out.push_back(fact); } else { ++fact; } ","num_views":0,"num_stars":9,"num_comments":0,"representation_num_published_solutions":11,"num_iterations":2,"num_loc":22,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2018-07-13T10:01:29.000Z","is_out_of_date":false,"language":"cpp","author":{"handle":"joseph-fourier"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"C++","icon_url":"https://assets.exercism.org/tracks/cpp.svg","highlightjs_language":"cpp"},"links":{"public_url":"https://exercism.org/uk/tracks/cpp/exercises/prime-factors/solutions/joseph-fourier","private_iterations_url":"https://exercism.org/uk/tracks/cpp/exercises/prime-factors/iterations"}},{"uuid":"afed4f80e498450c99e9c696eb8ca445","snippet":"namespace prime_factors { std::vector of(int n) { std::vector primes; int i = 2; while (n > 1) { if (n % i == 0) { primes.push_back(i); n /= i; } else { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":7,"num_iterations":1,"num_loc":23,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-10-30T14:54:18.000Z","is_out_of_date":false,"language":"cpp","author":{"handle":"Puffish"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"C++","icon_url":"https://assets.exercism.org/tracks/cpp.svg","highlightjs_language":"cpp"},"links":{"public_url":"https://exercism.org/uk/tracks/cpp/exercises/prime-factors/solutions/Puffish","private_iterations_url":"https://exercism.org/uk/tracks/cpp/exercises/prime-factors/iterations"}},{"uuid":"e68fd78aba324121a4716a13a1e5a03d","snippet":"namespace prime_factors { std::vector of(long long n) { std::vector factors; for (long long i = 2; i * i <= n; ++i) { while (n % i == 0) { factors.push_back(i); n /= i; } } if (n > 1) { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":7,"num_iterations":1,"num_loc":23,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-03-23T14:51:54.000Z","is_out_of_date":false,"language":"cpp","author":{"handle":"pandafox"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"C++","icon_url":"https://assets.exercism.org/tracks/cpp.svg","highlightjs_language":"cpp"},"links":{"public_url":"https://exercism.org/uk/tracks/cpp/exercises/prime-factors/solutions/pandafox","private_iterations_url":"https://exercism.org/uk/tracks/cpp/exercises/prime-factors/iterations"}},{"uuid":"92c26a1654f8467c801f0af15f162532","snippet":"namespace prime_factors { vector of(int n) { vector r; for (int i = 2; n > 1; i++) { while (n % i == 0) { r.push_back(i); n /= i; } } return r; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":6,"num_iterations":1,"num_loc":21,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-12-01T23:20:11.000Z","is_out_of_date":false,"language":"cpp","author":{"handle":"cOd3"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"C++","icon_url":"https://assets.exercism.org/tracks/cpp.svg","highlightjs_language":"cpp"},"links":{"public_url":"https://exercism.org/uk/tracks/cpp/exercises/prime-factors/solutions/cOd3","private_iterations_url":"https://exercism.org/uk/tracks/cpp/exercises/prime-factors/iterations"}},{"uuid":"38bae4bbe778497086fa694e0158fa15","snippet":"namespace prime_factors { longVec of(long long n){ longVec out; int x = 2; while(n != 1){ if ( n % x == 0){ out.push_back(x); n = n/x; }else{ x += 1; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":5,"num_iterations":1,"num_loc":24,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-09-12T05:58:57.000Z","is_out_of_date":false,"language":"cpp","author":{"handle":"sumith1234"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"C++","icon_url":"https://assets.exercism.org/tracks/cpp.svg","highlightjs_language":"cpp"},"links":{"public_url":"https://exercism.org/uk/tracks/cpp/exercises/prime-factors/solutions/sumith1234","private_iterations_url":"https://exercism.org/uk/tracks/cpp/exercises/prime-factors/iterations"}},{"uuid":"41749ef2189646f795061b5525847e4a","snippet":"namespace prime_factors { std::vector of(int a) { std::vector results; for (int candidate = 2; a > 1; candidate++) { for(; a%candidate == 0; a/=candidate) { ","num_views":0,"num_stars":2,"num_comments":0,"representation_num_published_solutions":4,"num_iterations":1,"num_loc":25,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2018-07-13T10:01:29.000Z","is_out_of_date":false,"language":"cpp","author":{"handle":"johnngugi"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"C++","icon_url":"https://assets.exercism.org/tracks/cpp.svg","highlightjs_language":"cpp"},"links":{"public_url":"https://exercism.org/uk/tracks/cpp/exercises/prime-factors/solutions/johnngugi","private_iterations_url":"https://exercism.org/uk/tracks/cpp/exercises/prime-factors/iterations"}},{"uuid":"3d3856f2de8c471f90cd8f3eebf41acf","snippet":"namespace prime_factors { std::vector of(long long n) { std::vector result; for (long long i = 2; i * i <= n; ++i) { while (n % i == 0) { result.push_back(i); n /= i; } } if (n > 1) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":4,"num_iterations":1,"num_loc":20,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2026-02-15T16:30:13.000Z","is_out_of_date":false,"language":"cpp","author":{"handle":"ilyadh"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"C++","icon_url":"https://assets.exercism.org/tracks/cpp.svg","highlightjs_language":"cpp"},"links":{"public_url":"https://exercism.org/uk/tracks/cpp/exercises/prime-factors/solutions/ilyadh","private_iterations_url":"https://exercism.org/uk/tracks/cpp/exercises/prime-factors/iterations"}},{"uuid":"f3f51ec3ca8f4c13a26020bfcdc8a686","snippet":"namespace prime_factors { std::vector of(long long n) { std::vector factors; while (n % 2 == 0) { factors.push_back(2); n /= 2; } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":4,"num_iterations":1,"num_loc":27,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-02-14T19:17:11.000Z","is_out_of_date":false,"language":"cpp","author":{"handle":"jarius327"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"C++","icon_url":"https://assets.exercism.org/tracks/cpp.svg","highlightjs_language":"cpp"},"links":{"public_url":"https://exercism.org/uk/tracks/cpp/exercises/prime-factors/solutions/jarius327","private_iterations_url":"https://exercism.org/uk/tracks/cpp/exercises/prime-factors/iterations"}},{"uuid":"5cf3e659b88b44ac80ec008e770de08c","snippet":"namespace prime_factors { std::vector of(int n){ std::vector primes{}; int f {2}; while (n > 1){ if(n%f == 0){ primes.push_back(f); n /= f; } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":4,"num_iterations":1,"num_loc":24,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-01-26T14:50:13.000Z","is_out_of_date":false,"language":"cpp","author":{"handle":"JWR26"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"C++","icon_url":"https://assets.exercism.org/tracks/cpp.svg","highlightjs_language":"cpp"},"links":{"public_url":"https://exercism.org/uk/tracks/cpp/exercises/prime-factors/solutions/JWR26","private_iterations_url":"https://exercism.org/uk/tracks/cpp/exercises/prime-factors/iterations"}},{"uuid":"5da67fa887f34a45b7a2b0df5e984806","snippet":"namespace prime_factors { std::vector of(int n); } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":3,"num_iterations":1,"num_loc":24,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2019-10-03T15:15:32.000Z","is_out_of_date":false,"language":"cpp","author":{"handle":"rjmcgrew"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"C++","icon_url":"https://assets.exercism.org/tracks/cpp.svg","highlightjs_language":"cpp"},"links":{"public_url":"https://exercism.org/uk/tracks/cpp/exercises/prime-factors/solutions/rjmcgrew","private_iterations_url":"https://exercism.org/uk/tracks/cpp/exercises/prime-factors/iterations"}},{"uuid":"fdc938837b0943a08a76c82713f5dad2","snippet":"namespace prime_factors { std::vector of(int n) { std::vector factors; for (int i = 2; i <= n; i++) { while (n % i == 0) { factors.push_back(i); n /= i; } } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":3,"num_iterations":1,"num_loc":21,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2019-11-13T15:39:19.000Z","is_out_of_date":false,"language":"cpp","author":{"handle":"xxylem"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"C++","icon_url":"https://assets.exercism.org/tracks/cpp.svg","highlightjs_language":"cpp"},"links":{"public_url":"https://exercism.org/uk/tracks/cpp/exercises/prime-factors/solutions/xxylem","private_iterations_url":"https://exercism.org/uk/tracks/cpp/exercises/prime-factors/iterations"}},{"uuid":"b412033aa5754ad7871a3a1c873f4444","snippet":"namespace prime_factors { std::vector of(int number) { std::vector prime; int divisor = 2; while(number != 1){ if(number % divisor == 0){ number = number / divisor; prime.push_back(divisor); } else{ divisor++; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":3,"num_iterations":1,"num_loc":24,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-07-14T13:55:52.000Z","is_out_of_date":false,"language":"cpp","author":{"handle":"MarioAmato99"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"C++","icon_url":"https://assets.exercism.org/tracks/cpp.svg","highlightjs_language":"cpp"},"links":{"public_url":"https://exercism.org/uk/tracks/cpp/exercises/prime-factors/solutions/MarioAmato99","private_iterations_url":"https://exercism.org/uk/tracks/cpp/exercises/prime-factors/iterations"}},{"uuid":"d24edd9f4dd14267a45e9b24fe9a0470","snippet":"namespace prime_factors { std::vector of(int number) { std::vector factors {}; int factor = 2; while(number>1) { if (number%factor == 0) { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":3,"num_iterations":1,"num_loc":28,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-05-01T10:06:27.000Z","is_out_of_date":false,"language":"cpp","author":{"handle":"phi-rus"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"C++","icon_url":"https://assets.exercism.org/tracks/cpp.svg","highlightjs_language":"cpp"},"links":{"public_url":"https://exercism.org/uk/tracks/cpp/exercises/prime-factors/solutions/phi-rus","private_iterations_url":"https://exercism.org/uk/tracks/cpp/exercises/prime-factors/iterations"}},{"uuid":"4c481ec043664b2892c7323339c126ad","snippet":"namespace prime_factors { std::vector of(int n); } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":3,"num_loc":22,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2020-12-28T06:06:09.000Z","is_out_of_date":false,"language":"cpp","author":{"handle":"radha-8784"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"C++","icon_url":"https://assets.exercism.org/tracks/cpp.svg","highlightjs_language":"cpp"},"links":{"public_url":"https://exercism.org/uk/tracks/cpp/exercises/prime-factors/solutions/radha-8784","private_iterations_url":"https://exercism.org/uk/tracks/cpp/exercises/prime-factors/iterations"}},{"uuid":"0885405d47fc49bfb44947a81dfe7b84","snippet":"namespace prime_factors { std::vector of(long long n) { std::vector results; for (long long divisor = 2; divisor * divisor <= n; divisor++) { while (n % divisor == 0) { results.emplace_back(divisor); n /= divisor; } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":2,"num_loc":21,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2026-02-02T15:37:16.000Z","is_out_of_date":false,"language":"cpp","author":{"handle":"Jake-Boraman"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"C++","icon_url":"https://assets.exercism.org/tracks/cpp.svg","highlightjs_language":"cpp"},"links":{"public_url":"https://exercism.org/uk/tracks/cpp/exercises/prime-factors/solutions/Jake-Boraman","private_iterations_url":"https://exercism.org/uk/tracks/cpp/exercises/prime-factors/iterations"}},{"uuid":"13802e1f06d54774984c6dcefceb6382","snippet":"namespace prime_factors { std::vector of(long long n) { std::vector factors; long long divisor = 2; while (n > 1) { while (n % divisor == 0) { factors.push_back(divisor); n /= divisor; } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":22,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-05-08T23:01:52.000Z","is_out_of_date":false,"language":"cpp","author":{"handle":"GreatestLA"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"C++","icon_url":"https://assets.exercism.org/tracks/cpp.svg","highlightjs_language":"cpp"},"links":{"public_url":"https://exercism.org/uk/tracks/cpp/exercises/prime-factors/solutions/GreatestLA","private_iterations_url":"https://exercism.org/uk/tracks/cpp/exercises/prime-factors/iterations"}},{"uuid":"7890cdfd1c1444caa1a901ee3b8ce8ab","snippet":"namespace prime_factors { std::vector of(int n) { std::vector factors; for (int i = 2; i <= n; i++) { while (n % i == 0) { factors.push_back(i); n /= i; } } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":21,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-03-01T10:32:32.000Z","is_out_of_date":false,"language":"cpp","author":{"handle":"Rishitha-Nagineni"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"C++","icon_url":"https://assets.exercism.org/tracks/cpp.svg","highlightjs_language":"cpp"},"links":{"public_url":"https://exercism.org/uk/tracks/cpp/exercises/prime-factors/solutions/Rishitha-Nagineni","private_iterations_url":"https://exercism.org/uk/tracks/cpp/exercises/prime-factors/iterations"}},{"uuid":"4e5b0d0177ab45f7a38a6457116bed10","snippet":"namespace prime_factors { std::vector of(int n) { std::vector factors{}; while (n != 1) { for (int i{2}; i <= n; ++i) { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":28,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-04-24T19:12:22.000Z","is_out_of_date":false,"language":"cpp","author":{"handle":"vaeng"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"C++","icon_url":"https://assets.exercism.org/tracks/cpp.svg","highlightjs_language":"cpp"},"links":{"public_url":"https://exercism.org/uk/tracks/cpp/exercises/prime-factors/solutions/vaeng","private_iterations_url":"https://exercism.org/uk/tracks/cpp/exercises/prime-factors/iterations"}},{"uuid":"edd65953aaf444b995dcacfabcd0ebd6","snippet":"vector prime_factors::of(int val) { vector ret; int div = 2; while(val > 1) { if(val % div == 0) { ret.push_back(div); ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":28,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2018-07-13T10:01:29.000Z","is_out_of_date":false,"language":"cpp","author":{"handle":"nkamkheaw"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"C++","icon_url":"https://assets.exercism.org/tracks/cpp.svg","highlightjs_language":"cpp"},"links":{"public_url":"https://exercism.org/uk/tracks/cpp/exercises/prime-factors/solutions/nkamkheaw","private_iterations_url":"https://exercism.org/uk/tracks/cpp/exercises/prime-factors/iterations"}},{"uuid":"ac0b48bbcf564adba14c3077bc4a2272","snippet":"namespace prime_factors { std::vector of(int target) { std::vector res; int prime = 2; while (target != 1) { while (target % prime == 0) { res.push_back(prime); target /= prime; } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":22,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2019-12-04T06:10:23.000Z","is_out_of_date":false,"language":"cpp","author":{"handle":"horacexd"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"C++","icon_url":"https://assets.exercism.org/tracks/cpp.svg","highlightjs_language":"cpp"},"links":{"public_url":"https://exercism.org/uk/tracks/cpp/exercises/prime-factors/solutions/horacexd","private_iterations_url":"https://exercism.org/uk/tracks/cpp/exercises/prime-factors/iterations"}},{"uuid":"35d790c6a8c64968bfd5b69767f038b5","snippet":"namespace prime_factors { std::vector of(int input_number){ std::vector prime_factors{}; for(int num = 2; num <= input_number; num++){ while(input_number % num == 0){ prime_factors.push_back(num); input_number /= num; } } return prime_factors; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":20,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-01-07T08:30:26.000Z","is_out_of_date":false,"language":"cpp","author":{"handle":"skan1205"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"C++","icon_url":"https://assets.exercism.org/tracks/cpp.svg","highlightjs_language":"cpp"},"links":{"public_url":"https://exercism.org/uk/tracks/cpp/exercises/prime-factors/solutions/skan1205","private_iterations_url":"https://exercism.org/uk/tracks/cpp/exercises/prime-factors/iterations"}},{"uuid":"eec9dc01eba847bbbecef116b411c37f","snippet":"namespace prime_factors { std::vector of(int); } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":2,"num_loc":20,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-11-27T07:13:17.000Z","is_out_of_date":false,"language":"cpp","author":{"handle":"asurazur"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"C++","icon_url":"https://assets.exercism.org/tracks/cpp.svg","highlightjs_language":"cpp"},"links":{"public_url":"https://exercism.org/uk/tracks/cpp/exercises/prime-factors/solutions/asurazur","private_iterations_url":"https://exercism.org/uk/tracks/cpp/exercises/prime-factors/iterations"}},{"uuid":"b8a54a44c78d41ccbcbfa950978bf6ff","snippet":"namespace prime_factors { std::vector of(long long n) { std::vector factors; long long divisor = 2; while (n > 1) { if (n % divisor == 0) { factors.push_back(divisor); n /= divisor; } else { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":21,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-06-15T17:50:30.000Z","is_out_of_date":false,"language":"cpp","author":{"handle":"kindly-framing"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"C++","icon_url":"https://assets.exercism.org/tracks/cpp.svg","highlightjs_language":"cpp"},"links":{"public_url":"https://exercism.org/uk/tracks/cpp/exercises/prime-factors/solutions/kindly-framing","private_iterations_url":"https://exercism.org/uk/tracks/cpp/exercises/prime-factors/iterations"}},{"uuid":"99b44cfd9a1c4e519df0c8b5912b05cf","snippet":"namespace prime_factors { std::vector of(long long n) { std::vector r; long long i = 2; while (n > 1) { if (n % i == 0) { n /= i; r.push_back(i); } else { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":24,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-11-15T22:27:53.000Z","is_out_of_date":false,"language":"cpp","author":{"handle":"alexhausen"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"C++","icon_url":"https://assets.exercism.org/tracks/cpp.svg","highlightjs_language":"cpp"},"links":{"public_url":"https://exercism.org/uk/tracks/cpp/exercises/prime-factors/solutions/alexhausen","private_iterations_url":"https://exercism.org/uk/tracks/cpp/exercises/prime-factors/iterations"}}],"meta":{"current_page":1,"total_count":1028,"total_pages":43,"unscoped_total":1028}}}}}

Мовні треки

Вчимося програмувати з Jiki

Подорож

ОбранеНове

Переваги Exercism

Відео спільноти

Серія коротких вступів

Інтервʼю та історії

Discord

Форум

З чого почати

Наставництво

Документація

Учасники

ПерекладачіНове

Пожертвувати

Про Exercism

Наш вплив

Синхронізатор GitHubНове

Інсайдери