Submission #11063750


Source Code Expand

module Main where

import Control.Monad
import qualified Data.List as L

main :: IO ()
main = do
    line <- getLine
    let n = (read line) :: Int
    forM_ (make n) putStrLn

make :: Int -> [String]
make 1 = ["a"]
make n = L.concat $ fmap (\p -> append p) preList
    where
    preList = make (n - 1)

append :: String -> [String]
append s = fmap (\c -> s ++ [c]) ['a' .. next]
    where
    next = succ $ L.maximum s

Submission Info

Submission Time
Task D - String Equivalence
User frkw
Language Haskell (GHC 7.10.3)
Score 400
Code Size 441 Byte
Status AC
Exec Time 64 ms
Memory 2428 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 2
AC × 10
Set Name Test Cases
Sample example0.txt, example1.txt
All 000.txt, 001.txt, 002.txt, 003.txt, 004.txt, 005.txt, 006.txt, 007.txt, example0.txt, example1.txt
Case Name Status Exec Time Memory
000.txt AC 1 ms 508 KiB
001.txt AC 1 ms 508 KiB
002.txt AC 2 ms 508 KiB
003.txt AC 2 ms 764 KiB
004.txt AC 2 ms 1020 KiB
005.txt AC 4 ms 1020 KiB
006.txt AC 13 ms 1148 KiB
007.txt AC 64 ms 2428 KiB
example0.txt AC 1 ms 380 KiB
example1.txt AC 1 ms 380 KiB