Käännöt

input/code.hs:6:1: Warning:
    Top-level binding with no type signature: maxN :: Int

input/code.hs:6:10: Warning:
    Defaulting the following constraint(s) to type `Integer'
      (Integral b0) arising from a use of `^' at input/code.hs:6:10
      (Num b0) arising from the literal `5' at input/code.hs:6:11
    In the expression: 10 ^ 5
    In an equation for `maxN': maxN = 10 ^ 5

input/code.hs:8:1: Warning:
    Top-level binding with no type signature: main :: IO ()

input/code.hs:19:22: Warning:
    This binding for `sum' shadows the existing binding
      imported from `Data.List' at input/code.hs:4:1-16

input/code.hs:31:7: Warning:
    Defaulting the following constraint(s) to type `Integer'
      (Integral b0) arising from a use of `^' at input/code.hs:31:7
      (Num b0) arising from the literal `9' at input/code.hs:31:8
    In the first argument of `(+)', namely `10 ^ 9'
    In the expression: 10 ^ 9 + 7
    In an equation for `m': m = 10 ^ 9 + 7

input/code.hs:44:17: Warni...

import Data.Array.Unboxed
import Data.Char
import Data.Int
import Data.List

maxN = 10^5

main = do
  xs <- fmap (reverse . map digitToInt . filter isDigit) getContents
  let n = genericLength xs :: Integer
  let xs_a :: UArray Int Int64
      xs_a = listArray (0,fromIntegral n-1) $ map fromIntegral xs
  print n
  print xs_a
  print (map pow10 [0..10])
  print (map pow10_range [0..10])
  let t :: UArray Int Int64
      t = listArray (0, fromIntegral (n+1)`div`2) . map (fromIntegral . fst) . genericTake n
        $ iterate (\(sum,i) -> ((sum+pow10_range(n-i-1)-pow10_range(i-1)+m)`mod`m,i+1)) (pow10_range (n-1), 1)
  let t2::Integer->Integer; t2 i = fromIntegral $ t ! fromIntegral (min i (n-i-1))
  print (map t2 [0..n-1])
  let pairs::Integer->Integer; pairs 0 = 0; pairs k = ((k-1)*(k-2)`div`2 + k-1)`mod`m
  let f1 :: Integer -> Integer; f1 k = fromIntegral (xs_a!fromIntegral k) * pow10 k * fromIntegral (pairs(k+1) + pairs(n-k))
  let f2 :: Integer -> Integer; f2 k = fromIntegral (xs_a!fromIntegral k) * t2 k
  let s = foldl' (\acc k -> (acc+f1 k+f2 k)`mod`m) 0 [0..n-1]
  print (map f1 [0..n-1])
  print (map f2 [0..n-1])
  print s

m :: Integral a => a
m = 10^9+7

pow10 :: Integer -> Integer
pow10 k = fromIntegral $ pow10_a ! fromIntegral k

pow10_range :: Integer -> Integer
pow10_range k = fromIntegral $ pow10_range_a ! fromIntegral k

pow10_a :: UArray Int Int64
pow10_a = listArray (0, maxN) . take maxN $ iterate (\n -> n*10`mod`m) 1

pow10_range_a :: UArray Int Int64
pow10_range_a = listArray (0, maxN) . map (fromIntegral . fst) . take maxN
   $ iterate (\(sum,i) -> ((sum+pow10 i)`mod`m,i+1)) (1,1)

Test 1

Group: 1

Verdict: WRONG ANSWER

Test 2

Group: 1

Verdict: WRONG ANSWER

Test 3

Group: 1

Verdict: WRONG ANSWER

Test 4

Group: 1

Verdict: WRONG ANSWER

Test 5

Group: 1

Verdict: WRONG ANSWER

Test 6

Group: 2

Verdict: WRONG ANSWER

Test 7

Group: 2

Verdict: WRONG ANSWER

Test 8

Group: 2

Verdict: WRONG ANSWER

Test 9

Group: 2

Verdict: WRONG ANSWER

Test 10

Group: 2

Verdict: WRONG ANSWER

Test 11

Group: 3

Verdict: WRONG ANSWER

Test 12

Group: 3

Verdict: WRONG ANSWER

Test 13

Group: 3

Verdict: WRONG ANSWER

Test 14

Group: 3

Verdict: WRONG ANSWER

Test 15

Group: 3

Verdict: WRONG ANSWER