{"request":{"endpoint":"https://exercism.org/api/v2/tracks/sml/exercises/perfect-numbers/community_solutions","query":{},"options":{"initial_data":{"results":[{"uuid":"4c26d89940984e4a989d9a05d9618891","snippet":"infix |> fun x |> f = f x datatype classification = Abundant | Deficient | Perfect fun factors n = let fun aux acc i = if i >= n then acc else if n mod i = 0 then aux (i :: acc) (i + 1) else aux acc (i + 1) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":19,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-05-05T05:31:01.000Z","is_out_of_date":false,"language":"sml","author":{"handle":"Munksgaard"},"exercise":{"title":"الأعداد التامة","icon_url":"https://assets.exercism.org/exercises/perfect-numbers.svg"},"track":{"title":"Standard ML","icon_url":"https://assets.exercism.org/tracks/sml.svg","highlightjs_language":"sml"},"links":{"public_url":"https://exercism.org/ar/tracks/sml/exercises/perfect-numbers/solutions/Munksgaard","private_iterations_url":"https://exercism.org/ar/tracks/sml/exercises/perfect-numbers/iterations"}},{"uuid":"69cc8157fe8a42beab98b19c069e39ae","snippet":"datatype classification = Deficient | Perfect | Abundant (* Divisors come in pairs (i,j) with i <= sqrt n. *) (* When i = sqrt n, count this divisor once. *) fun properDivisors 1 = [] | properDivisors n = let fun loop i = if i * i > n then [] else if n mod i <> 0 ","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":"2018-10-08T06:04:08.000Z","is_out_of_date":false,"language":"sml","author":{"handle":"sshine"},"exercise":{"title":"الأعداد التامة","icon_url":"https://assets.exercism.org/exercises/perfect-numbers.svg"},"track":{"title":"Standard ML","icon_url":"https://assets.exercism.org/tracks/sml.svg","highlightjs_language":"sml"},"links":{"public_url":"https://exercism.org/ar/tracks/sml/exercises/perfect-numbers/solutions/sshine","private_iterations_url":"https://exercism.org/ar/tracks/sml/exercises/perfect-numbers/iterations"}},{"uuid":"5d3eb25b3a844f00ac008380f2da9901","snippet":"datatype classification = Abundant | Deficient | Perfect fun aliquotSum n = let fun fct n c acc = if c>=n then acc else if n mod c = 0 then fct n (c+1) (c+acc) else fct n (c+1) acc in fct n 1 0 end ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":14,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-12-14T04:02:13.000Z","is_out_of_date":false,"language":"sml","author":{"handle":"Steedalion"},"exercise":{"title":"الأعداد التامة","icon_url":"https://assets.exercism.org/exercises/perfect-numbers.svg"},"track":{"title":"Standard ML","icon_url":"https://assets.exercism.org/tracks/sml.svg","highlightjs_language":"sml"},"links":{"public_url":"https://exercism.org/ar/tracks/sml/exercises/perfect-numbers/solutions/Steedalion","private_iterations_url":"https://exercism.org/ar/tracks/sml/exercises/perfect-numbers/iterations"}},{"uuid":"f64f19007852412b8eca7933c4ca6a68","snippet":"datatype classification = Abundant | Deficient | Perfect fun classify (input: int): classification option = let val v = if input <= 0 then 0 else let val sqrtn = Real.round(Math.sqrt (Real.fromInt input)) fun factSum i = if i > sqrtn then 1 else if input mod i = 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":"2022-04-16T16:25:26.000Z","is_out_of_date":false,"language":"sml","author":{"handle":"cjoaks"},"exercise":{"title":"الأعداد التامة","icon_url":"https://assets.exercism.org/exercises/perfect-numbers.svg"},"track":{"title":"Standard ML","icon_url":"https://assets.exercism.org/tracks/sml.svg","highlightjs_language":"sml"},"links":{"public_url":"https://exercism.org/ar/tracks/sml/exercises/perfect-numbers/solutions/cjoaks","private_iterations_url":"https://exercism.org/ar/tracks/sml/exercises/perfect-numbers/iterations"}},{"uuid":"00b60dfc01f44f488df4e6fac44a9ab8","snippet":"datatype classification = Abundant | Deficient | Perfect fun aliquot_sum n = let fun loop 0 = 0 | loop x = (if n mod x = 0 then x else 0) + loop (x - 1) in loop (n div 2) end fun classify (n: int): classification option = if n < 1 then NONE else SOME ( case Int.compare (aliquot_sum n, n) of ","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":"2024-10-06T06:33:30.000Z","is_out_of_date":false,"language":"sml","author":{"handle":"hl4"},"exercise":{"title":"الأعداد التامة","icon_url":"https://assets.exercism.org/exercises/perfect-numbers.svg"},"track":{"title":"Standard ML","icon_url":"https://assets.exercism.org/tracks/sml.svg","highlightjs_language":"sml"},"links":{"public_url":"https://exercism.org/ar/tracks/sml/exercises/perfect-numbers/solutions/hl4","private_iterations_url":"https://exercism.org/ar/tracks/sml/exercises/perfect-numbers/iterations"}},{"uuid":"a41a9fde66a54890aa168a4cc4ddf7e3","snippet":"datatype classification = Abundant | Deficient | Perfect fun factors n = let fun go (i, acc) = if 2 * i > n then acc else if Int.rem (n, i) = 0 then go (i + 1, i :: acc) else go (i + 1, acc) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":24,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-03-09T05:57:48.000Z","is_out_of_date":false,"language":"sml","author":{"handle":"Skyb0rg007"},"exercise":{"title":"الأعداد التامة","icon_url":"https://assets.exercism.org/exercises/perfect-numbers.svg"},"track":{"title":"Standard ML","icon_url":"https://assets.exercism.org/tracks/sml.svg","highlightjs_language":"sml"},"links":{"public_url":"https://exercism.org/ar/tracks/sml/exercises/perfect-numbers/solutions/Skyb0rg007","private_iterations_url":"https://exercism.org/ar/tracks/sml/exercises/perfect-numbers/iterations"}},{"uuid":"db0e3f17df4b43758f94515bbce9fd8b","snippet":"datatype classification = Perfect | Abundant | Deficient fun aliquot_sum n = let fun factors_sum n i acc = if i >= n then acc else if n mod i = 0 then factors_sum n (i + 1) (acc + i) else factors_sum n (i + 1) acc ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":24,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2025-05-02T17:54:46.000Z","is_out_of_date":false,"language":"sml","author":{"handle":"VickMahase"},"exercise":{"title":"الأعداد التامة","icon_url":"https://assets.exercism.org/exercises/perfect-numbers.svg"},"track":{"title":"Standard ML","icon_url":"https://assets.exercism.org/tracks/sml.svg","highlightjs_language":"sml"},"links":{"public_url":"https://exercism.org/ar/tracks/sml/exercises/perfect-numbers/solutions/VickMahase","private_iterations_url":"https://exercism.org/ar/tracks/sml/exercises/perfect-numbers/iterations"}},{"uuid":"2643ea1fdc9a4afb9bb315cdf883a870","snippet":"(* test.sml wants classify to return 'classification option'. The original code here returned 'classification'. *) datatype classification = Abundant | Deficient | Perfect local fun factor_sum n = ","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":"2019-04-04T05:15:03.000Z","is_out_of_date":false,"language":"sml","author":{"handle":"nzok"},"exercise":{"title":"الأعداد التامة","icon_url":"https://assets.exercism.org/exercises/perfect-numbers.svg"},"track":{"title":"Standard ML","icon_url":"https://assets.exercism.org/tracks/sml.svg","highlightjs_language":"sml"},"links":{"public_url":"https://exercism.org/ar/tracks/sml/exercises/perfect-numbers/solutions/nzok","private_iterations_url":"https://exercism.org/ar/tracks/sml/exercises/perfect-numbers/iterations"}},{"uuid":"7a5cf2cdccd244efa063e9c07b80c4f9","snippet":"datatype classification = Abundant | Deficient | Perfect fun classify input = if input < 1 then NONE else let fun aux n acc = case (n > input div 2, input mod n = 0) of (true, _) => acc | (_, true) => aux (n + 1) (acc + n) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":4,"num_loc":15,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-10-01T10:46:25.000Z","is_out_of_date":false,"language":"sml","author":{"handle":"simisc"},"exercise":{"title":"الأعداد التامة","icon_url":"https://assets.exercism.org/exercises/perfect-numbers.svg"},"track":{"title":"Standard ML","icon_url":"https://assets.exercism.org/tracks/sml.svg","highlightjs_language":"sml"},"links":{"public_url":"https://exercism.org/ar/tracks/sml/exercises/perfect-numbers/solutions/simisc","private_iterations_url":"https://exercism.org/ar/tracks/sml/exercises/perfect-numbers/iterations"}},{"uuid":"b2e10733f567430cafd3b6e533e768ac","snippet":"datatype classification = Abundant | Deficient | Perfect fun proper_divisors_aux n d = if n = d then [] else if n mod d = 0 then d :: proper_divisors_aux n (d + 1) else proper_divisors_aux n (d + 1) fun proper_divisors n = proper_divisors_aux n 1 fun aliquot n = List.foldl (fn (a, b) => a + b) 0 (proper_divisors 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":"2022-02-15T18:02:29.000Z","is_out_of_date":false,"language":"sml","author":{"handle":"clementi"},"exercise":{"title":"الأعداد التامة","icon_url":"https://assets.exercism.org/exercises/perfect-numbers.svg"},"track":{"title":"Standard ML","icon_url":"https://assets.exercism.org/tracks/sml.svg","highlightjs_language":"sml"},"links":{"public_url":"https://exercism.org/ar/tracks/sml/exercises/perfect-numbers/solutions/clementi","private_iterations_url":"https://exercism.org/ar/tracks/sml/exercises/perfect-numbers/iterations"}},{"uuid":"9567974f096b443bb180fcb015fc3189","snippet":"datatype classification = Abundant | Deficient | Perfect (* Relatively fast on large numbers (especially on primes which are worst case for most algorithms). *) fun classify (n: int): classification option = if n < 1 then NONE else if n = 1 (* Edge case *) then SOME Deficient else ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":30,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-04-11T18:44:15.000Z","is_out_of_date":false,"language":"sml","author":{"handle":"rainij"},"exercise":{"title":"الأعداد التامة","icon_url":"https://assets.exercism.org/exercises/perfect-numbers.svg"},"track":{"title":"Standard ML","icon_url":"https://assets.exercism.org/tracks/sml.svg","highlightjs_language":"sml"},"links":{"public_url":"https://exercism.org/ar/tracks/sml/exercises/perfect-numbers/solutions/rainij","private_iterations_url":"https://exercism.org/ar/tracks/sml/exercises/perfect-numbers/iterations"}},{"uuid":"dfbf9e406ee24b89837b76775550368b","snippet":"datatype classification = Deficient | Perfect | Abundant fun properDivisors 1 = [] | properDivisors n = let fun loop i = if i * i > n then [] else if n mod i <> 0 then loop (i+1) else if i * i = n then i :: loop (i+1) ","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":"2025-09-06T17:27:00.000Z","is_out_of_date":false,"language":"sml","author":{"handle":"Rohankapri"},"exercise":{"title":"الأعداد التامة","icon_url":"https://assets.exercism.org/exercises/perfect-numbers.svg"},"track":{"title":"Standard ML","icon_url":"https://assets.exercism.org/tracks/sml.svg","highlightjs_language":"sml"},"links":{"public_url":"https://exercism.org/ar/tracks/sml/exercises/perfect-numbers/solutions/Rohankapri","private_iterations_url":"https://exercism.org/ar/tracks/sml/exercises/perfect-numbers/iterations"}},{"uuid":"589925aba6e4452099cc9785cb56dc67","snippet":"datatype classification = Abundant | Deficient | Perfect local fun factors n = let fun f' f fs = if f * f > n then fs else if n mod f <> 0 then f' (f + 1) fs else let val g = n div f ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":26,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2024-11-30T17:49:09.000Z","is_out_of_date":false,"language":"sml","author":{"handle":"glennj"},"exercise":{"title":"الأعداد التامة","icon_url":"https://assets.exercism.org/exercises/perfect-numbers.svg"},"track":{"title":"Standard ML","icon_url":"https://assets.exercism.org/tracks/sml.svg","highlightjs_language":"sml"},"links":{"public_url":"https://exercism.org/ar/tracks/sml/exercises/perfect-numbers/solutions/glennj","private_iterations_url":"https://exercism.org/ar/tracks/sml/exercises/perfect-numbers/iterations"}},{"uuid":"56a5c8213820409cbbbb5694804fbd2e","snippet":"(* --------------------------------------------------------------------------- exercism.io SML Track Exercise: perfect-numbers Contributed: Anthony J. Borla (ajborla@bigpond.com) -------------------------------------------------------------------------- *) fun compute_aliquot_sum' (dividend, divisor, limit, sum) = if divisor > limit then sum + 1 else let val remainder = dividend mod divisor ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":27,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-07-26T10:01:44.000Z","is_out_of_date":false,"language":"sml","author":{"handle":"ajborla"},"exercise":{"title":"الأعداد التامة","icon_url":"https://assets.exercism.org/exercises/perfect-numbers.svg"},"track":{"title":"Standard ML","icon_url":"https://assets.exercism.org/tracks/sml.svg","highlightjs_language":"sml"},"links":{"public_url":"https://exercism.org/ar/tracks/sml/exercises/perfect-numbers/solutions/ajborla","private_iterations_url":"https://exercism.org/ar/tracks/sml/exercises/perfect-numbers/iterations"}},{"uuid":"45fe76a0119d48d5bb628f7a304c4de7","snippet":"datatype classification = Abundant | Deficient | Perfect; fun factors(n,k) = if k >= n then [] else if n mod k = 0 then k::factors(n,k+1) else factors(n,k+1); fun sum [] = 0 | sum (x::xs) = x + sum xs fun classify (input: int): classification option = if input <= 0 then NONE else ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":18,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2021-11-30T05:38:45.000Z","is_out_of_date":false,"language":"sml","author":{"handle":"harrietobrien"},"exercise":{"title":"الأعداد التامة","icon_url":"https://assets.exercism.org/exercises/perfect-numbers.svg"},"track":{"title":"Standard ML","icon_url":"https://assets.exercism.org/tracks/sml.svg","highlightjs_language":"sml"},"links":{"public_url":"https://exercism.org/ar/tracks/sml/exercises/perfect-numbers/solutions/harrietobrien","private_iterations_url":"https://exercism.org/ar/tracks/sml/exercises/perfect-numbers/iterations"}},{"uuid":"ec98f32f40b54ffeb445940f969d3fbd","snippet":"datatype classification = Abundant | Deficient | Perfect fun counter (from, to) = if from >= to then nil else from :: counter(from + 1, to) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":42,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-03-01T07:57:41.000Z","is_out_of_date":false,"language":"sml","author":{"handle":"fingerfly"},"exercise":{"title":"الأعداد التامة","icon_url":"https://assets.exercism.org/exercises/perfect-numbers.svg"},"track":{"title":"Standard ML","icon_url":"https://assets.exercism.org/tracks/sml.svg","highlightjs_language":"sml"},"links":{"public_url":"https://exercism.org/ar/tracks/sml/exercises/perfect-numbers/solutions/fingerfly","private_iterations_url":"https://exercism.org/ar/tracks/sml/exercises/perfect-numbers/iterations"}},{"uuid":"90f4f5d436374710baa6693de17a9352","snippet":"datatype classification = Abundant | Deficient | Perfect fun factors (input: int) = let fun helper (start: int, target: int) = if Real.fromInt start >= Math.sqrt(Real.fromInt target) then [] else if target mod start = 0 then let val remainder = target div start ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":29,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"failed","published_at":"2023-06-12T07:55:43.000Z","is_out_of_date":true,"language":"sml","author":{"handle":"bsassoli"},"exercise":{"title":"الأعداد التامة","icon_url":"https://assets.exercism.org/exercises/perfect-numbers.svg"},"track":{"title":"Standard ML","icon_url":"https://assets.exercism.org/tracks/sml.svg","highlightjs_language":"sml"},"links":{"public_url":"https://exercism.org/ar/tracks/sml/exercises/perfect-numbers/solutions/bsassoli","private_iterations_url":"https://exercism.org/ar/tracks/sml/exercises/perfect-numbers/iterations"}},{"uuid":"8be28b9e8ccb45629ec222afd2b8768a","snippet":"fun factorsNoSelf (n : int) = let fun f divisor stop = if divisor > stop then [] else if n = divisor then [] else if 0 = n mod divisor then divisor :: f (divisor + 1) stop else f (divisor + 1) stop ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":22,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-09-27T16:36:53.000Z","is_out_of_date":false,"language":"sml","author":{"handle":"grenle"},"exercise":{"title":"الأعداد التامة","icon_url":"https://assets.exercism.org/exercises/perfect-numbers.svg"},"track":{"title":"Standard ML","icon_url":"https://assets.exercism.org/tracks/sml.svg","highlightjs_language":"sml"},"links":{"public_url":"https://exercism.org/ar/tracks/sml/exercises/perfect-numbers/solutions/grenle","private_iterations_url":"https://exercism.org/ar/tracks/sml/exercises/perfect-numbers/iterations"}},{"uuid":"82a029baa3a44fedb4177584a006d407","snippet":"datatype classification = Abundant | Deficient | Perfect fun classify (input: int): classification option = let fun aliquot_helper(x:int, n:int, i:int) = if(x <= 0) then NONE else if(n>x) then SOME(Abundant) 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-04-21T06:37:02.000Z","is_out_of_date":false,"language":"sml","author":{"handle":"valenciav"},"exercise":{"title":"الأعداد التامة","icon_url":"https://assets.exercism.org/exercises/perfect-numbers.svg"},"track":{"title":"Standard ML","icon_url":"https://assets.exercism.org/tracks/sml.svg","highlightjs_language":"sml"},"links":{"public_url":"https://exercism.org/ar/tracks/sml/exercises/perfect-numbers/solutions/valenciav","private_iterations_url":"https://exercism.org/ar/tracks/sml/exercises/perfect-numbers/iterations"}},{"uuid":"48c2ec4b112c414ebb8e1c602df9e8d6","snippet":"datatype classification = Abundant | Deficient | Perfect fun factor n x q fs = if x >= q then 1::fs else factor n (x+1) q (if n mod x = 0 then x::fs else fs) fun classify (input: int): classification option = case Int.compare(input, 1) of LESS => NONE | EQUAL => SOME Deficient | GREATER => ","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":"2020-06-27T00:03:58.000Z","is_out_of_date":false,"language":"sml","author":{"handle":"stutonk"},"exercise":{"title":"الأعداد التامة","icon_url":"https://assets.exercism.org/exercises/perfect-numbers.svg"},"track":{"title":"Standard ML","icon_url":"https://assets.exercism.org/tracks/sml.svg","highlightjs_language":"sml"},"links":{"public_url":"https://exercism.org/ar/tracks/sml/exercises/perfect-numbers/solutions/stutonk","private_iterations_url":"https://exercism.org/ar/tracks/sml/exercises/perfect-numbers/iterations"}},{"uuid":"0f7fd28cf96444e4804dffc87f0fef47","snippet":"datatype classification = Abundant | Deficient | Perfect fun classify input = if input < 1 then NONE else let fun aux n acc = case (n <= input div 2, input mod n = 0) of (true, true) => aux (n + 1) (acc + n) | (true, _) => aux (n + 1) acc ","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-09-20T04:14:45.000Z","is_out_of_date":false,"language":"sml","author":{"handle":"menketechnologies"},"exercise":{"title":"الأعداد التامة","icon_url":"https://assets.exercism.org/exercises/perfect-numbers.svg"},"track":{"title":"Standard ML","icon_url":"https://assets.exercism.org/tracks/sml.svg","highlightjs_language":"sml"},"links":{"public_url":"https://exercism.org/ar/tracks/sml/exercises/perfect-numbers/solutions/menketechnologies","private_iterations_url":"https://exercism.org/ar/tracks/sml/exercises/perfect-numbers/iterations"}},{"uuid":"3932820181e94ec0b3c8f33094c054d4","snippet":"datatype classification = Abundant | Deficient | Perfect local fun extract (input: int) (p: int): (int * int) = let fun traverse (n: int): (int * int) = if n mod p = 0 then traverse (n div p) else ((input div n * p - 1) div (p - 1), n) in traverse input ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":37,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-12-27T05:29:27.000Z","is_out_of_date":false,"language":"sml","author":{"handle":"keiraville"},"exercise":{"title":"الأعداد التامة","icon_url":"https://assets.exercism.org/exercises/perfect-numbers.svg"},"track":{"title":"Standard ML","icon_url":"https://assets.exercism.org/tracks/sml.svg","highlightjs_language":"sml"},"links":{"public_url":"https://exercism.org/ar/tracks/sml/exercises/perfect-numbers/solutions/keiraville","private_iterations_url":"https://exercism.org/ar/tracks/sml/exercises/perfect-numbers/iterations"}},{"uuid":"f7d3ab71870c461f8d875aa47cb5cb14","snippet":"datatype classification = Abundant | Deficient | Perfect local fun sum xs = foldl (op +) 0 xs fun factorize(x, fs, 1) = 1::fs | factorize(x, fs, f) = factorize(x, if x mod f = 0 then f::fs else fs, f - 1) fun factors 1 = [] | factors x = factorize(x, [], x div 2) in ","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":"2023-01-18T11:29:32.000Z","is_out_of_date":false,"language":"sml","author":{"handle":"stellartux"},"exercise":{"title":"الأعداد التامة","icon_url":"https://assets.exercism.org/exercises/perfect-numbers.svg"},"track":{"title":"Standard ML","icon_url":"https://assets.exercism.org/tracks/sml.svg","highlightjs_language":"sml"},"links":{"public_url":"https://exercism.org/ar/tracks/sml/exercises/perfect-numbers/solutions/stellartux","private_iterations_url":"https://exercism.org/ar/tracks/sml/exercises/perfect-numbers/iterations"}},{"uuid":"10283e563c524028a8675d0ad28a2ff4","snippet":"datatype classification = Abundant | Deficient | Perfect fun classify (input: int): classification option = if input <= 0 then NONE else let val result = List.foldl (op +) 0 (List.tabulate (input - 1, fn i => if input mod (i + 1) = 0 then (i + 1) else 0)) in ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":16,"iteration_status":"tests_failed","published_iteration_head_tests_status":"exceptioned","published_at":"2022-05-14T04:53:31.000Z","is_out_of_date":true,"language":"sml","author":{"handle":"lf94"},"exercise":{"title":"الأعداد التامة","icon_url":"https://assets.exercism.org/exercises/perfect-numbers.svg"},"track":{"title":"Standard ML","icon_url":"https://assets.exercism.org/tracks/sml.svg","highlightjs_language":"sml"},"links":{"public_url":"https://exercism.org/ar/tracks/sml/exercises/perfect-numbers/solutions/lf94","private_iterations_url":"https://exercism.org/ar/tracks/sml/exercises/perfect-numbers/iterations"}}],"meta":{"current_page":1,"total_count":28,"total_pages":2,"unscoped_total":28}}}}}

مسارات اللغات

تعلّم البرمجة مع Jiki

رحلتك

مفضلاتكجديد

مزايا Exercism

فيديوهات المجتمع

سلسلة المقدمات الموجزة

مقابلات وقصص

Discord

المنتدى

البدء

الإرشاد

الوثائق

المساهمون

المترجمونجديد

تبرّع

عن Exercism

أثرنا

مزامن GitHubجديد

Insiders