Submission #1693784

Source Code Expand

import Data.List
import Data.Bool

main = putStrLn . bool "No" "Yes" . solve . map read . words =<< getLine

solve :: [Int] -> Bool
solve [n,m,k] = any (==k) $ map (\x -> (n+m-x) * x - x*(x-1)) [0..min n m]

Submission Info

Submission Time
Task B - fLIP
User hsanno
Language Haskell (GHC 7.10.3)
Score 0
Code Size 214 Byte
Status WA
Exec Time 2 ms
Memory 508 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 200
Status
AC × 3
WA × 1
AC × 17
WA × 10
Set Name Test Cases
Sample s1.txt, s2.txt, s3.txt, s4.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, s1.txt, s2.txt, s3.txt, s4.txt
Case Name Status Exec Time Memory
01.txt WA 2 ms 508 KB
02.txt WA 2 ms 508 KB
03.txt AC 2 ms 508 KB
04.txt AC 2 ms 508 KB
05.txt AC 2 ms 508 KB
06.txt AC 2 ms 508 KB
07.txt WA 2 ms 508 KB
08.txt AC 2 ms 508 KB
09.txt AC 2 ms 508 KB
10.txt AC 2 ms 508 KB
11.txt AC 2 ms 508 KB
12.txt AC 2 ms 508 KB
13.txt WA 2 ms 508 KB
14.txt WA 2 ms 508 KB
15.txt WA 2 ms 508 KB
16.txt WA 2 ms 508 KB
17.txt WA 2 ms 508 KB
18.txt AC 2 ms 508 KB
19.txt AC 2 ms 508 KB
20.txt WA 2 ms 508 KB
21.txt AC 2 ms 508 KB
22.txt AC 2 ms 508 KB
23.txt AC 2 ms 508 KB
s1.txt AC 2 ms 508 KB
s2.txt AC 2 ms 508 KB
s3.txt WA 2 ms 508 KB
s4.txt AC 2 ms 508 KB