Números con un segmento divisible por su longitud

3 Comentarios

1. Haskell

   import Data.List conUnicoSegmentoDivisible :: Integer -> Bool conUnicoSegmentoDivisible n=length([x|x<-(divisible n),x`mod`p==0])==1 where p=genericLength(digitos6 n) sucUnicoSegmentoDivisible :: [Integer] sucUnicoSegmentoDivisible = [x|x<-[1..],conUnicoSegmentoDivisible x] sub :: Show a => a -> [[Char]] sub n =[xs|xs<-subsequences(show n),xs`isInfixOf`(show n),xs/=""] divisible::Integer->[Integer] divisible n =[read c|c<-(sub n)] digitos6::Integer->[Integer] digitos6 n=[read[c]|c<-show n]

   1 2 3 4 5 6 7 8 9 10 11 12 13 14 15

   import Data.List   conUnicoSegmentoDivisible :: Integer -> Bool conUnicoSegmentoDivisible n=length([x|x<-(divisible n),x`mod`p==0])==1           where p=genericLength(digitos6 n)   sucUnicoSegmentoDivisible :: [Integer]   sucUnicoSegmentoDivisible = [x|x<-[1..],conUnicoSegmentoDivisible x]   sub :: Show a => a -> [[Char]] sub n =[xs|xs<-subsequences(show n),xs`isInfixOf`(show n),xs/=""] divisible::Integer->[Integer] divisible n =[read c|c<-(sub n)] digitos6::Integer->[Integer] digitos6 n=[read[c]|c<-show n]

   Responder

2. Haskell

   import Data.List conUnicoSegmentoDivisible :: Integer -> Bool conUnicoSegmentoDivisible x = genericLength [ n | n <- particiones xs, mod n (genericLength xs) == 0] == 1 where xs = digit x sucUnicoSegmentoDivisible :: [Integer] sucUnicoSegmentoDivisible = [x | x <- [1..], conUnicoSegmentoDivisible x] particiones :: [Integer] -> [Integer] particiones xs = map numero $ filter (/= []) $ sort $ nub $ concat [ inits zs ++ tails zs | zs <- inits xs] numero :: [Integer] -> Integer numero ds = sum [ x*10^n | (x,n) <- zip ds (reverse [0..length ds-1])] digit :: Integer -> [Integer] digit n = [ read [c] | c <- show n]

   1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19

   import Data.List   conUnicoSegmentoDivisible :: Integer -> Bool conUnicoSegmentoDivisible x  =    genericLength [ n | n <- particiones xs, mod n (genericLength xs) == 0] == 1         where xs = digit x   sucUnicoSegmentoDivisible :: [Integer] sucUnicoSegmentoDivisible = [x | x <- [1..], conUnicoSegmentoDivisible x]   particiones :: [Integer] -> [Integer] particiones xs = map numero $ filter (/= []) $ sort $ nub $ concat [ inits zs ++ tails zs | zs <- inits xs]   numero :: [Integer] -> Integer numero ds = sum [ x*10^n | (x,n) <- zip ds (reverse [0..length ds-1])]   digit :: Integer -> [Integer] digit n = [ read [c] | c <- show n]

   Responder

3. Haskell

   unicosegmentodivisible :: Integer -> Bool unicosegmentodivisible n = length zs == 1 where ds = digitos n xss = segmentos ds ys = map listaAnumero xss k = genericLength ys zs = [y | y <- ys, y `mod` k ==0] segmentos :: [a] -> [[a]] segmentos [] = [] segmentos ys@(x:xs) = tail (inits ys) ++ segmentos xs digitos :: Integer -> [Integer] digitos n = [read [x] | x <- show n] listaAnumero :: [Integer] -> Integer listaAnumero xs = sum [x*10^y | (x,y) <- zip (reverse xs) [0..]] segmentos' :: [a] -> [[a]] segmentos' [] = [] segmentos' ys@(x:xs) = [take k ys | k <- [1..n]] ++ segmentos' xs where n = length ys

   1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22

   unicosegmentodivisible :: Integer -> Bool unicosegmentodivisible n = length zs == 1 where ds = digitos n        xss = segmentos ds        ys = map listaAnumero xss        k = genericLength ys        zs = [y | y <- ys, y `mod` k ==0]   segmentos :: [a] -> [[a]] segmentos [] = [] segmentos ys@(x:xs) = tail (inits ys) ++ segmentos xs   digitos :: Integer -> [Integer] digitos n = [read [x] | x <- show n]   listaAnumero :: [Integer] -> Integer listaAnumero xs = sum [x*10^y | (x,y) <- zip (reverse xs) [0..]]   segmentos' :: [a] -> [[a]] segmentos' [] = [] segmentos' ys@(x:xs) = [take k ys | k <- [1..n]] ++ segmentos' xs where n = length ys

   Responder