{"request":{"endpoint":"https://exercism.org/api/v2/tracks/haskell/exercises/armstrong-numbers/community_solutions","query":{},"options":{"initial_data":{"results":[{"uuid":"1664e17b4f554f539b54e67c7ad8bb4b","snippet":"module ArmstrongNumbers (armstrong) where power_star::Int->[Int] power_star num | num == 0 = [] | otherwise = [(num `mod` 10)] ++ power_star (num `div` 10) armstrong :: Int-> Bool armstrong num ","num_views":0,"num_stars":1,"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":"2021-05-31T16:07:24.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"aswin-sreekumar"},"exercise":{"title":"Числа Армстронга","icon_url":"https://assets.exercism.org/exercises/armstrong-numbers.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/uk/tracks/haskell/exercises/armstrong-numbers/solutions/aswin-sreekumar","private_iterations_url":"https://exercism.org/uk/tracks/haskell/exercises/armstrong-numbers/iterations"}},{"uuid":"d4ab0e2c8fa740dd84e24430ada5a015","snippet":"module ArmstrongNumbers (armstrong) where import Data.Char (digitToInt) armstrong :: Integral a => a -> Bool armstrong = (==) <*> fromIntegral . sum . (zipWith (^) <*> (repeat . length)) . map digitToInt . show . toInteger ","num_views":0,"num_stars":1,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":4,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-01-27T15:40:26.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"Vanya329"},"exercise":{"title":"Числа Армстронга","icon_url":"https://assets.exercism.org/exercises/armstrong-numbers.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/uk/tracks/haskell/exercises/armstrong-numbers/solutions/Vanya329","private_iterations_url":"https://exercism.org/uk/tracks/haskell/exercises/armstrong-numbers/iterations"}},{"uuid":"a94439d9ddaf40e19e9d42fbad103661","snippet":"module ArmstrongNumbers (armstrong) where import Data.Char (digitToInt) armstrong :: Integral a => a -> Bool armstrong number = sumOfDigitsToPower == toInteger number where digits = map digitToInt . show $ toInteger number numberOfDigits = length digits digitToPower digit = digit ^ numberOfDigits ","num_views":0,"num_stars":2,"num_comments":0,"representation_num_published_solutions":2,"num_iterations":1,"num_loc":9,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2018-11-11T08:57:04.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"ErikSchierboom"},"exercise":{"title":"Числа Армстронга","icon_url":"https://assets.exercism.org/exercises/armstrong-numbers.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/uk/tracks/haskell/exercises/armstrong-numbers/solutions/ErikSchierboom","private_iterations_url":"https://exercism.org/uk/tracks/haskell/exercises/armstrong-numbers/iterations"}},{"uuid":"aaccaa44f84342da9cb6e4a050e6a464","snippet":"module ArmstrongNumbers (armstrong) where decimals :: (Integral a) => a -> [a] decimals n = extract $ until done step start where extract = snd done x = fst x == 0 step (n_, ds) = (n_ `div` 10, (n_ `mod` 10) : ds) start = (n, []) ","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":"2023-05-01T01:20:16.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"prncss-xyz"},"exercise":{"title":"Числа Армстронга","icon_url":"https://assets.exercism.org/exercises/armstrong-numbers.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/uk/tracks/haskell/exercises/armstrong-numbers/solutions/prncss-xyz","private_iterations_url":"https://exercism.org/uk/tracks/haskell/exercises/armstrong-numbers/iterations"}},{"uuid":"ac7bbda333164ee6b42eb9faa3051847","snippet":"module ArmstrongNumbers (armstrong) where import Data.Char (digitToInt) armstrong :: Int -> Bool armstrong n = n == sum (map (^ length digits) digits) where digits = map digitToInt $ show n ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":5,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-07-13T02:07:39.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"dylantf"},"exercise":{"title":"Числа Армстронга","icon_url":"https://assets.exercism.org/exercises/armstrong-numbers.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/uk/tracks/haskell/exercises/armstrong-numbers/solutions/dylantf","private_iterations_url":"https://exercism.org/uk/tracks/haskell/exercises/armstrong-numbers/iterations"}},{"uuid":"ca10ec3b64bb472281f016dc349d553b","snippet":"module ArmstrongNumbers (armstrong) where armstrong :: Integral a => a -> Bool armstrong n = (calcDigitSum n (numDigits n)) == n calcDigitSum :: Integral a => a -> a -> a calcDigitSum n d | n < 10 = n ^ d | otherwise = (mod n 10) ^ d + (calcDigitSum (div n 10) d) ","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":"2023-03-02T06:41:52.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"Tom-Strooper"},"exercise":{"title":"Числа Армстронга","icon_url":"https://assets.exercism.org/exercises/armstrong-numbers.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/uk/tracks/haskell/exercises/armstrong-numbers/solutions/Tom-Strooper","private_iterations_url":"https://exercism.org/uk/tracks/haskell/exercises/armstrong-numbers/iterations"}},{"uuid":"69e38c71daf847c7b1ea3cbe87b5e534","snippet":"module ArmstrongNumbers (armstrong) where import Data.List armstrong :: (Integral a, Show a) => a -> Bool armstrong x = x == ( fromInteger (sum (fmap (^len) digits))) where digits = map (\n -> read [n] :: Integer) (show x) len = length digits ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":7,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-03-09T23:37:28.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"samtt"},"exercise":{"title":"Числа Армстронга","icon_url":"https://assets.exercism.org/exercises/armstrong-numbers.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/uk/tracks/haskell/exercises/armstrong-numbers/solutions/samtt","private_iterations_url":"https://exercism.org/uk/tracks/haskell/exercises/armstrong-numbers/iterations"}},{"uuid":"4a7e387484c1448bbaf1420844e4ed43","snippet":"module ArmstrongNumbers (armstrong) where howManyDigits :: Integral a => a -> a howManyDigits x | x >= 0 && x <= 9 = 1 | otherwise = 1 + howManyDigits (x `div` 10) armstrongCalcIntermediare :: Integral a => a -> a -> a armstrongCalcIntermediare x n | x >= 0 && x <= 9 = x^n ","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-15T18:40:32.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"lsoranco"},"exercise":{"title":"Числа Армстронга","icon_url":"https://assets.exercism.org/exercises/armstrong-numbers.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/uk/tracks/haskell/exercises/armstrong-numbers/solutions/lsoranco","private_iterations_url":"https://exercism.org/uk/tracks/haskell/exercises/armstrong-numbers/iterations"}},{"uuid":"aea3112ccbfd46d397e6c59074eac014","snippet":"module ArmstrongNumbers (armstrong) where import Data.Function (fix) armstrong :: Integral a => a -> Bool armstrong num = num == sum (map (^ len) digits) where digits = fix (\recur num -> if num == 0 then [] ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":12,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2023-07-17T04:32:41.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"samuelUniversal"},"exercise":{"title":"Числа Армстронга","icon_url":"https://assets.exercism.org/exercises/armstrong-numbers.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/uk/tracks/haskell/exercises/armstrong-numbers/solutions/samuelUniversal","private_iterations_url":"https://exercism.org/uk/tracks/haskell/exercises/armstrong-numbers/iterations"}},{"uuid":"1998c42dc85042c4ab921bb053710bfd","snippet":"module ArmstrongNumbers (armstrong) where armstrong :: Integral a => a -> Bool armstrong x = x == (sum $ (^len) <$> digits) where len = fromIntegral $ length digits digits = mkDigits x mkDigits :: Integral a => a -> [a] mkDigits 0 = [] mkDigits n = mod n 10 : (mkDigits $ div n 10) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":8,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2018-12-24T21:20:02.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"baedr"},"exercise":{"title":"Числа Армстронга","icon_url":"https://assets.exercism.org/exercises/armstrong-numbers.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/uk/tracks/haskell/exercises/armstrong-numbers/solutions/baedr","private_iterations_url":"https://exercism.org/uk/tracks/haskell/exercises/armstrong-numbers/iterations"}},{"uuid":"797e9071d60f42dc986a34ebf6694523","snippet":"module ArmstrongNumbers (armstrong) where import qualified Data.Char as Char import qualified Data.List as List armstrong :: Integral a => a -> Bool armstrong n = let intN = toInteger n in let digitString = show intN in let digits = [(Char.ord c) - (Char.ord '0') | c <- digitString] in ","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":"2018-12-21T06:19:32.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"mbraak"},"exercise":{"title":"Числа Армстронга","icon_url":"https://assets.exercism.org/exercises/armstrong-numbers.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/uk/tracks/haskell/exercises/armstrong-numbers/solutions/mbraak","private_iterations_url":"https://exercism.org/uk/tracks/haskell/exercises/armstrong-numbers/iterations"}},{"uuid":"175d42a298fe42568d39a9d01861768d","snippet":"module ArmstrongNumbers ( armstrong ) where armstrong :: (Integral a, Read a, Show a) => a -> Bool armstrong n = n == sum (map (^ numDigits) digits) where numDigits = length nStr digits = map (read . return) nStr nStr = show n ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":3,"num_loc":9,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2018-11-20T01:56:50.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"lgastako"},"exercise":{"title":"Числа Армстронга","icon_url":"https://assets.exercism.org/exercises/armstrong-numbers.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/uk/tracks/haskell/exercises/armstrong-numbers/solutions/lgastako","private_iterations_url":"https://exercism.org/uk/tracks/haskell/exercises/armstrong-numbers/iterations"}},{"uuid":"2c24110a2efb4ae4a7d94a8ad97df6d7","snippet":"module ArmstrongNumbers (armstrong) where armstrong :: Int -> Bool armstrong input = sum exponented == input where asText = show input len = length asText digits = fmap (\ char -> read [char] :: Int) asText exponented = fmap (^ len) digits ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":8,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2022-09-02T22:37:32.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"Sir4ur0n"},"exercise":{"title":"Числа Армстронга","icon_url":"https://assets.exercism.org/exercises/armstrong-numbers.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/uk/tracks/haskell/exercises/armstrong-numbers/solutions/Sir4ur0n","private_iterations_url":"https://exercism.org/uk/tracks/haskell/exercises/armstrong-numbers/iterations"}},{"uuid":"d2d01521e539433588ce10aafc731b70","snippet":"module ArmstrongNumbers ( armstrong ) where armstrong :: Integral a => a -> Bool armstrong x = let digits = num2digit x n = length digits in sum (map (^ n) digits) == x ","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":"2018-12-01T06:43:50.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"kkweon"},"exercise":{"title":"Числа Армстронга","icon_url":"https://assets.exercism.org/exercises/armstrong-numbers.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/uk/tracks/haskell/exercises/armstrong-numbers/solutions/kkweon","private_iterations_url":"https://exercism.org/uk/tracks/haskell/exercises/armstrong-numbers/iterations"}},{"uuid":"d5e32c4f31434fc5b8765477ac357e3c","snippet":"module ArmstrongNumbers (armstrong) where digitos 0 = [] digitos n = (mod n 10):digitos (div n 10) armstrong :: Integral a => a -> Bool armstrong n = sum power == n where ","num_views":0,"num_stars":0,"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":"2020-09-11T17:44:05.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"WladimirTavares"},"exercise":{"title":"Числа Армстронга","icon_url":"https://assets.exercism.org/exercises/armstrong-numbers.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/uk/tracks/haskell/exercises/armstrong-numbers/solutions/WladimirTavares","private_iterations_url":"https://exercism.org/uk/tracks/haskell/exercises/armstrong-numbers/iterations"}},{"uuid":"34f1465a6f8548fb890b3e53a41c9ad2","snippet":"module ArmstrongNumbers (armstrong) where digits :: Integral a => a -> [a] digits x | x < 1 = [] | otherwise = digits (x `div` 10) ++ [x `mod` 10] raised :: Integral a => [a] -> [a] raised xs = raise xs (^ (length xs)) ","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":"2019-11-14T12:39:18.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"heptalophos"},"exercise":{"title":"Числа Армстронга","icon_url":"https://assets.exercism.org/exercises/armstrong-numbers.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/uk/tracks/haskell/exercises/armstrong-numbers/solutions/heptalophos","private_iterations_url":"https://exercism.org/uk/tracks/haskell/exercises/armstrong-numbers/iterations"}},{"uuid":"b3c4f343a65f4e478a8b0c18449632ad","snippet":"module ArmstrongNumbers (armstrong) where import Data.Char (digitToInt) digs :: Integral x => x -> [x] digs 0 = [] digs x = digs (x `div` 10) ++ [x `mod` 10] len :: Integral x => x -> Int len 0 = 0 ","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":"2021-01-10T15:18:54.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"hauhsu"},"exercise":{"title":"Числа Армстронга","icon_url":"https://assets.exercism.org/exercises/armstrong-numbers.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/uk/tracks/haskell/exercises/armstrong-numbers/solutions/hauhsu","private_iterations_url":"https://exercism.org/uk/tracks/haskell/exercises/armstrong-numbers/iterations"}},{"uuid":"e1432aab43a54c429130dc3a39bb916f","snippet":"module ArmstrongNumbers (armstrong) where armstrong :: Int -> Bool armstrong a = calculate a == a where calculate = sum . map (^ numberOfDigits) . digits numberOfDigits = length . show $ a digits :: Int -> [Int] digits = map (\x -> read [x] :: Int) . show ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":8,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2019-03-19T09:48:17.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"SanderDN"},"exercise":{"title":"Числа Армстронга","icon_url":"https://assets.exercism.org/exercises/armstrong-numbers.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/uk/tracks/haskell/exercises/armstrong-numbers/solutions/SanderDN","private_iterations_url":"https://exercism.org/uk/tracks/haskell/exercises/armstrong-numbers/iterations"}},{"uuid":"190feaa561ef4da1bebddc14aa1dc8ed","snippet":"module ArmstrongNumbers (armstrong) where armstrong :: Integral a => a -> Bool armstrong n = n == sum (map (^len) ds) where ds = digits n digits k | k >= 0 && k < 10 = [k] | otherwise = (k `mod` 10) : digits (k `div` 10) len = length ds ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":8,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2018-12-06T02:48:42.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"clementi"},"exercise":{"title":"Числа Армстронга","icon_url":"https://assets.exercism.org/exercises/armstrong-numbers.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/uk/tracks/haskell/exercises/armstrong-numbers/solutions/clementi","private_iterations_url":"https://exercism.org/uk/tracks/haskell/exercises/armstrong-numbers/iterations"}},{"uuid":"b01f19355645416a9dba609090fc917a","snippet":"module ArmstrongNumbers (armstrong) where import Data.Char (digitToInt) armstrong :: Int -> Bool armstrong n = (sum . map (^digitCounts) $ digits) == n where digitCounts = length . show $ n digits = map digitToInt . show $ n ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":7,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2019-01-17T06:59:03.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"chenyulue"},"exercise":{"title":"Числа Армстронга","icon_url":"https://assets.exercism.org/exercises/armstrong-numbers.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/uk/tracks/haskell/exercises/armstrong-numbers/solutions/chenyulue","private_iterations_url":"https://exercism.org/uk/tracks/haskell/exercises/armstrong-numbers/iterations"}},{"uuid":"d07a473686b14ae69ccb1f01ce065017","snippet":"module ArmstrongNumbers (armstrong) where digits :: Integral x => x -> [x] digits 0 = [] digits x = digits (x `div` 10) ++ [x `mod` 10] armstrong :: Integral a => a -> Bool armstrong n = n == sum [x ^ length (digits n) | x <- digits n] ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":1,"num_loc":6,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2019-02-01T22:55:05.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"WebD-EG"},"exercise":{"title":"Числа Армстронга","icon_url":"https://assets.exercism.org/exercises/armstrong-numbers.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/uk/tracks/haskell/exercises/armstrong-numbers/solutions/WebD-EG","private_iterations_url":"https://exercism.org/uk/tracks/haskell/exercises/armstrong-numbers/iterations"}},{"uuid":"3ea002d225554fc8ab711c6b6cc172a0","snippet":"module ArmstrongNumbers (armstrong) where import Data.Char armstrong :: Int -> Bool armstrong xs = (xs == (sum $ map (\c -> (digitToInt c)^(length (show xs))) (show xs))) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":4,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2019-01-31T21:37:22.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"MJFND"},"exercise":{"title":"Числа Армстронга","icon_url":"https://assets.exercism.org/exercises/armstrong-numbers.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/uk/tracks/haskell/exercises/armstrong-numbers/solutions/MJFND","private_iterations_url":"https://exercism.org/uk/tracks/haskell/exercises/armstrong-numbers/iterations"}},{"uuid":"aef78adb40a54ab4b328426ac9c74d92","snippet":"module ArmstrongNumbers (armstrong) where armstrong :: Integral a => a -> Bool armstrong n = n == (sum $ map (^ length digitList) digitList) where digitList = getDigitList n getDigitList :: Integral a => a -> [a] getDigitList n = if (n < 10) then [n] else (mod n 10):(getDigitList $ div n 10) ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":6,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2019-02-17T05:21:26.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"scottviteri"},"exercise":{"title":"Числа Армстронга","icon_url":"https://assets.exercism.org/exercises/armstrong-numbers.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/uk/tracks/haskell/exercises/armstrong-numbers/solutions/scottviteri","private_iterations_url":"https://exercism.org/uk/tracks/haskell/exercises/armstrong-numbers/iterations"}},{"uuid":"5c68849578304e1691ed23ed69d689ec","snippet":"module ArmstrongNumbers (armstrong) where numLen :: Integral a => a -> Integer -> Integer numLen n len | n <= 0 = len | otherwise = numLen (quot n 10) (len + 1) loop :: Integral a => a -> a -> Integer -> a loop n res len | n <= 0 = res ","num_views":0,"num_stars":0,"num_comments":0,"representation_num_published_solutions":1,"num_iterations":2,"num_loc":12,"iteration_status":"no_automated_feedback","published_iteration_head_tests_status":"passed","published_at":"2019-02-27T10:47:07.000Z","is_out_of_date":false,"language":"haskell","author":{"handle":"doueng"},"exercise":{"title":"Числа Армстронга","icon_url":"https://assets.exercism.org/exercises/armstrong-numbers.svg"},"track":{"title":"Haskell","icon_url":"https://assets.exercism.org/tracks/haskell.svg","highlightjs_language":"haskell"},"links":{"public_url":"https://exercism.org/uk/tracks/haskell/exercises/armstrong-numbers/solutions/doueng","private_iterations_url":"https://exercism.org/uk/tracks/haskell/exercises/armstrong-numbers/iterations"}}],"meta":{"current_page":1,"total_count":672,"total_pages":28,"unscoped_total":672}}}}}

Мовні треки

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

Подорож

ОбранеНове

Переваги Exercism

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

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

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

Discord

Форум

З чого почати

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

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

Учасники

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

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

Про Exercism

Наш вплив

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

Інсайдери