{"request":{"endpoint":"https://exercism.org/api/v2/tracks/delphi/exercises/prime-factors/community_solutions","query":{},"options":{"initial_data":{"results":[{"uuid":"927072ce6ca24555b50fa44a9d4ba8aa","snippet":"unit uPrimeFactors; interface uses System.Generics.Collections; type TPrimeFactors = class class function factors(Number: Int64): TArray; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":25,"iteration_status":"untested","published_iteration_head_tests_status":"not_queued","published_at":"2021-07-27T13:57:54.000Z","is_out_of_date":false,"language":"delphi","author":{"handle":"diegosimonini"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Delphi Pascal","icon_url":"https://assets.exercism.org/tracks/delphi.svg","highlightjs_language":"delphi"},"links":{"public_url":"https://exercism.org/uk/tracks/delphi/exercises/prime-factors/solutions/diegosimonini","private_iterations_url":"https://exercism.org/uk/tracks/delphi/exercises/prime-factors/iterations"}},{"uuid":"d76e5a19ec694b36b97a071e6ad7320b","snippet":"unit uPrimeFactors; interface type TPrimeFactors = class class function Factors(AValue:Int64): TArray; end; implementation ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":32,"iteration_status":"untested","published_iteration_head_tests_status":"not_queued","published_at":"2020-01-21T11:43:22.000Z","is_out_of_date":false,"language":"delphi","author":{"handle":"Neftali"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Delphi Pascal","icon_url":"https://assets.exercism.org/tracks/delphi.svg","highlightjs_language":"delphi"},"links":{"public_url":"https://exercism.org/uk/tracks/delphi/exercises/prime-factors/solutions/Neftali","private_iterations_url":"https://exercism.org/uk/tracks/delphi/exercises/prime-factors/iterations"}},{"uuid":"666dadebc6554619b8a83964b732c815","snippet":"unit uPrimeFactors; interface uses System.Generics.Collections, System.Math; type TPrimeFactors = class private ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":46,"iteration_status":"untested","published_iteration_head_tests_status":"not_queued","published_at":"2020-09-04T12:41:50.000Z","is_out_of_date":false,"language":"delphi","author":{"handle":"dgeiger"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Delphi Pascal","icon_url":"https://assets.exercism.org/tracks/delphi.svg","highlightjs_language":"delphi"},"links":{"public_url":"https://exercism.org/uk/tracks/delphi/exercises/prime-factors/solutions/dgeiger","private_iterations_url":"https://exercism.org/uk/tracks/delphi/exercises/prime-factors/iterations"}},{"uuid":"4c04234468fc4f03ba511abd03a873bc","snippet":"unit uPrimeFactors; interface uses sysutils; Type TPrimeFactors= class class Function Factors(ANumber : int64):TArray; end; implementation ","num_views":0,"num_stars":1,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":30,"iteration_status":"untested","published_iteration_head_tests_status":"not_queued","published_at":"2019-01-25T17:00:06.000Z","is_out_of_date":false,"language":"delphi","author":{"handle":"srp77"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Delphi Pascal","icon_url":"https://assets.exercism.org/tracks/delphi.svg","highlightjs_language":"delphi"},"links":{"public_url":"https://exercism.org/uk/tracks/delphi/exercises/prime-factors/solutions/srp77","private_iterations_url":"https://exercism.org/uk/tracks/delphi/exercises/prime-factors/iterations"}},{"uuid":"338d00669a1b4d4392ab8607dd9091be","snippet":"unit uPrimeFactors; interface type TPrimeFactors = class class function factors(Number: Int64): TArray; end; implementation ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":25,"iteration_status":"untested","published_iteration_head_tests_status":"not_queued","published_at":"2019-01-26T12:44:52.000Z","is_out_of_date":false,"language":"delphi","author":{"handle":"mva91"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Delphi Pascal","icon_url":"https://assets.exercism.org/tracks/delphi.svg","highlightjs_language":"delphi"},"links":{"public_url":"https://exercism.org/uk/tracks/delphi/exercises/prime-factors/solutions/mva91","private_iterations_url":"https://exercism.org/uk/tracks/delphi/exercises/prime-factors/iterations"}},{"uuid":"fe5953738b9545848840e06b0e211ac4","snippet":"{**********************************************} { } { uPrimeFactors.pas } { Programmed by Rafael Perez Marin } { 2025-10-16 } { } {**********************************************} unit uPrimeFactors; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":34,"iteration_status":"untested","published_iteration_head_tests_status":"not_queued","published_at":"2025-10-16T12:47:16.000Z","is_out_of_date":false,"language":"delphi","author":{"handle":"rafuchex"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Delphi Pascal","icon_url":"https://assets.exercism.org/tracks/delphi.svg","highlightjs_language":"delphi"},"links":{"public_url":"https://exercism.org/uk/tracks/delphi/exercises/prime-factors/solutions/rafuchex","private_iterations_url":"https://exercism.org/uk/tracks/delphi/exercises/prime-factors/iterations"}},{"uuid":"12da6027d7ed4ad298ed672c771e4d69","snippet":"unit uPrimeFactors; interface Type TPrimeFactors = class class function factors(AValue: Int64): TArray; end; implementation ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":21,"iteration_status":"untested","published_iteration_head_tests_status":"not_queued","published_at":"2021-02-07T18:19:17.000Z","is_out_of_date":false,"language":"delphi","author":{"handle":"Selticq"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Delphi Pascal","icon_url":"https://assets.exercism.org/tracks/delphi.svg","highlightjs_language":"delphi"},"links":{"public_url":"https://exercism.org/uk/tracks/delphi/exercises/prime-factors/solutions/Selticq","private_iterations_url":"https://exercism.org/uk/tracks/delphi/exercises/prime-factors/iterations"}},{"uuid":"fbc8005bdb9e4ee49912e4eed5379a9f","snippet":"unit uPrimeFactors; interface type TPrimeFactors = class class function factors(digit: Int64): TArray; end; implementation ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":3,"num_loc":19,"iteration_status":"untested","published_iteration_head_tests_status":"not_queued","published_at":"2025-09-20T01:59:31.000Z","is_out_of_date":false,"language":"delphi","author":{"handle":"yamat0jp"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Delphi Pascal","icon_url":"https://assets.exercism.org/tracks/delphi.svg","highlightjs_language":"delphi"},"links":{"public_url":"https://exercism.org/uk/tracks/delphi/exercises/prime-factors/solutions/yamat0jp","private_iterations_url":"https://exercism.org/uk/tracks/delphi/exercises/prime-factors/iterations"}},{"uuid":"ca65e66325e247dab6b64c4128430bfc","snippet":"unit uPrimeFactors; interface type TPrimeFactors = class class function Factors(AValue:Int64): TArray; end; implementation ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":32,"iteration_status":"untested","published_iteration_head_tests_status":"not_queued","published_at":"2026-07-07T14:55:31.000Z","is_out_of_date":false,"language":"delphi","author":{"handle":"Rohankapri"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Delphi Pascal","icon_url":"https://assets.exercism.org/tracks/delphi.svg","highlightjs_language":"delphi"},"links":{"public_url":"https://exercism.org/uk/tracks/delphi/exercises/prime-factors/solutions/Rohankapri","private_iterations_url":"https://exercism.org/uk/tracks/delphi/exercises/prime-factors/iterations"}},{"uuid":"d3b2140929e84087bd396e04fc9cad49","snippet":"unit uPrimeFactors; interface uses Generics.Collections; type TPrimeFactors = class public ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":29,"iteration_status":"untested","published_iteration_head_tests_status":"not_queued","published_at":"2022-08-13T20:02:40.000Z","is_out_of_date":false,"language":"delphi","author":{"handle":"bero"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Delphi Pascal","icon_url":"https://assets.exercism.org/tracks/delphi.svg","highlightjs_language":"delphi"},"links":{"public_url":"https://exercism.org/uk/tracks/delphi/exercises/prime-factors/solutions/bero","private_iterations_url":"https://exercism.org/uk/tracks/delphi/exercises/prime-factors/iterations"}},{"uuid":"61f49651fde14952b85fb9730ab17e0c","snippet":"unit uPrimeFactors; interface type TPrimeFactors = class public class function Factors(ANumber:Int64):TArray; end; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":24,"iteration_status":"untested","published_iteration_head_tests_status":"not_queued","published_at":"2022-11-30T18:43:14.000Z","is_out_of_date":false,"language":"delphi","author":{"handle":"lucvtzel"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Delphi Pascal","icon_url":"https://assets.exercism.org/tracks/delphi.svg","highlightjs_language":"delphi"},"links":{"public_url":"https://exercism.org/uk/tracks/delphi/exercises/prime-factors/solutions/lucvtzel","private_iterations_url":"https://exercism.org/uk/tracks/delphi/exercises/prime-factors/iterations"}},{"uuid":"e31ea450f319448d804fe37dd38740b8","snippet":"unit uPrimeF; interface uses System.SysUtils, System.Classes, System.StrUtils; type TPrimeF = class public class function Factor(inputint: integer): TStringList; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":32,"iteration_status":"untested","published_iteration_head_tests_status":"not_queued","published_at":"2023-12-20T19:19:45.000Z","is_out_of_date":false,"language":"delphi","author":{"handle":"oblyvied"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Delphi Pascal","icon_url":"https://assets.exercism.org/tracks/delphi.svg","highlightjs_language":"delphi"},"links":{"public_url":"https://exercism.org/uk/tracks/delphi/exercises/prime-factors/solutions/oblyvied","private_iterations_url":"https://exercism.org/uk/tracks/delphi/exercises/prime-factors/iterations"}},{"uuid":"7a37afecfe624987a8458331b8b1de29","snippet":"unit uPrimeFactors; interface type TPrimeFactors = class public class function Factors(N: Int64): TArray; static; end; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":39,"iteration_status":"untested","published_iteration_head_tests_status":"not_queued","published_at":"2025-05-30T06:01:41.000Z","is_out_of_date":false,"language":"delphi","author":{"handle":"martak1"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Delphi Pascal","icon_url":"https://assets.exercism.org/tracks/delphi.svg","highlightjs_language":"delphi"},"links":{"public_url":"https://exercism.org/uk/tracks/delphi/exercises/prime-factors/solutions/martak1","private_iterations_url":"https://exercism.org/uk/tracks/delphi/exercises/prime-factors/iterations"}},{"uuid":"3b2bee8e5af44a219640e7abc11b2423","snippet":"unit uPrimeFactors; interface uses System.Generics.Collections; type TPrimeFactors = class class function Factors(ANum : Int64) : Tarray; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":29,"iteration_status":"untested","published_iteration_head_tests_status":"not_queued","published_at":"2018-11-22T15:43:32.000Z","is_out_of_date":false,"language":"delphi","author":{"handle":"Zorica"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Delphi Pascal","icon_url":"https://assets.exercism.org/tracks/delphi.svg","highlightjs_language":"delphi"},"links":{"public_url":"https://exercism.org/uk/tracks/delphi/exercises/prime-factors/solutions/Zorica","private_iterations_url":"https://exercism.org/uk/tracks/delphi/exercises/prime-factors/iterations"}},{"uuid":"496d2c495df9412b826e3f0fd7a66b7d","snippet":"unit uPrimeFactors; interface type TInt = Int64; TIntArray = TArray; TPrimeFactors = class(TObject) class function Factors(Value: TInt): TIntArray; ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":24,"iteration_status":"untested","published_iteration_head_tests_status":"not_queued","published_at":"2019-10-20T03:35:17.000Z","is_out_of_date":false,"language":"delphi","author":{"handle":"Greycoat21"},"exercise":{"title":"Прості множники","icon_url":"https://assets.exercism.org/exercises/prime-factors.svg"},"track":{"title":"Delphi Pascal","icon_url":"https://assets.exercism.org/tracks/delphi.svg","highlightjs_language":"delphi"},"links":{"public_url":"https://exercism.org/uk/tracks/delphi/exercises/prime-factors/solutions/Greycoat21","private_iterations_url":"https://exercism.org/uk/tracks/delphi/exercises/prime-factors/iterations"}}],"meta":{"current_page":1,"total_count":15,"total_pages":1,"unscoped_total":15}}}}}

Мовні треки

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

Подорож

ОбранеНове

Переваги Exercism

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

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

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

Discord

Форум

З чого почати

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

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

Учасники

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

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

Про Exercism

Наш вплив

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

Інсайдери