solve a flippo by using t [2,2,7,1]

Solving 24 flippo's

import Data.List

t :: [Double] -> [[Char]]
t f  = 
		let 
			perms = permutations f
			opers =	[("+", (+)), ("-", (-)), ("*", (*)), ("/" ,(/))]
		in
			["(((" ++ (show $ truncate a) ++ n1 ++ (show $ truncate b) ++ ")" ++ n2 ++ (show $ truncate c) ++ ")" ++ n3 ++ (show $ truncate d) ++ ")" |
									 [a ,b ,c ,d ] <- perms,
									 (n1, op1) <- opers, (n2, op2) <- opers, (n3,op3) <- opers,
									 (op3 (op2 (op1 a b) c) d) == 24]



allflippos = [[a,b,c,d] | a <- [0..9], b <- [0..9], c <- [0..9], d <-[0..9],
				  length (t [a,b,c,d]) > 0]