Submission #1127330


Source Code Expand

module Main where
import Control.Monad
import Control.Applicative
import Data.Maybe
import Data.List
import qualified Text.Printf
import qualified Data.ByteString.Char8 as BC
import qualified Data.ByteString as BC

------------------------------------------

main :: IO ()
main = do
  [k, s] <- readInts
  let twoSums = [max 0 $ min (x+1) (2*k+1-x) | x <- [0..s]]
  print $ sum $ drop (s-k) twoSums

------------------------------------------

{- Int input -}

parseInt :: BC.ByteString -> Int
parseInt = fst . fromJust . BC.readInt

parseInts :: BC.ByteString -> [Int]
parseInts = map parseInt <$> BC.words

readInt :: IO Int
readInt = parseInt <$> BC.getLine

readInts :: IO [Int]
readInts = parseInts <$> BC.getLine

{- Double Formatting -}

doubleFmt :: Double -> String
doubleFmt = Text.Printf.printf "%.12f"

Submission Info

Submission Time
Task B - Sum of Three Integers
User lrmystp
Language Haskell (GHC 7.10.3)
Score 200
Code Size 851 Byte
Status AC
Exec Time 2 ms
Memory 892 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 2
AC × 10
Set Name Test Cases
Sample sample_01.txt, sample_02.txt
All sample_01.txt, sample_02.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt
Case Name Status Exec Time Memory
sample_01.txt AC 1 ms 380 KB
sample_02.txt AC 1 ms 508 KB
subtask_1_01.txt AC 2 ms 892 KB
subtask_1_02.txt AC 1 ms 380 KB
subtask_1_03.txt AC 2 ms 892 KB
subtask_1_04.txt AC 2 ms 764 KB
subtask_1_05.txt AC 1 ms 508 KB
subtask_1_06.txt AC 1 ms 508 KB
subtask_1_07.txt AC 2 ms 764 KB
subtask_1_08.txt AC 1 ms 508 KB