Submission #3116376

Source Code Expand

n, k = map(int, input().split())
ans = (n // k) ** 3
if k % 2 == 0:
  ans += (n // k + (1 if (n % k >= k // 2) else 0)) ** 3
print(ans)

Submission Info

Submission Time
Task C - Triangular Relationship
User rankey55
Language Python (3.4.3)
Score 300
Code Size 139 Byte
Status AC
Exec Time 17 ms
Memory 2940 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 4
AC × 18
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, s1.txt, s2.txt, s3.txt, s4.txt
Case Name Status Exec Time Memory
01.txt AC 17 ms 2940 KiB
02.txt AC 17 ms 2940 KiB
03.txt AC 17 ms 2940 KiB
04.txt AC 17 ms 2940 KiB
05.txt AC 17 ms 2940 KiB
06.txt AC 17 ms 2940 KiB
07.txt AC 17 ms 2940 KiB
08.txt AC 17 ms 2940 KiB
09.txt AC 17 ms 2940 KiB
10.txt AC 17 ms 2940 KiB
11.txt AC 17 ms 2940 KiB
12.txt AC 17 ms 2940 KiB
13.txt AC 17 ms 2940 KiB
14.txt AC 17 ms 2940 KiB
s1.txt AC 17 ms 2940 KiB
s2.txt AC 17 ms 2940 KiB
s3.txt AC 17 ms 2940 KiB
s4.txt AC 17 ms 2940 KiB