I am using Haskell to solve problem 99 in euler project, where I must find the maximum result from a list of base exponent pairs.
I came up with this:
prob99 = maximum $ map ((fst)^(snd)) numbers
Where the numbers are in the form:
numbers = [[519432,525806],[632382,518061],[78864,613712]..
Why doesn't this work? Do I need to change the format of the numbers? Is there a simple optimisation here I am not thinking of, like a more efficient method of exponentiation?