language: Haskell (ghc-6.8.2)
date: 119 days 1 hour ago
link:
visibility: public
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
--答えの出力
printAns :: Integer -> Integer -> IO()
printAns tc s = putStrLn $ ("Case #" ++ (show tc) ++ ": " ++ (show s))
 
-- "HACKERUP"としたのはCを2回数える必要はないから.
f a=foldr min 999$map(\x->if fst x=='C'then snd x`div`2 else snd x)$zip"HACKERUP"$map(\c->sum$map(\x->if x==c then 1 else 0)a)"HACKERUP"
 
solveTC :: Integer -> Integer ->  IO ()
solveTC 0 _ = return ()
solveTC te tc= do 
                line <- getLine
                printAns tc (f line)
                solveTC (te-1) (tc+1)
  
main :: IO ()
main = do 
         line <- getLine
         let tc = (read line :: Integer)
         solveTC tc 1
         
  • upload with new input
  • result: Success     time: 0.02s    memory: 3720 kB     returned value: 0

    5
    WELCOME TO FACEBOOK HACKERCUP
    CUP WITH LABEL HACKERCUP BELONGS TO HACKER
    QUICK CUTE BROWN FOX JUMPS OVER THE LAZY DOG
    MOVE FAST BE BOLD
    HACK THE HACKERCUP
    Case #1: 1
    Case #2: 2
    Case #3: 1
    Case #4: 0
    Case #5: 1