Submission #1695320

---

Source Code Expand

import qualified Data.ByteString.Char8 as BC
import Data.Maybe (fromJust)
import Control.Monad
--import Data.Sequence
import Prelude
import System.IO
import Data.List

-- a <- replicateM n readLn
-- mapM_ print $

main = do
    n <- readLn
    a <- replicateM n getLine
    putStrLn $ head $ connect $ zip a [1..n]

connect a = sort [fst x ++ fst y | x <- a, y <- a, snd x /= snd y]

-- リストに関数を適用する。map だと1変数関数しか使えない悲しみ。
--map' :: ([Int] -> Int -> Int -> Int) -> [Int] -> [Int] -> [Int]
map' _ _ [] = []
map' f a (i:is) = f a i 0 : map' f a is

--elemIndex :: Eq a => a -> [a] -> Maybe Int
--- >> elemIndex 3 [1..10]
--Just 2

Submission Info

Judge Result