Onnenluku

input/code.hs:3:1: Warning:
    Top-level binding with no type signature:
      h :: forall a. (Num a, Ord a, Read a, Show a) => a -> a -> a -> Int

input/code.hs:3:5: Warning: Defined but not used: `x'

input/code.hs:3:7: Warning: Defined but not used: `y'

input/code.hs:25:1: Warning:
    Top-level binding with no type signature:
      f :: forall a. (Num a, Ord a, Read a, Show a) => a -> a -> a -> Int

input/code.hs:25:5: Warning: Defined but not used: `x'

input/code.hs:25:7: Warning: Defined but not used: `y'

input/code.hs:47:1: Warning:
    Top-level binding with no type signature:
      g :: forall a a1. (Integral a1, Num a, Ord a) => a -> a -> a1

input/code.hs:51:1: Warning: Defined but not used: `brute'

input/code.hs:51:1: Warning:
    Top-level binding with no type signature:
      brute :: forall t. (Enum t, Num t, Show t) => t -> [t]

input/code.hs:54:1: Warning:
    Top-level binding with no type signature:
      calc :: forall a.
              (Enum a, Num a, Ord a, R...

import Data.List

h 0 x y = 1
h n x y
  | n <= 9 = length [d | d <- [x,y], d <= n]
  | otherwise =
  let s = show n
      d = read [s !! 0]
      xres =  if x < d then
                2^(length s - 1)
              else if x == d then
                if n - x*10^(length s - 1) >= x*10^(length s - 2) then
                  h (n - x*10^(length s - 1)) x y
                else 0
              else 0
      yres = if y < d then
                2^(length s - 1)
             else if y == d then
                if n - y*10^(length s - 1) >= x*10^(length s - 2) then
                  h (n - y*10^(length s - 1)) x y
                else 0
             else 0 in
      xres + yres

f 0 x y = 0
f n x y
  | n <= 9 = length [d | d <- [x,y], d <= n]
  | otherwise =
  let s = show n
      d = read [s !! 0]
      xres =  if x < d then
                2^(length s - 1)
              else if x == d then
                if n - x*10^(length s - 1) >= x*10^(length s - 2) then
                  h (n - x*10^(length s - 1)) x y
                else 0
              else 0
      yres = if y < d then
                2^(length s - 1)
             else if y == d then
                if n - y*10^(length s - 1) >= x*10^(length s - 2) then
                  h (n - y*10^(length s - 1)) x y
                else 0
             else 0 in
      xres + yres + 2^(length s) - 2

g n x =
  let ks = takeWhile (\k -> x*10^k <= 9*n + x) [0..] in
  last ks

brute n =
  [k | k <- [1..n], let s = sort (show k), s !! 0 /= '0', length (group s) == 2]

calc a b =
  sum [f b x y - f (a-1) x y | x <- [1..8], y <- [x+1..9]] - 8*sum [g b x - g (a-1) x | x <- [1..9]]


main = do
    line <- getLine
    let [a,b] = map read (words line) :: [Integer]
    let res = calc a b
    putStrLn (show res)

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: ACCEPTED

Test 4

Group: 1

Verdict: ACCEPTED

Test 5

Group: 1

Verdict: ACCEPTED

Test 6

Group: 2

Verdict: ACCEPTED

Test 7

Group: 2

Verdict: ACCEPTED

Test 8

Group: 2

Verdict: ACCEPTED

Test 9

Group: 2

Verdict: ACCEPTED

Test 10

Group: 2

Verdict: ACCEPTED

Test 11

Group: 3

Verdict: ACCEPTED

Test 12

Group: 3

Verdict: ACCEPTED

Test 13

Group: 3

Verdict: ACCEPTED

Test 14

Group: 3

Verdict: ACCEPTED

Test 15

Group: 3

Verdict: ACCEPTED