Submission #1532622


Source Code Expand

n = 50
 
main = do
  k <- readLn
  let (p, q) = k `divMod` n
  print n
  putStr . unwords . map show $ (replicate q (p + n - q + 1)) ++ (replicate (n - q) (p - q))

Submission Info

Submission Time
Task D - Decrease (Contestant ver.)
User Gash788
Language Haskell (GHC 7.10.3)
Score 0
Code Size 169 Byte
Status WA
Exec Time 2 ms
Memory 508 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 600
Status
AC × 1
WA × 4
AC × 1
WA × 24
Set Name Test Cases
Sample example0, example1, example2, example3, example4
All corner0, corner1, corner2, corner3, corner4, corner5, corner6, corner7, corner8, corner9, example0, example1, example2, example3, example4, rand0, rand1, rand2, rand3, rand4, rand5, rand6, rand7, rand8, rand9
Case Name Status Exec Time Memory
corner0 WA 2 ms 508 KB
corner1 WA 2 ms 508 KB
corner2 WA 2 ms 508 KB
corner3 WA 2 ms 508 KB
corner4 WA 2 ms 508 KB
corner5 WA 2 ms 508 KB
corner6 WA 1 ms 508 KB
corner7 WA 2 ms 508 KB
corner8 WA 2 ms 508 KB
corner9 WA 2 ms 508 KB
example0 AC 2 ms 508 KB
example1 WA 2 ms 508 KB
example2 WA 2 ms 508 KB
example3 WA 2 ms 508 KB
example4 WA 1 ms 508 KB
rand0 WA 2 ms 508 KB
rand1 WA 2 ms 508 KB
rand2 WA 2 ms 508 KB
rand3 WA 2 ms 508 KB
rand4 WA 2 ms 508 KB
rand5 WA 2 ms 508 KB
rand6 WA 2 ms 508 KB
rand7 WA 2 ms 508 KB
rand8 WA 2 ms 508 KB
rand9 WA 2 ms 508 KB