{"request":{"endpoint":"https://exercism.org/api/v2/tracks/java/exercises/prime-factors/community_solutions","query":{},"options":{"initial_data":{"results":[{"uuid":"4d31cbfab75f4314b91671bb929858c8","snippet":"class PrimeFactorsCalculator { List calculatePrimeFactorsOf(long number) { List factors = new ArrayList<>(); long candidate = 2; while (number > 1) { while (number % candidate == 0) { factors.add(candidate); number /= candidate; } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":9,"num_iterations":1,"num_loc":16,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-09-19T03:55:17.000Z","is_out_of_date":false,"language":"java","author":{"handle":"dangtantaibk"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Java","icon_url":"https://assets.exercism.org/tracks/java.svg","highlightjs_language":"java"},"links":{"public_url":"https://exercism.org/uk/tracks/java/exercises/prime-factors/solutions/dangtantaibk","private_iterations_url":"https://exercism.org/uk/tracks/java/exercises/prime-factors/iterations"}},{"uuid":"d805ae722fb94fd9b46c94b975794634","snippet":"class PrimeFactorsCalculator { List calculatePrimeFactorsOf(long number) { List factors = new ArrayList<>(); while (number % 2 == 0) { factors.add(2L); number /= 2; } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":7,"num_iterations":1,"num_loc":21,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-03-03T05:44:56.000Z","is_out_of_date":false,"language":"java","author":{"handle":"MAGG0059"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Java","icon_url":"https://assets.exercism.org/tracks/java.svg","highlightjs_language":"java"},"links":{"public_url":"https://exercism.org/uk/tracks/java/exercises/prime-factors/solutions/MAGG0059","private_iterations_url":"https://exercism.org/uk/tracks/java/exercises/prime-factors/iterations"}},{"uuid":"845fb6bfa7234dc990ce3ff8471de41e","snippet":"public class PrimeFactorsCalculator { public List calculatePrimeFactorsOf(long input) { List list = new ArrayList<>(); long i = 2; while (i <= input) { if (input % i == 0) { list.add(i); input = input / i; } else { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":6,"num_iterations":1,"num_loc":17,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-06-25T13:51:21.000Z","is_out_of_date":false,"language":"java","author":{"handle":"khraina"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Java","icon_url":"https://assets.exercism.org/tracks/java.svg","highlightjs_language":"java"},"links":{"public_url":"https://exercism.org/uk/tracks/java/exercises/prime-factors/solutions/khraina","private_iterations_url":"https://exercism.org/uk/tracks/java/exercises/prime-factors/iterations"}},{"uuid":"550f8991ab034cb9a05d23b748676d1c","snippet":"public class PrimeFactorsCalculator { public List calculatePrimeFactorsOf(long input) { List list = new ArrayList<>(); long i = 2; while (i <= input) { if (input % i == 0) { list.add(i); input = input / i; } else { ","num_views":0,"num_stars":1,"num_comments":0,"representation_num_published_solutions":6,"num_iterations":1,"num_loc":17,"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":"java","author":{"handle":"binupaul"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Java","icon_url":"https://assets.exercism.org/tracks/java.svg","highlightjs_language":"java"},"links":{"public_url":"https://exercism.org/uk/tracks/java/exercises/prime-factors/solutions/binupaul","private_iterations_url":"https://exercism.org/uk/tracks/java/exercises/prime-factors/iterations"}},{"uuid":"a3445116cbdd4f8ca64152d346a5043e","snippet":"class PrimeFactorsCalculator { List calculatePrimeFactorsOf(long number) { List primes = new ArrayList<>(); for (long i = 2; i * i <= number; i++) { while (number % i == 0) { primes.add(i); number /= i; } } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":5,"num_iterations":1,"num_loc":17,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-09-05T20:52:06.000Z","is_out_of_date":false,"language":"java","author":{"handle":"ninjadragonliu"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Java","icon_url":"https://assets.exercism.org/tracks/java.svg","highlightjs_language":"java"},"links":{"public_url":"https://exercism.org/uk/tracks/java/exercises/prime-factors/solutions/ninjadragonliu","private_iterations_url":"https://exercism.org/uk/tracks/java/exercises/prime-factors/iterations"}},{"uuid":"ba61a7a80b7040f38a8ce171441482a1","snippet":"class PrimeFactorsCalculator { List calculatePrimeFactorsOf(long number) { List primes = new ArrayList(); long prime = 2; while (number >= prime) { if (number % prime == 0) { primes.add(prime); number /= prime; } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":4,"num_iterations":1,"num_loc":17,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-11-19T20:45:08.000Z","is_out_of_date":false,"language":"java","author":{"handle":"KarinB"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Java","icon_url":"https://assets.exercism.org/tracks/java.svg","highlightjs_language":"java"},"links":{"public_url":"https://exercism.org/uk/tracks/java/exercises/prime-factors/solutions/KarinB","private_iterations_url":"https://exercism.org/uk/tracks/java/exercises/prime-factors/iterations"}},{"uuid":"8387e1da62a14c72a4759a073aa2db94","snippet":"public class PrimeFactorsCalculator { public List calculatePrimeFactorsOf(Long num) { final List retval = new ArrayList<>(); long factor = 2; while (factor <= num && num > 1) { if (num % factor == 0) { retval.add(factor); num /= factor; factor = 2; } else { ","num_views":0,"num_stars":1,"num_comments":1,"representation_num_published_solutions":4,"num_iterations":1,"num_loc":18,"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":"java","author":{"handle":"kingjon3377"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Java","icon_url":"https://assets.exercism.org/tracks/java.svg","highlightjs_language":"java"},"links":{"public_url":"https://exercism.org/uk/tracks/java/exercises/prime-factors/solutions/kingjon3377","private_iterations_url":"https://exercism.org/uk/tracks/java/exercises/prime-factors/iterations"}},{"uuid":"f204c3fecbca4554b4da4eec0631c455","snippet":"public class PrimeFactorsCalculator { public List calculatePrimeFactorsOf(long input) { List resultList = new ArrayList<>(); for (long i = 2; i <= input; i++) { if (input % i == 0) { input = input / i; resultList.add(i); i = 1; ","num_views":0,"num_stars":1,"num_comments":2,"representation_num_published_solutions":3,"num_iterations":1,"num_loc":15,"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":"java","author":{"handle":"kyxap"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Java","icon_url":"https://assets.exercism.org/tracks/java.svg","highlightjs_language":"java"},"links":{"public_url":"https://exercism.org/uk/tracks/java/exercises/prime-factors/solutions/kyxap","private_iterations_url":"https://exercism.org/uk/tracks/java/exercises/prime-factors/iterations"}},{"uuid":"4dc87f69d5eb42d2b7505a4b1e106662","snippet":"class PrimeFactorsCalculator { List calculatePrimeFactorsOf( long number ) { List factors = new ArrayList<>(); long h = 2; while ( number > 1 ) { if ( number % h == 0 ) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":3,"num_iterations":1,"num_loc":23,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-06-06T14:41:49.000Z","is_out_of_date":false,"language":"java","author":{"handle":"schlote"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Java","icon_url":"https://assets.exercism.org/tracks/java.svg","highlightjs_language":"java"},"links":{"public_url":"https://exercism.org/uk/tracks/java/exercises/prime-factors/solutions/schlote","private_iterations_url":"https://exercism.org/uk/tracks/java/exercises/prime-factors/iterations"}},{"uuid":"4f33c789a6e542beaa59995d74b791f2","snippet":"class PrimeFactorsCalculator { List calculatePrimeFactorsOf(long number) { List primeFactorisation = new ArrayList<>(); long i = 2; while (i <= number) { if (number % i == 0) { primeFactorisation.add(i); number /= i; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":3,"num_iterations":3,"num_loc":17,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-01-29T01:04:06.000Z","is_out_of_date":false,"language":"java","author":{"handle":"akmaekki7"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Java","icon_url":"https://assets.exercism.org/tracks/java.svg","highlightjs_language":"java"},"links":{"public_url":"https://exercism.org/uk/tracks/java/exercises/prime-factors/solutions/akmaekki7","private_iterations_url":"https://exercism.org/uk/tracks/java/exercises/prime-factors/iterations"}},{"uuid":"0a395257ecc9492da26271beae87b587","snippet":"public class PrimeFactorsCalculator { public List calculatePrimeFactorsOf(long j) { List result = new ArrayList(); for (long i = 2; i <= j; i++) while (j % i == 0 && j > 1) { result.add(i); j /= i; } return result; } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":7,"num_loc":13,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2019-08-16T19:28:54.000Z","is_out_of_date":false,"language":"java","author":{"handle":"oneillb"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Java","icon_url":"https://assets.exercism.org/tracks/java.svg","highlightjs_language":"java"},"links":{"public_url":"https://exercism.org/uk/tracks/java/exercises/prime-factors/solutions/oneillb","private_iterations_url":"https://exercism.org/uk/tracks/java/exercises/prime-factors/iterations"}},{"uuid":"12f75ec0e5824e50bd66526046de8ff5","snippet":"class PrimeFactorsCalculator { List calculatePrimeFactorsOf(long number) { List result = new ArrayList<>(); long divisor = 2L; while (number > 1) { if (number % divisor == 0) { result.add(divisor); number /= divisor; } else { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":17,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-08-15T14:38:59.000Z","is_out_of_date":false,"language":"java","author":{"handle":"tsedekey"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Java","icon_url":"https://assets.exercism.org/tracks/java.svg","highlightjs_language":"java"},"links":{"public_url":"https://exercism.org/uk/tracks/java/exercises/prime-factors/solutions/tsedekey","private_iterations_url":"https://exercism.org/uk/tracks/java/exercises/prime-factors/iterations"}},{"uuid":"d30edc5f2cb74e00a859f4691a8bdf01","snippet":"class PrimeFactorsCalculator { List calculatePrimeFactorsOf(Long num) { List factors = new ArrayList<>(); long i = 2L; while ( num!=1L) { if (isPrime(i) && num % i == 0 ) { factors.add(i); num=num/i; }else{ ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":25,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-03-10T12:44:04.000Z","is_out_of_date":false,"language":"java","author":{"handle":"laajila"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Java","icon_url":"https://assets.exercism.org/tracks/java.svg","highlightjs_language":"java"},"links":{"public_url":"https://exercism.org/uk/tracks/java/exercises/prime-factors/solutions/laajila","private_iterations_url":"https://exercism.org/uk/tracks/java/exercises/prime-factors/iterations"}},{"uuid":"6aa2ea887b2844f89fe29730af6b6dba","snippet":"class PrimeFactorsCalculator { List calculatePrimeFactorsOf(long number) { List listResult = new ArrayList<>(); if(number < 2L) return listResult; if (number == 2L) { listResult.add(number); return listResult;} long i = 2L; while(number >=i){ if(number % i ==0){ ","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":"errored","published_at":"2024-01-08T15:29:49.000Z","is_out_of_date":true,"language":"java","author":{"handle":"sumith1234"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Java","icon_url":"https://assets.exercism.org/tracks/java.svg","highlightjs_language":"java"},"links":{"public_url":"https://exercism.org/uk/tracks/java/exercises/prime-factors/solutions/sumith1234","private_iterations_url":"https://exercism.org/uk/tracks/java/exercises/prime-factors/iterations"}},{"uuid":"61e7df98fbea4d52852b28c757e1528d","snippet":"public class PrimeFactorsCalculator { public List calculatePrimeFactorsOf(long number) { List primes = new ArrayList<>(); long divisor = 2; while (number > 1) { while (number % divisor == 0) { primes.add(divisor); number /= divisor; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":16,"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":"java","author":{"handle":"priyamkhare"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Java","icon_url":"https://assets.exercism.org/tracks/java.svg","highlightjs_language":"java"},"links":{"public_url":"https://exercism.org/uk/tracks/java/exercises/prime-factors/solutions/priyamkhare","private_iterations_url":"https://exercism.org/uk/tracks/java/exercises/prime-factors/iterations"}},{"uuid":"e06aac8942c04892835b7f964c30405f","snippet":"class PrimeFactorsCalculator { List calculatePrimeFactorsOf(long number) { List factors = new ArrayList<>(); long prime = 2; while (number > 1) { if (number % prime == 0) { number /= prime; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":2,"num_loc":16,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-03-28T12:50:42.000Z","is_out_of_date":false,"language":"java","author":{"handle":"qeeqez"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Java","icon_url":"https://assets.exercism.org/tracks/java.svg","highlightjs_language":"java"},"links":{"public_url":"https://exercism.org/uk/tracks/java/exercises/prime-factors/solutions/qeeqez","private_iterations_url":"https://exercism.org/uk/tracks/java/exercises/prime-factors/iterations"}},{"uuid":"2abbc5d3ea12495885064f217d9a0b9f","snippet":"class PrimeFactorsCalculator { List calculatePrimeFactorsOf(long number) { List result = new ArrayList<>(); if (number == 1) return result; long i = 2; while (i <= (long) Math.sqrt(number)) { if (number % i == 0) { result.add(i); number /= i; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":2,"num_loc":16,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-03-14T18:40:46.000Z","is_out_of_date":false,"language":"java","author":{"handle":"NamuChon"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Java","icon_url":"https://assets.exercism.org/tracks/java.svg","highlightjs_language":"java"},"links":{"public_url":"https://exercism.org/uk/tracks/java/exercises/prime-factors/solutions/NamuChon","private_iterations_url":"https://exercism.org/uk/tracks/java/exercises/prime-factors/iterations"}},{"uuid":"67908ccfe1564ede92b8e3bb77fd67ff","snippet":"class PrimeFactorsCalculator{ List calculatePrimeFactorsOf(long input){ List factors = new LinkedList<>(); long factor=2; while(input > 1){ while(input % factor == 0){ ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":16,"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":"java","author":{"handle":"newCoder"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Java","icon_url":"https://assets.exercism.org/tracks/java.svg","highlightjs_language":"java"},"links":{"public_url":"https://exercism.org/uk/tracks/java/exercises/prime-factors/solutions/newCoder","private_iterations_url":"https://exercism.org/uk/tracks/java/exercises/prime-factors/iterations"}},{"uuid":"081a23a30aee44698d4906daebd5169e","snippet":"class PrimeFactorsCalculator { ArrayList calculatePrimeFactorsOf(long number) { ArrayList primeFactors = new ArrayList<>(); for (long divisor = 2; number > 1; divisor++) for (;number % divisor == 0; number /= divisor) primeFactors.add(divisor); return primeFactors; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":8,"num_loc":9,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-05-08T21:46:27.000Z","is_out_of_date":false,"language":"java","author":{"handle":"xGuix"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Java","icon_url":"https://assets.exercism.org/tracks/java.svg","highlightjs_language":"java"},"links":{"public_url":"https://exercism.org/uk/tracks/java/exercises/prime-factors/solutions/xGuix","private_iterations_url":"https://exercism.org/uk/tracks/java/exercises/prime-factors/iterations"}},{"uuid":"dbbc4df5d9ff418bb98650d2c02d1549","snippet":"public class PrimeFactorsCalculator { public List calculatePrimeFactorsOf(long number) { List factors = new ArrayList<>(); long divisor = 2; while (number > 1) { while (number % divisor == 0) { factors.add(divisor); number /= divisor; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":16,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2026-07-25T06:44:20.000Z","is_out_of_date":false,"language":"java","author":{"handle":"DHARSHININ02"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Java","icon_url":"https://assets.exercism.org/tracks/java.svg","highlightjs_language":"java"},"links":{"public_url":"https://exercism.org/uk/tracks/java/exercises/prime-factors/solutions/DHARSHININ02","private_iterations_url":"https://exercism.org/uk/tracks/java/exercises/prime-factors/iterations"}},{"uuid":"069e07defe7d42b7aba8e462ece1725a","snippet":"public class PrimeFactorsCalculator { List calculatePrimeFactorsOf(long num) { List result = new ArrayList<>(); for (long i = 2; i <= num; i++) { while (num % i == 0) { result.add(i); num /= i; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":14,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2019-04-28T14:04:59.000Z","is_out_of_date":false,"language":"java","author":{"handle":"MrGarri"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Java","icon_url":"https://assets.exercism.org/tracks/java.svg","highlightjs_language":"java"},"links":{"public_url":"https://exercism.org/uk/tracks/java/exercises/prime-factors/solutions/MrGarri","private_iterations_url":"https://exercism.org/uk/tracks/java/exercises/prime-factors/iterations"}},{"uuid":"bccd34f752cd461997dff15f304b1319","snippet":"public class PrimeFactorsCalculator { public List calculatePrimeFactorsOf( Long number ) { List factors = new ArrayList<>(); for ( Long i = 2L; i <= number; i++ ) { while ( number % i == 0 ) { factors.add( i ); number /= i; } } return factors; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":14,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-12-20T17:56:56.000Z","is_out_of_date":false,"language":"java","author":{"handle":"yenugukeerthana"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Java","icon_url":"https://assets.exercism.org/tracks/java.svg","highlightjs_language":"java"},"links":{"public_url":"https://exercism.org/uk/tracks/java/exercises/prime-factors/solutions/yenugukeerthana","private_iterations_url":"https://exercism.org/uk/tracks/java/exercises/prime-factors/iterations"}},{"uuid":"be339a2584d74cb0915942c0386b185c","snippet":"public class PrimeFactorsCalculator { List calculatePrimeFactorsOf(long number) { Long factor = 2L; List primeFactors = new ArrayList<>(); while(number > 1) { if((number % factor) == 0) { primeFactors.add(factor); number /= factor; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":17,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2019-07-21T09:22:50.000Z","is_out_of_date":false,"language":"java","author":{"handle":"AdrJan"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Java","icon_url":"https://assets.exercism.org/tracks/java.svg","highlightjs_language":"java"},"links":{"public_url":"https://exercism.org/uk/tracks/java/exercises/prime-factors/solutions/AdrJan","private_iterations_url":"https://exercism.org/uk/tracks/java/exercises/prime-factors/iterations"}},{"uuid":"58d1eae6ab42463eb89a7e491a410d36","snippet":"public class PrimeFactorsCalculator { public List calculatePrimeFactorsOf(long input) { List list = new ArrayList<>(); long i = 2; while (i <= input) { if (input % i == 0) { list.add(i); input = input / i; } else { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":17,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-02-14T18:13:16.000Z","is_out_of_date":false,"language":"java","author":{"handle":"AGENTCANDY"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Java","icon_url":"https://assets.exercism.org/tracks/java.svg","highlightjs_language":"java"},"links":{"public_url":"https://exercism.org/uk/tracks/java/exercises/prime-factors/solutions/AGENTCANDY","private_iterations_url":"https://exercism.org/uk/tracks/java/exercises/prime-factors/iterations"}}],"meta":{"current_page":1,"total_count":339,"total_pages":15,"unscoped_total":339}}}}}

Мовні треки

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

Подорож

ОбранеНове

Переваги Exercism

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

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

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

Discord

Форум

З чого почати

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

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

Учасники

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

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

Про Exercism

Наш вплив

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

Інсайдери