Relación 9 - Historial de revisiones

Mdelamor en 15:31 10 dic 2021

2021-12-10T15:31:40Z

← Revisión anterior		Revisión del 15:31 10 dic 2021
Línea 13:		Línea 13:
	import Data.List		import Data.List
	-- El siguiente módulo hay que instalarlo:		-- El siguiente módulo hay que instalarlo:
	--cabal install ~~Primes~~		--cabal install primes
	import Data.Numbers.Primes		import Data.Numbers.Primes
	-- ----------------------------------------------------------------------------		-- ----------------------------------------------------------------------------

10.100.151.136 en 08:42 10 dic 2021

2021-12-10T08:42:47Z

← Revisión anterior		Revisión del 08:42 10 dic 2021
Línea 456:		Línea 456:
	where f (x,i) recu \| x == maximum i = [x] ++ recu		where f (x,i) recu \| x == maximum i = [x] ++ recu
	\| otherwise = recu		\| otherwise = recu
			-- Adolfo Sagrera
			permanentes xs = [ head xs \| xs <- (init (tails xs)), head xs == maximum xs]
	-- ---------------------------------------------------------------------		-- ---------------------------------------------------------------------
	-- Ejercicio 8. Un número entero positivo n es muy primo si es n primo		-- Ejercicio 8. Un número entero positivo n es muy primo si es n primo

217.217.83.149 en 16:24 8 dic 2021

2021-12-08T16:24:25Z

← Revisión anterior		Revisión del 16:24 8 dic 2021
Línea 30:		Línea 30:
	-- -----------------------------------------------------------------------------		-- -----------------------------------------------------------------------------

	-- Elsa Domínguez		-- Elsa Domínguez, Adolfo Sagrera Vivancos
	resultadoPosC :: (a -> Integer) -> [a] -> [a]		resultadoPosC :: (a -> Integer) -> [a] -> [a]
	resultadoPosC f xs = [x \| x <- xs, f x > 0]		resultadoPosC f xs = [x \| x <- xs, f x > 0]
Línea 64:		Línea 64:
	-- ----------------------------------------------------------------------------		-- ----------------------------------------------------------------------------

	-- Elsa Domínguez		-- Elsa Domínguez, Adolfo Sagrera Vivancos
	intercalaC :: Int -> [Int] -> [Int]		intercalaC :: Int -> [Int] -> [Int]
	intercalaC y xs = concat [if x<y then [y,x] else [x] \| x <- xs]		intercalaC y xs = concat [if x<y then [y,x] else [x] \| x <- xs]
Línea 181:		Línea 181:
	dec2ent4' xs = foldr f 0 $ zip xs [((length xs)-1),((length xs)-2)..0]		dec2ent4' xs = foldr f 0 $ zip xs [((length xs)-1),((length xs)-2)..0]
	where f (x,p) recu = x*(10^p) + recu		where f (x,p) recu = x*(10^p) + recu
			-- Adolfo Sagrera Vivancos
			dec2ent xs = sum [ x*10^y \| (x,y) <- agrupa xs]
			agrupa xs = zip xs (reverse[0..length xs-1])
			dec2entOS xs = sum (map f (agrupa xs)) where f (x,y) = x*10^y
			dec2entR [] = 0
			dec2entR (x:xs) = x*10^(length xs) + dec2entR xs

			dec2entP xs = foldr f 0 ys where f (x,y) recu = x*10^y + recu
			ys = zip xs (reverse[0..length xs-1])
	-- ----------------------------------------------------------------------------		-- ----------------------------------------------------------------------------
	-- Ejercicio 4. Se considera la función		-- Ejercicio 4. Se considera la función
Línea 199:		Línea 207:
	-- ----------------------------------------------------------------------------		-- ----------------------------------------------------------------------------

	-- Elsa Domínguez		-- Elsa Domínguez, Adolfo Sagrera Vivancos
	diferenciaC :: Eq a => [a] -> [a] -> [a]		diferenciaC :: Eq a => [a] -> [a] -> [a]
	diferenciaC xs ys = [x \| x <- xs, notElem x ys]		diferenciaC xs ys = [x \| x <- xs, notElem x ys]
Línea 253:		Línea 261:
	-- ----------------------------------------------------------------------------		-- ----------------------------------------------------------------------------

	--José Manuel García		--José Manuel García, Adolfo Sagrera Vivancos
	primerosYultimos1 :: [[a]] -> ([a], [a])		primerosYultimos1 :: [[a]] -> ([a], [a])
	primerosYultimos1 xss = ([head x \| x <- xss, not (null x)], [last x \| x <- xss, not (null x)])		primerosYultimos1 xss = ([head x \| x <- xss, not (null x)], [last x \| x <- xss, not (null x)])

78.30.20.125 en 10:42 4 dic 2021

2021-12-04T10:42:21Z

← Revisión anterior		Revisión del 10:42 4 dic 2021
Línea 136:		Línea 136:

	-- Adriana Gordillo, Elsa Domínguez		-- Adriana Gordillo, Elsa Domínguez
	dec2entC xs = sum[ x*10^e\|(x,e)<- zip (reverse ~~xs)~~ [0..length xs-1]]		dec2entC :: [Integer] -> Integer
			dec2entC xs = sum [x*10^i \| (x,i) <- zip xs (reverse [0..length xs-1])]

	dec2entS xs =sum( map f ( zip xs [~~n,n~~-1~~..0~~]))		dec2entS :: [Integer] -> Integer
	where ~~n= length xs-1~~		dec2entS xs = sum (map f (zip xs (reverse [0..length xs-1])))
	f (x,i) = x*10^i		where f (x,i) = x*10^i

			dec2entR :: [Integer] -> Integer
	dec2entR [] = 0		dec2entR [] = 0
	dec2entR (x:xs) = x*10^(length xs) + dec2entR xs		dec2entR (x:xs) = x*10^(length xs) + dec2entR xs

	~~dec2entP~~ xs = foldr f 0 ( zip xs [~~n,n-1~~..~~0])~~		dec2entPR :: [Integer] -> Integer
	~~where n=~~ length xs-1		dec2entPR xs = foldr f 0 (zip xs (reverse [0..length xs-1]))
	f (x,i) recu = x*10^i + recu		where f (x,i) recu = x*10^i + recu

	-- Juan José Calero Vela:		-- Juan José Calero Vela:

78.30.20.125 en 10:41 4 dic 2021

2021-12-04T10:41:25Z

← Revisión anterior		Revisión del 10:41 4 dic 2021
Línea 161:		Línea 161:
	where f (x,i) = x * 10^i		where f (x,i) = x * 10^i
	n = length xs		n = length xs



	--Manuel Alcaide		--Manuel Alcaide
Línea 434:		Línea 432:

	permanentesS :: [Int] -> [Int]		permanentesS :: [Int] -> [Int]
	permanentesS xs = filter p xs		permanentesS xs = map fst (filter p (zip xs (tails xs)))
	where p x = x == maximum ~~(dropWhile (/=x) xs)~~		where p (x,i) = x == maximum i

	permanentesR :: [Int] -> [Int]		permanentesR :: [Int] -> [Int]
	permanentesR [] = []		permanentesR [] = []
Línea 444:		Línea 442:

	permanentesPR :: [Int] -> [Int]		permanentesPR :: [Int] -> [Int]
	permanentesPR ~~(x:~~xs) = foldr f [] (x:xs)		permanentesPR xs = foldr f [] (zip xs (tails xs))
	where f x recu \| x >= maximum~~' (dropWhile (/=x) xs)~~ = [x] ++ recu		where f (x,i) recu \| x == maximum i = [x] ++ recu
	\| otherwise = recu		\| otherwise = recu
	~~maximum' xs \| null xs = 0~~
	~~\| otherwise = maximum xs~~

	-- ---------------------------------------------------------------------		-- ---------------------------------------------------------------------

Mdelamor en 09:52 3 dic 2021

2021-12-03T09:52:34Z

← Revisión anterior		Revisión del 09:52 3 dic 2021
Línea 160:		Línea 160:
	dec2entS xs = sum (map f (zip xs [n-1,n-2..0]))		dec2entS xs = sum (map f (zip xs [n-1,n-2..0]))
	where f (x,i) = x * 10^i		where f (x,i) = x * 10^i
	n = length xs -1		n = length xs

46.6.228.174 en 09:50 3 dic 2021

2021-12-03T09:50:36Z

← Revisión anterior		Revisión del 09:50 3 dic 2021
Línea 137:		Línea 137:
	-- Adriana Gordillo, Elsa Domínguez		-- Adriana Gordillo, Elsa Domínguez
	dec2entC xs = sum[ x*10^e\|(x,e)<- zip (reverse xs) [0..length xs-1]]		dec2entC xs = sum[ x*10^e\|(x,e)<- zip (reverse xs) [0..length xs-1]]
	dec2entS xs =sum( map f ( zip xs [n-1,n-2..0]))
			dec2entS xs =sum( map f ( zip xs [n,n-1..0]))
	where n= length xs-1		where n= length xs-1
	f (x,i) = x*10^i		f (x,i) = x*10^i

10.100.151.223 en 09:48 3 dic 2021

2021-12-03T09:48:43Z

← Revisión anterior		Revisión del 09:48 3 dic 2021
Línea 135:		Línea 135:
	where f prim recu = show prim :recu		where f prim recu = show prim :recu

	-- Elsa Domínguez		-- Adriana Gordillo, Elsa Domínguez
	~~dec2entC :: [Integer] -> Integer~~		dec2entC xs = sum[ x*10^e\|(x,e)<- zip (reverse xs) [0..length xs-1]]
	dec2entC xs = sum [x*10^i \| (x,i) <- zip xs (reverse [0..length xs-1])]		dec2entS xs =sum( map f ( zip xs [n-1,n-2..0]))
			where n= length xs-1
			f (x,i) = x*10^i
			dec2entR [] = 0
			dec2entR (x:xs) = x*10^(length xs) + dec2entR xs

	~~dec2entS :: [Integer] -> Integer~~		dec2entP xs = foldr f 0 ( zip xs [n,n-1..0])
	~~dec2entS~~ xs = ~~sum~~ (~~map f~~ xs)		where n= length xs-1
	where f x = x*10^~~(length (dropWhile (/=x) xs) -1)~~		f (x,i) recu = x*10^i + recu

	-- Juan José Calero Vela:		-- Juan José Calero Vela:
Línea 157:		Línea 161:
	n = length xs -1		n = length xs -1

	~~dec2entR :: [Integer] -> Integer~~
	~~dec2entR [] = 0~~
	~~dec2entR (x:xs) = x*10^(length xs) + dec2entR xs~~

	~~dec2entPR :: [Integer] -> Integer~~
	~~dec2entPR xs = foldr f 0 xs~~
	~~where f x recu = x*10^(length (dropWhile (/=x) xs) -1) + recu~~

	--Manuel Alcaide		--Manuel Alcaide

Manalcgar en 09:46 3 dic 2021

2021-12-03T09:46:59Z

← Revisión anterior		Revisión del 09:46 3 dic 2021
Línea 164:		Línea 164:
	dec2entPR xs = foldr f 0 xs		dec2entPR xs = foldr f 0 xs
	where f x recu = x*10^(length (dropWhile (/=x) xs) -1) + recu		where f x recu = x*10^(length (dropWhile (/=x) xs) -1) + recu

			--Manuel Alcaide

			dec2ent1' :: [Integer] -> Integer
			dec2ent1' xs = sum[x*(10^y)\|(x,y)<-(zip xs [((length (xs))-1),((length (xs))-2)..0])]

			dec2ent2' :: [Integer] -> Integer
			dec2ent2' xs = sum (map f (zip xs [((length (xs))-1),((length (xs))-2)..0]))
			where f (x,y) = x*(10^y)

			dec2ent3' :: [Integer] -> Integer
			dec2ent3' [] = 0
			dec2ent3' (x:xs) = x*(10^((length (x:xs))-1)) + dec2ent3 xs

			dec2ent4' :: [Integer] -> Integer
			dec2ent4' xs = foldr f 0 $ zip xs [((length xs)-1),((length xs)-2)..0]
			where f (x,p) recu = x*(10^p) + recu

	-- ----------------------------------------------------------------------------		-- ----------------------------------------------------------------------------

31.4.245.17 en 09:42 3 dic 2021

2021-12-03T09:42:14Z

← Revisión anterior		Revisión del 09:42 3 dic 2021
Línea 142:		Línea 142:
	dec2entS xs = sum (map f xs)		dec2entS xs = sum (map f xs)
	where f x = x*10^(length (dropWhile (/=x) xs) -1)		where f x = x*10^(length (dropWhile (/=x) xs) -1)

			-- Juan José Calero Vela:

			pos :: Integer -> [Integer] -> Integer
			pos x [] = 0
			pos x (y:xs) = if x==y then 1 else 1 + pos x xs

			dec2entC :: [Integer] -> Integer
			dec2entC xs = sum [ x*(10^(pos x (reverse xs)-1)) \| x<-xs]

	-- profesor: solución vista en clase		-- profesor: solución vista en clase