minimun_of_two.hs

-- Haskell solution to codeabbey challenge 4
import qualified Text.Regex as R

i1 = 30
i2 = "3539875 -2913804 9970403 -1271892 2259745 -5041103 6135274 6702733 -7705887 7333693 9011193 -5815604 -4443223 -3369396 6454782 5927252 8752154 8363617 -4610650 9748221 6825533 -3597316 6931901 7542523 -2603266 9437222 5903501 9517359 -8975159 -2311126 8014504 4564716 4775069 7984907 -6707176 -2965185 -7056195 9428098 -6262451 -4762083 6761791 -7251257 -577687 -7681432 -620653 -4122904 8245820 -1868499 -5759287 -6364830 -2120277 -8933753 37854 -5188376 8608770 7434587 -5751153 4512272 6951946 -4726312"
i3 = R.splitRegex (R.mkRegex " ") i2
count = 0

printStringNTimes 0 = return ()
printStringNTimes n =
    do
        print (minimum[(i3 !! (abs(i1-n)*2)), (i3 !! (abs(i1-n)*2 +1))])
        printStringNTimes (n-1)

main = printStringNTimes i1