{"request":{"endpoint":"https://exercism.org/api/v2/tracks/gleam/exercises/prime-factors/community_solutions","query":{},"options":{"initial_data":{"results":[{"uuid":"b7f1b781066f49529018ed17122b469e","snippet":"pub fn factors(value: Int) -> List(Int) { do_factors(value, 2, []) } fn do_factors(value: Int, factor: Int, factors: List(Int)) -> List(Int) { case value { 1 -> list.reverse(factors) n if n < 1 -> panic _ -> case value % factor == 0 { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":3,"num_iterations":2,"num_loc":15,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-06-16T03:06:26.000Z","is_out_of_date":false,"language":"gleam","author":{"handle":"shello"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Gleam","icon_url":"https://assets.exercism.org/tracks/gleam.svg","highlightjs_language":"gleam"},"links":{"public_url":"https://exercism.org/uk/tracks/gleam/exercises/prime-factors/solutions/shello","private_iterations_url":"https://exercism.org/uk/tracks/gleam/exercises/prime-factors/iterations"}},{"uuid":"6e6db76b33bb42c9b25695559b8fe8a7","snippet":"pub fn factors(value: Int) -> List(Int) { case value { 1 -> [] n -> do_factors(n, 2, []) } } fn do_factors(n: Int, divisor: Int, acc: List(Int)) -> List(Int) { case n { 1 -> list.reverse(acc) ","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":"2024-11-10T10:13:50.000Z","is_out_of_date":false,"language":"gleam","author":{"handle":"david82"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Gleam","icon_url":"https://assets.exercism.org/tracks/gleam.svg","highlightjs_language":"gleam"},"links":{"public_url":"https://exercism.org/uk/tracks/gleam/exercises/prime-factors/solutions/david82","private_iterations_url":"https://exercism.org/uk/tracks/gleam/exercises/prime-factors/iterations"}},{"uuid":"62539370bc4f4589b4b80d222dbd5864","snippet":"pub fn factors(value: Int) -> List(Int) { use <- guard(when: value <= 1, return: []) do_factoring(value, 2, []) } fn do_factoring(value: Int, guess: Int, factors: List(Int)) -> List(Int) { case value { 1 -> list.reverse(factors) _ -> case value % guess { n if n > 0 -> do_factoring(value, guess + 1, factors) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":16,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-05-13T01:25:50.000Z","is_out_of_date":false,"language":"gleam","author":{"handle":"ignad-vandersnatch"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Gleam","icon_url":"https://assets.exercism.org/tracks/gleam.svg","highlightjs_language":"gleam"},"links":{"public_url":"https://exercism.org/uk/tracks/gleam/exercises/prime-factors/solutions/ignad-vandersnatch","private_iterations_url":"https://exercism.org/uk/tracks/gleam/exercises/prime-factors/iterations"}},{"uuid":"95fdabc2f85a4b39bf24b1137aa0dabc","snippet":"pub fn factors(value: Int) -> List(Int) { case Nil { _ if value < 2 -> [] _ -> get_factors(value, 2, []) } } fn get_factors(divident: Int, divisor: Int, factors: List(Int)) -> List(Int) { case divisor == divident { True -> [divisor, ..factors] |> list.reverse() ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":17,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-08-09T17:21:40.000Z","is_out_of_date":false,"language":"gleam","author":{"handle":"mustafa-shahriar"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Gleam","icon_url":"https://assets.exercism.org/tracks/gleam.svg","highlightjs_language":"gleam"},"links":{"public_url":"https://exercism.org/uk/tracks/gleam/exercises/prime-factors/solutions/mustafa-shahriar","private_iterations_url":"https://exercism.org/uk/tracks/gleam/exercises/prime-factors/iterations"}},{"uuid":"f7fd892a625a4197946d900e753d4c43","snippet":"fn do_factors(number: Int, divisor: Int, acc: List(Int)) -> List(Int) { case divisor { _ if number % divisor == 0 -> do_factors(number / divisor, divisor, [divisor, ..acc]) _ if divisor * divisor <= number -> do_factors(number, divisor + 1, acc) _ if number > 1 -> [number, ..acc] _ -> acc } } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":13,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-01-03T05:27:22.000Z","is_out_of_date":false,"language":"gleam","author":{"handle":"puzzlemoondev"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Gleam","icon_url":"https://assets.exercism.org/tracks/gleam.svg","highlightjs_language":"gleam"},"links":{"public_url":"https://exercism.org/uk/tracks/gleam/exercises/prime-factors/solutions/puzzlemoondev","private_iterations_url":"https://exercism.org/uk/tracks/gleam/exercises/prime-factors/iterations"}},{"uuid":"247dc5c1693748948ed84742a5f343ec","snippet":"pub fn factors(value: Int) -> List(Int) { factors_iter(value, 2, []) } fn factors_iter(n: Int, i: Int, factors: List(Int)) -> List(Int) { case n, n % i { 1, _ -> list.reverse(factors) _, 0 -> factors_iter(n / i, i, [i, ..factors]) _, _ -> factors_iter(n, i + 1, factors) } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":3,"num_loc":11,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-11-11T09:54:43.000Z","is_out_of_date":false,"language":"gleam","author":{"handle":"joaofnds"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Gleam","icon_url":"https://assets.exercism.org/tracks/gleam.svg","highlightjs_language":"gleam"},"links":{"public_url":"https://exercism.org/uk/tracks/gleam/exercises/prime-factors/solutions/joaofnds","private_iterations_url":"https://exercism.org/uk/tracks/gleam/exercises/prime-factors/iterations"}},{"uuid":"d60f650efa7647189aab7d269165d440","snippet":"pub fn factors(value: Int) -> List(Int) { do_factors(value, 2, []) } fn do_factors(value: Int, factor: Int, prime_factors: List(Int)) -> List(Int) { case value { 0 -> panic _ if value < 0 -> panic 1 -> list.reverse(prime_factors) _ if value % factor == 0 -> do_factors(value / factor, factor, [factor, ..prime_factors]) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":13,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-12-26T23:53:49.000Z","is_out_of_date":false,"language":"gleam","author":{"handle":"jwcranford"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Gleam","icon_url":"https://assets.exercism.org/tracks/gleam.svg","highlightjs_language":"gleam"},"links":{"public_url":"https://exercism.org/uk/tracks/gleam/exercises/prime-factors/solutions/jwcranford","private_iterations_url":"https://exercism.org/uk/tracks/gleam/exercises/prime-factors/iterations"}},{"uuid":"6e6cd6039305498db768d8231e36baa7","snippet":"pub fn factors(value: Int) -> List(Int) { do_factors(value, 2, []) } fn do_factors(value: Int, current: Int, acc: List(Int)) -> List(Int) { case value, value % current { 1, _ -> list.reverse(acc) value, 0 -> do_factors(value / current, current, [current, ..acc]) value, _ -> do_factors(value, current + 1, acc) } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":11,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-10-13T11:45:32.000Z","is_out_of_date":false,"language":"gleam","author":{"handle":"D4n13le"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Gleam","icon_url":"https://assets.exercism.org/tracks/gleam.svg","highlightjs_language":"gleam"},"links":{"public_url":"https://exercism.org/uk/tracks/gleam/exercises/prime-factors/solutions/D4n13le","private_iterations_url":"https://exercism.org/uk/tracks/gleam/exercises/prime-factors/iterations"}},{"uuid":"44dbbbd7775a4c19a50da632972204c2","snippet":"pub fn loop(remain: Int, from factor: Int, init result: List(Int)) -> List(Int) { use <- bool.guard(remain == 1, []) use <- bool.guard(factor * factor > remain, [remain, ..result]) use <- bool.guard(remain % factor != 0, loop(remain, factor + 1, result)) loop(remain / factor, factor, [factor, ..result]) } pub fn factors(value: Int) -> List(Int) { value |> loop(from: 2, init: []) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":3,"num_loc":13,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-04-01T04:18:31.000Z","is_out_of_date":false,"language":"gleam","author":{"handle":"sweatyeyelids"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Gleam","icon_url":"https://assets.exercism.org/tracks/gleam.svg","highlightjs_language":"gleam"},"links":{"public_url":"https://exercism.org/uk/tracks/gleam/exercises/prime-factors/solutions/sweatyeyelids","private_iterations_url":"https://exercism.org/uk/tracks/gleam/exercises/prime-factors/iterations"}},{"uuid":"ff3ef19d20494d89bab153f32023f201","snippet":"pub fn factors(value: Int) -> List(Int) { find_factors(value, 2, []) } fn find_factors(value: Int, prime: Int, factors: List(Int)) -> List(Int) { case value, value % prime == 0 { 1, _ -> list.reverse(factors) _, True -> find_factors(value / prime, prime, [prime, ..factors]) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":11,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-03-12T01:16:11.000Z","is_out_of_date":false,"language":"gleam","author":{"handle":"natanaelsirqueira"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Gleam","icon_url":"https://assets.exercism.org/tracks/gleam.svg","highlightjs_language":"gleam"},"links":{"public_url":"https://exercism.org/uk/tracks/gleam/exercises/prime-factors/solutions/natanaelsirqueira","private_iterations_url":"https://exercism.org/uk/tracks/gleam/exercises/prime-factors/iterations"}},{"uuid":"4af5b7eae0c948d69b534621c574288e","snippet":"fn factors_tail(value: Int, factor: Int, acc: List(Int)) { case value % factor { x if x == value -> acc 0 -> factors_tail(value / factor, factor, list.append(acc, [factor])) _ -> factors_tail(value, factor + 1, acc) } } pub fn factors(value: Int) -> List(Int) { factors_tail(value, 2, []) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":11,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-04-16T08:37:26.000Z","is_out_of_date":false,"language":"gleam","author":{"handle":"2-towns"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Gleam","icon_url":"https://assets.exercism.org/tracks/gleam.svg","highlightjs_language":"gleam"},"links":{"public_url":"https://exercism.org/uk/tracks/gleam/exercises/prime-factors/solutions/2-towns","private_iterations_url":"https://exercism.org/uk/tracks/gleam/exercises/prime-factors/iterations"}},{"uuid":"2343f2dd5aa645818f74cee630f76d51","snippet":"pub fn factors(value: Int) -> List(Int) { case value < 2 { True -> [] False -> factors_helper(value, [], 2) } } fn factors_helper(value: Int, acc: List(Int), div: Int) -> List(Int) { case value > 1 { True -> ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":17,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-04-18T03:28:14.000Z","is_out_of_date":false,"language":"gleam","author":{"handle":"mahdi-hm"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Gleam","icon_url":"https://assets.exercism.org/tracks/gleam.svg","highlightjs_language":"gleam"},"links":{"public_url":"https://exercism.org/uk/tracks/gleam/exercises/prime-factors/solutions/mahdi-hm","private_iterations_url":"https://exercism.org/uk/tracks/gleam/exercises/prime-factors/iterations"}},{"uuid":"315cf08e6b394573a03c49037969784a","snippet":"const basis = [2, 3, 5] const wheel = [7, 11, 13, 17, 19, 23, 29, 31] pub fn factors(value: Int) -> List(Int) { case value { 1 -> [] _ -> factors_acc(value, generate_primes(value), []) } } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":51,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-08-24T02:27:46.000Z","is_out_of_date":false,"language":"gleam","author":{"handle":"gcaliber"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Gleam","icon_url":"https://assets.exercism.org/tracks/gleam.svg","highlightjs_language":"gleam"},"links":{"public_url":"https://exercism.org/uk/tracks/gleam/exercises/prime-factors/solutions/gcaliber","private_iterations_url":"https://exercism.org/uk/tracks/gleam/exercises/prime-factors/iterations"}},{"uuid":"f60620bfc0cd4b4f924f14be9ca88d17","snippet":"pub fn factors(value: Int) -> List(Int) { case value < 2 { True -> [] _ -> factors_loop(value, 2, []) |> l.reverse } } fn factors_loop(value: Int, i: Int, acc: List(Int)) -> List(Int) { case value % i == 0, i == 2 { True, True -> factors_loop(value / 2, 2, [2, ..acc]) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":17,"iteration_status":"analyzing","published_iteration_head_tests_status":"passed","published_at":"2025-05-24T02:27:23.000Z","is_out_of_date":false,"language":"gleam","author":{"handle":"zprayz"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Gleam","icon_url":"https://assets.exercism.org/tracks/gleam.svg","highlightjs_language":"gleam"},"links":{"public_url":"https://exercism.org/uk/tracks/gleam/exercises/prime-factors/solutions/zprayz","private_iterations_url":"https://exercism.org/uk/tracks/gleam/exercises/prime-factors/iterations"}},{"uuid":"457d6b4a15e3495f8a2684ec9090462e","snippet":"fn get_lowest_divider(number, divider) { case number % divider { 0 -> divider _ -> get_lowest_divider(number, divider + 1) } } pub fn factors(value: Int) -> List(Int) { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":19,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-03-29T18:04:35.000Z","is_out_of_date":false,"language":"gleam","author":{"handle":"f222"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Gleam","icon_url":"https://assets.exercism.org/tracks/gleam.svg","highlightjs_language":"gleam"},"links":{"public_url":"https://exercism.org/uk/tracks/gleam/exercises/prime-factors/solutions/f222","private_iterations_url":"https://exercism.org/uk/tracks/gleam/exercises/prime-factors/iterations"}},{"uuid":"853bd2cfd8de4632b4ae72276c4b3ad5","snippet":"pub fn factors(value: Int) -> List(Int) { case value { non_positive if non_positive <= 0 -> panic positive -> loop_factors(positive, [2], []) } } fn loop_factors( residual_value: Int, primes: List(Int), ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":39,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2026-06-03T01:59:22.000Z","is_out_of_date":false,"language":"gleam","author":{"handle":"frederickjeanguerin"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Gleam","icon_url":"https://assets.exercism.org/tracks/gleam.svg","highlightjs_language":"gleam"},"links":{"public_url":"https://exercism.org/uk/tracks/gleam/exercises/prime-factors/solutions/frederickjeanguerin","private_iterations_url":"https://exercism.org/uk/tracks/gleam/exercises/prime-factors/iterations"}},{"uuid":"f6a1a209520449df8c71415ce7a6c726","snippet":"pub fn factors(value: Int) -> List(Int) { loop(value, 2, []) |> list.sort(int.compare) } fn loop(value: Int, factor: Int, factors: List(Int)) -> List(Int) { case value % factor == 0 { _ if value == 1 -> factors True -> loop(value / factor, factor, [factor, ..factors]) False -> loop(value, factor + 1, factors) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":13,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2026-09-23T06:44:25.000Z","is_out_of_date":false,"language":"gleam","author":{"handle":"ico-miwaku"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Gleam","icon_url":"https://assets.exercism.org/tracks/gleam.svg","highlightjs_language":"gleam"},"links":{"public_url":"https://exercism.org/uk/tracks/gleam/exercises/prime-factors/solutions/ico-miwaku","private_iterations_url":"https://exercism.org/uk/tracks/gleam/exercises/prime-factors/iterations"}},{"uuid":"2ac4db6dffd541039c802630fa42bc7e","snippet":"pub fn factors(value: Int) -> List(Int) { list.reverse(aux(value,[])) } fn aux(n: Int, fs: List(Int)) -> List(Int) { case list.filter(menores(n-1,[]),fn(x){n%x==0}) { [] -> fs [a, .._] -> aux(n/a, [a, ..fs]) } } fn menores(n: Int, list: List(Int)) -> List(Int) { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":16,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"errored","published_at":"2023-02-17T08:22:08.000Z","is_out_of_date":true,"language":"gleam","author":{"handle":"jssr"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Gleam","icon_url":"https://assets.exercism.org/tracks/gleam.svg","highlightjs_language":"gleam"},"links":{"public_url":"https://exercism.org/uk/tracks/gleam/exercises/prime-factors/solutions/jssr","private_iterations_url":"https://exercism.org/uk/tracks/gleam/exercises/prime-factors/iterations"}},{"uuid":"b2881a48290b43dcb65d5c4f7aedc5df","snippet":"pub fn factors(value: Int) -> List(Int) { case value { v if v == 1 -> [] _ -> { reducer([], 2, value) } } } fn reducer(acc: List(Int), cur: Int, remains: Int) { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":17,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-07-30T06:34:20.000Z","is_out_of_date":false,"language":"gleam","author":{"handle":"sunday00-7320"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Gleam","icon_url":"https://assets.exercism.org/tracks/gleam.svg","highlightjs_language":"gleam"},"links":{"public_url":"https://exercism.org/uk/tracks/gleam/exercises/prime-factors/solutions/sunday00-7320","private_iterations_url":"https://exercism.org/uk/tracks/gleam/exercises/prime-factors/iterations"}},{"uuid":"9a3394020809402381b3c9b889648ee8","snippet":"pub fn f(factor: Int, number: Int) -> List(Int) { case number < factor { True -> [] False -> case number % factor { 0 -> [factor, ..f(factor, number / factor)] _ -> f(factor + 1, number) } } } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":12,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-09-05T06:56:58.000Z","is_out_of_date":false,"language":"gleam","author":{"handle":"sabyabhoi"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Gleam","icon_url":"https://assets.exercism.org/tracks/gleam.svg","highlightjs_language":"gleam"},"links":{"public_url":"https://exercism.org/uk/tracks/gleam/exercises/prime-factors/solutions/sabyabhoi","private_iterations_url":"https://exercism.org/uk/tracks/gleam/exercises/prime-factors/iterations"}},{"uuid":"a6b2dbcc5fff444eb799ef50ea16b828","snippet":"pub fn factors(value: Int) -> List(Int) { rec(value, 2) } fn rec(value: Int, curr: Int) -> List(Int) { case value, value % curr { 1, _ -> [] _, 0 -> [curr, ..rec(value / curr, 2)] _, _ -> rec(value, find_next_prime(curr + 1)) } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":23,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-05-11T10:41:08.000Z","is_out_of_date":false,"language":"gleam","author":{"handle":"ekmbcd"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Gleam","icon_url":"https://assets.exercism.org/tracks/gleam.svg","highlightjs_language":"gleam"},"links":{"public_url":"https://exercism.org/uk/tracks/gleam/exercises/prime-factors/solutions/ekmbcd","private_iterations_url":"https://exercism.org/uk/tracks/gleam/exercises/prime-factors/iterations"}},{"uuid":"75f2380171be4effbf0a393063953df5","snippet":"pub fn factors(value: Int) -> List(Int) { let assert Ok(limit) = int.square_root(value) |> result.map(float.round) do_factors(value, primes_upon_number(limit + 1), []) } fn do_factors(value: Int, candidates: List(Int), acc: List(Int)) -> List(Int) { use <- bool.guard(value == 1, acc) use <- bool.guard(list.is_empty(candidates), { use <- bool.guard(value > 1, list.append(acc, [value])) acc ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":48,"iteration_status":"analyzing","published_iteration_head_tests_status":"errored","published_at":"2024-10-13T06:20:25.000Z","is_out_of_date":true,"language":"gleam","author":{"handle":"xetxeberria"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Gleam","icon_url":"https://assets.exercism.org/tracks/gleam.svg","highlightjs_language":"gleam"},"links":{"public_url":"https://exercism.org/uk/tracks/gleam/exercises/prime-factors/solutions/xetxeberria","private_iterations_url":"https://exercism.org/uk/tracks/gleam/exercises/prime-factors/iterations"}},{"uuid":"0cc07e67d6f84687830ff0e701b850ae","snippet":"fn factors_helper(num: Int, fact: Int) -> List(Int) { case num { 1 -> [] _ -> case num % fact == 0 { True -> [fact, ..factors_helper(num / fact, fact)] _ -> factors_helper(num, fact + 1) } } } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":13,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-10-21T19:09:45.000Z","is_out_of_date":false,"language":"gleam","author":{"handle":"miloandmilk"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Gleam","icon_url":"https://assets.exercism.org/tracks/gleam.svg","highlightjs_language":"gleam"},"links":{"public_url":"https://exercism.org/uk/tracks/gleam/exercises/prime-factors/solutions/miloandmilk","private_iterations_url":"https://exercism.org/uk/tracks/gleam/exercises/prime-factors/iterations"}},{"uuid":"a548f806b8dc4a05977361ff7302585a","snippet":"pub fn factors(value: Int) -> List(Int) { factors_loop(value, 2, []) } fn factors_loop(value: Int, factor: Int, factors: List(Int)) -> List(Int) { case value, value % factor { 1, _ -> list.reverse(factors) _, 0 -> factors_loop(value / factor, factor, [factor, ..factors]) _, _ -> factors_loop(value, factor + factor % 2 + 1, factors) } ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":11,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-12-30T19:37:41.000Z","is_out_of_date":false,"language":"gleam","author":{"handle":"danielbom"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Gleam","icon_url":"https://assets.exercism.org/tracks/gleam.svg","highlightjs_language":"gleam"},"links":{"public_url":"https://exercism.org/uk/tracks/gleam/exercises/prime-factors/solutions/danielbom","private_iterations_url":"https://exercism.org/uk/tracks/gleam/exercises/prime-factors/iterations"}}],"meta":{"current_page":1,"total_count":93,"total_pages":4,"unscoped_total":93}}}}}

Мовні треки

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

Подорож

ОбранеНове

Переваги Exercism

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

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

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

Discord

Форум

З чого почати

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

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

Учасники

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

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

Про Exercism

Наш вплив

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

Інсайдери