language: Haskell (ghc-6.8.2)
date: 112 days 5 hours ago
link:
visibility: public 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23

import Data.List
import qualified Data.ByteString.Char8 as BS
 
convertBase :: Integer -> [Integer]
convertBase 0 = []
convertBase n = (mod n  5)  : convertBase ( div n 5 ) 
 
 
 
readInt :: BS.ByteString -> Integer
readInt x = case BS.readInteger x of
              Just ( i , _ ) -> i
              Nothing -> error " upseperable ints "
 
 
solve :: Integer -> Integer 
solve 0 = 1
solve 1 = 1
solve n =  mod ( 6*fst a ) 10 where 
        a = foldl (\(acc , i ) x -> ( mod  ( acc *  product [1..x] * 2^(i*x) ) 10 , i + 1 ) ) ( 1 , 0 ) $ convertBase n 
 
 
main = BS.interact $ BS.unlines. map ( BS.pack . show . solve )  . map readInt. BS.lines
  • upload with new input
  • # 4:   hide   clone   input   112 days 4 hours ago

    result: Success     time: 0.01s    memory: 3616 kB     returned value: 0 

    654654113565465411356546541135654654113565465411356546541135654654113565465411356546541135654654119

    2
  • # 3:   show   clone   input   112 days 4 hours ago    Success
  • # 2:   show   clone   input   112 days 4 hours ago    Success
  • # 1:   show   clone   input   112 days 5 hours ago    Success