{"request":{"endpoint":"https://exercism.org/api/v2/tracks/fsharp/exercises/perfect-numbers/community_solutions","query":{},"options":{"initial_data":{"results":[{"uuid":"37d71b37ce844d5899cf654dca004a1b","snippet":"module PerfectNumbers type Classification = Perfect | Abundant | Deficient let classify n = if n < 1 then None else let sumOfFactors = [for x in 1..n / 2 do if n % x = 0 then x] |> List.sum if sumOfFactors < n then Some Deficient ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":2,"num_loc":10,"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":"fsharp","author":{"handle":"ErikSchierboom"},"exercise":{"title":"Τέλειοι αριθμοί","icon_url":"https://assets.exercism.org/exercises/perfect-numbers.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/el/tracks/fsharp/exercises/perfect-numbers/solutions/ErikSchierboom","private_iterations_url":"https://exercism.org/el/tracks/fsharp/exercises/perfect-numbers/iterations"}},{"uuid":"2c7ca11083924671a953a98c504044b7","snippet":"module PerfectNumbers type Classification = Perfect | Abundant | Deficient let classify n : Classification option = if n <= 0 then None else let sum = [1..n/2] |> List.filter (fun x -> n % x = 0) |> List.sum match sum with | x when x = n -> Some Perfect ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":10,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-10-03T06:36:04.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"fstiffo"},"exercise":{"title":"Τέλειοι αριθμοί","icon_url":"https://assets.exercism.org/exercises/perfect-numbers.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/el/tracks/fsharp/exercises/perfect-numbers/solutions/fstiffo","private_iterations_url":"https://exercism.org/el/tracks/fsharp/exercises/perfect-numbers/iterations"}},{"uuid":"3801ec641c9241f7bbe940568b734092","snippet":"module PerfectNumbers type Classification = Perfect | Abundant | Deficient let classify n : Classification option = if n > 0 then let sum = { 1..(n - 1) } |> Seq.filter (fun x -> n % x = 0) |> Seq.sum ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":14,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-06-01T15:32:52.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"MichalMoudry"},"exercise":{"title":"Τέλειοι αριθμοί","icon_url":"https://assets.exercism.org/exercises/perfect-numbers.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/el/tracks/fsharp/exercises/perfect-numbers/solutions/MichalMoudry","private_iterations_url":"https://exercism.org/el/tracks/fsharp/exercises/perfect-numbers/iterations"}},{"uuid":"45fd25a3ead54851ac9492fb09cfd3b7","snippet":"module PerfectNumbers type Classification = Perfect | Abundant | Deficient let (|PerfectClass|AbundantClass|DeficientClass|IncorrectClass|) num = let factorsSum = [1..num / 2] |> List.filter (fun n -> num % n = 0) |> List.sum match num, factorsSum with ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":3,"num_loc":19,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-08-30T16:11:07.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"omotorin"},"exercise":{"title":"Τέλειοι αριθμοί","icon_url":"https://assets.exercism.org/exercises/perfect-numbers.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/el/tracks/fsharp/exercises/perfect-numbers/solutions/omotorin","private_iterations_url":"https://exercism.org/el/tracks/fsharp/exercises/perfect-numbers/iterations"}},{"uuid":"7d31a6438c4c49339765ff95bf0b4855","snippet":"module PerfectNumbers type Classification = Perfect | Abundant | Deficient let classify n : Classification option = let aliquotSum number = {1..number / 2} |> Seq.filter (fun item -> number % item = 0) |> Seq.sum ","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":"2022-07-12T13:14:54.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"mva91"},"exercise":{"title":"Τέλειοι αριθμοί","icon_url":"https://assets.exercism.org/exercises/perfect-numbers.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/el/tracks/fsharp/exercises/perfect-numbers/solutions/mva91","private_iterations_url":"https://exercism.org/el/tracks/fsharp/exercises/perfect-numbers/iterations"}},{"uuid":"f306371cea2d45b1bdfb526e12f056e6","snippet":"module PerfectNumbers type Classification = Perfect | Abundant | Deficient let divisors n = [1 .. n/2] |> List.filter (fun i -> n % i = 0) |> List.filter (fun i -> n <> i) let classify n : Classification option = ","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":"2022-05-11T12:08:47.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"pth"},"exercise":{"title":"Τέλειοι αριθμοί","icon_url":"https://assets.exercism.org/exercises/perfect-numbers.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/el/tracks/fsharp/exercises/perfect-numbers/solutions/pth","private_iterations_url":"https://exercism.org/el/tracks/fsharp/exercises/perfect-numbers/iterations"}},{"uuid":"be8cdff305f64d1783d6c8ca3917ac72","snippet":"module PerfectNumbers type Classification = Perfect | Abundant | Deficient let factors number = match number with | n when n > 0 -> {1 .. n/2} |> Seq.filter (fun x -> n % x = 0) |> Some | _ -> None let classify n : Classification option = ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":13,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-08-07T00:52:09.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"emilianolch"},"exercise":{"title":"Τέλειοι αριθμοί","icon_url":"https://assets.exercism.org/exercises/perfect-numbers.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/el/tracks/fsharp/exercises/perfect-numbers/solutions/emilianolch","private_iterations_url":"https://exercism.org/el/tracks/fsharp/exercises/perfect-numbers/iterations"}},{"uuid":"c52f3fdfea3045b486cbf73d84123fd5","snippet":"module PerfectNumbers type Classification = Perfect | Abundant | Deficient let aliquotSum n = seq { for i in 1..(n/2) do if n % i = 0 then i } |> Seq.sum let classify n : Classification option = if n <= 0 then ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":14,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-07-21T11:27:50.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"wagenert"},"exercise":{"title":"Τέλειοι αριθμοί","icon_url":"https://assets.exercism.org/exercises/perfect-numbers.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/el/tracks/fsharp/exercises/perfect-numbers/solutions/wagenert","private_iterations_url":"https://exercism.org/el/tracks/fsharp/exercises/perfect-numbers/iterations"}},{"uuid":"f9869a05a9914c0297ecc9d43ac72f54","snippet":"module PerfectNumbers type Classification = Perfect | Abundant | Deficient let factors number = let rec factorsRec n acc = if n = 0 then acc else if number%n = 0 then factorsRec (n-1) (n::acc) else factorsRec (n-1) acc ","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":"2021-09-24T18:14:17.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"cristians"},"exercise":{"title":"Τέλειοι αριθμοί","icon_url":"https://assets.exercism.org/exercises/perfect-numbers.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/el/tracks/fsharp/exercises/perfect-numbers/solutions/cristians","private_iterations_url":"https://exercism.org/el/tracks/fsharp/exercises/perfect-numbers/iterations"}},{"uuid":"1012144c67a84b4ba944e050488c4503","snippet":"module PerfectNumbers type Classification = Perfect | Abundant | Deficient let factors (n : int) = [1..n/2] |> Seq.filter (fun x -> (n % x) = 0) let alliquotSum n = factors n |> Seq.sum ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":6,"num_loc":15,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-01-12T23:23:46.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"ajoshguy"},"exercise":{"title":"Τέλειοι αριθμοί","icon_url":"https://assets.exercism.org/exercises/perfect-numbers.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/el/tracks/fsharp/exercises/perfect-numbers/solutions/ajoshguy","private_iterations_url":"https://exercism.org/el/tracks/fsharp/exercises/perfect-numbers/iterations"}},{"uuid":"c17f29fc76e64b2d938a71c41ecc4f71","snippet":"module PerfectNumbers type Classification = Perfect | Abundant | Deficient let factors n = [ for x in 1..(n-1) do if n % x = 0 then yield x ] ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":15,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-11-25T10:59:19.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"timyhac"},"exercise":{"title":"Τέλειοι αριθμοί","icon_url":"https://assets.exercism.org/exercises/perfect-numbers.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/el/tracks/fsharp/exercises/perfect-numbers/solutions/timyhac","private_iterations_url":"https://exercism.org/el/tracks/fsharp/exercises/perfect-numbers/iterations"}},{"uuid":"cc6220a473cb487a97c358d417faf949","snippet":"module PerfectNumbers type Classification = | Perfect | Abundant | Deficient let classify number = let factorsSum = seq { ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":25,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-04-06T18:30:08.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"mrboring"},"exercise":{"title":"Τέλειοι αριθμοί","icon_url":"https://assets.exercism.org/exercises/perfect-numbers.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/el/tracks/fsharp/exercises/perfect-numbers/solutions/mrboring","private_iterations_url":"https://exercism.org/el/tracks/fsharp/exercises/perfect-numbers/iterations"}},{"uuid":"c4ba920632da472c8b2c2b25eae89e57","snippet":"module PerfectNumbers type Classification = | Perfect | Abundant | Deficient let classify = function | n when n <= 0 -> None ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":4,"num_loc":26,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-06-15T19:08:59.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"mattnewport"},"exercise":{"title":"Τέλειοι αριθμοί","icon_url":"https://assets.exercism.org/exercises/perfect-numbers.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/el/tracks/fsharp/exercises/perfect-numbers/solutions/mattnewport","private_iterations_url":"https://exercism.org/el/tracks/fsharp/exercises/perfect-numbers/iterations"}},{"uuid":"e78481429d654ababbab012a2978a75b","snippet":"module PerfectNumbers type Classification = Perfect | Abundant | Deficient let classify n : Classification option = if n <= 0 then None else let aliquot = [for i in 1..n-1 do if n % i = 0 then yield i] |> List.sum if aliquot > n then Some Abundant elif aliquot < n then Some Deficient ","num_views":0,"num_stars":1,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":9,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-07-16T01:42:43.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"dontloseyourheadsu"},"exercise":{"title":"Τέλειοι αριθμοί","icon_url":"https://assets.exercism.org/exercises/perfect-numbers.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/el/tracks/fsharp/exercises/perfect-numbers/solutions/dontloseyourheadsu","private_iterations_url":"https://exercism.org/el/tracks/fsharp/exercises/perfect-numbers/iterations"}},{"uuid":"07bbb46b35cb4cf3a571530b4cb8717e","snippet":"module PerfectNumbers type Classification = | Perfect | Abundant | Deficient let aliquotSum (n: int) = let sqr = System.Math.Sqrt n |> int ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":21,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-02-19T04:24:07.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"ben-w-davis"},"exercise":{"title":"Τέλειοι αριθμοί","icon_url":"https://assets.exercism.org/exercises/perfect-numbers.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/el/tracks/fsharp/exercises/perfect-numbers/solutions/ben-w-davis","private_iterations_url":"https://exercism.org/el/tracks/fsharp/exercises/perfect-numbers/iterations"}},{"uuid":"e2cb0ae6500940c681e4e9524fd0346c","snippet":"module PerfectNumbers type Classification = Perfect | Abundant | Deficient let classify n : Classification option = if n < 1 then None elif n = 1 then Some Classification.Deficient else ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":21,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-02-24T14:04:41.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"novotnyradekcz"},"exercise":{"title":"Τέλειοι αριθμοί","icon_url":"https://assets.exercism.org/exercises/perfect-numbers.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/el/tracks/fsharp/exercises/perfect-numbers/solutions/novotnyradekcz","private_iterations_url":"https://exercism.org/el/tracks/fsharp/exercises/perfect-numbers/iterations"}},{"uuid":"3da74bfba80c4099ac369c28b5e238df","snippet":"module PerfectNumbers type Classification = Perfect | Abundant | Deficient let classify n : Classification option = if n <= 0 then None else seq { for div in 1 .. (n / 2) do ","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":"2023-02-23T00:08:22.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"andradefr8"},"exercise":{"title":"Τέλειοι αριθμοί","icon_url":"https://assets.exercism.org/exercises/perfect-numbers.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/el/tracks/fsharp/exercises/perfect-numbers/solutions/andradefr8","private_iterations_url":"https://exercism.org/el/tracks/fsharp/exercises/perfect-numbers/iterations"}},{"uuid":"3bcb926e49d343a7917dcca6433ea0ee","snippet":"module PerfectNumbers type Classification = Perfect | Abundant | Deficient let classify n : Classification option = if n < 1 then None else let factorSum = [1 .. n / 2] ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":20,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-02-03T09:13:28.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"Maranello"},"exercise":{"title":"Τέλειοι αριθμοί","icon_url":"https://assets.exercism.org/exercises/perfect-numbers.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/el/tracks/fsharp/exercises/perfect-numbers/solutions/Maranello","private_iterations_url":"https://exercism.org/el/tracks/fsharp/exercises/perfect-numbers/iterations"}},{"uuid":"891588fca250445b88aa76ca7263fbf2","snippet":"module PerfectNumbers type Classification = Perfect | Abundant | Deficient let private factors n: int list = [ for i = 1 to (int (sqrt (float n))) do let f, rem = Math.DivRem(n, i) if rem = 0 then yield! List.distinct [i; f] ] let private aliquotSum n = List.sum (factors n) - n ","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":"2023-02-10T20:29:03.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"glennj"},"exercise":{"title":"Τέλειοι αριθμοί","icon_url":"https://assets.exercism.org/exercises/perfect-numbers.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/el/tracks/fsharp/exercises/perfect-numbers/solutions/glennj","private_iterations_url":"https://exercism.org/el/tracks/fsharp/exercises/perfect-numbers/iterations"}},{"uuid":"8ccbf0564c5b424fb87bff1a00d29f15","snippet":"module PerfectNumbers type Classification = Perfect | Abundant | Deficient let classify (number: int) : Classification option = let rec aliquot_sum (x: int) (p: int) = match p with | 0 -> 0 | 1 -> 1 | p when x%p = 0 -> p + aliquot_sum x (p-1) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":15,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-08-19T16:49:45.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"rcharron"},"exercise":{"title":"Τέλειοι αριθμοί","icon_url":"https://assets.exercism.org/exercises/perfect-numbers.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/el/tracks/fsharp/exercises/perfect-numbers/solutions/rcharron","private_iterations_url":"https://exercism.org/el/tracks/fsharp/exercises/perfect-numbers/iterations"}},{"uuid":"3cdac648f57147eba48312e25bac5aca","snippet":"module PerfectNumbers type Classification = | Perfect | Abundant | Deficient let isFactor n x = n % x = 0 let classify n : Classification option = ","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":"2023-08-23T18:40:44.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"javicabanas"},"exercise":{"title":"Τέλειοι αριθμοί","icon_url":"https://assets.exercism.org/exercises/perfect-numbers.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/el/tracks/fsharp/exercises/perfect-numbers/solutions/javicabanas","private_iterations_url":"https://exercism.org/el/tracks/fsharp/exercises/perfect-numbers/iterations"}},{"uuid":"9826bf8ae400456d894b948defa9f77e","snippet":"module PerfectNumbers type Classification = Perfect | Abundant | Deficient let factorsof n : int seq = match n with | 1 -> seq {1} | _ -> seq { for x = 1 to n - 1 do if n % x = 0 then ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":20,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-06-26T21:26:26.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"Jona4Play"},"exercise":{"title":"Τέλειοι αριθμοί","icon_url":"https://assets.exercism.org/exercises/perfect-numbers.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/el/tracks/fsharp/exercises/perfect-numbers/solutions/Jona4Play","private_iterations_url":"https://exercism.org/el/tracks/fsharp/exercises/perfect-numbers/iterations"}},{"uuid":"bbc9e7783355418ca9b22a67f0d8f6cd","snippet":"module PerfectNumbers type Classification = Perfect | Abundant | Deficient let classify n : Classification option = if n < 1 then None else let factors = [ for i in 1 .. n - 1 do ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":14,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-07-04T21:17:16.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"mumk0313"},"exercise":{"title":"Τέλειοι αριθμοί","icon_url":"https://assets.exercism.org/exercises/perfect-numbers.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/el/tracks/fsharp/exercises/perfect-numbers/solutions/mumk0313","private_iterations_url":"https://exercism.org/el/tracks/fsharp/exercises/perfect-numbers/iterations"}},{"uuid":"3567dc358b60451e9f17440dd8e5a007","snippet":"module PerfectNumbers type Classification = | Perfect | Abundant | Deficient let classify n = let factors n = [ 1 .. n / 2 ] |> List.filter (fun x -> n % x = 0) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":15,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-02-07T09:49:38.000Z","is_out_of_date":false,"language":"fsharp","author":{"handle":"mazhuravlev"},"exercise":{"title":"Τέλειοι αριθμοί","icon_url":"https://assets.exercism.org/exercises/perfect-numbers.svg"},"track":{"title":"F#","icon_url":"https://assets.exercism.org/tracks/fsharp.svg","highlightjs_language":"fsharp"},"links":{"public_url":"https://exercism.org/el/tracks/fsharp/exercises/perfect-numbers/solutions/mazhuravlev","private_iterations_url":"https://exercism.org/el/tracks/fsharp/exercises/perfect-numbers/iterations"}}],"meta":{"current_page":1,"total_count":221,"total_pages":10,"unscoped_total":221}}}}}

Γλώσσες προγραμματισμού

Μάθε προγραμματισμό με το Jiki

Το Ταξίδι σου

Τα Αγαπημένα σουΝέο

Προνόμια του Exercism

Βίντεο της Κοινότητας

Σειρά σύντομων εισαγωγών

Συνεντεύξεις και ιστορίες

Discord

Φόρουμ

Ξεκινώντας

Καθοδήγηση

Τεκμηρίωση

Συνεισφέροντες

ΜεταφραστέςΝέο

Κάνε δωρεά

Σχετικά με το Exercism

Ο αντίκτυπός μας

Συγχρονισμός GitHubΝέο

Insiders