Submission #1187501
Source Code Expand
# -*- coding: utf-8 -*- def main(): k, s = map(int, input().split()) answer = solve(k, s) return answer def solve(k, s): count = 0 for i in range(k + 1): v = 0 v += i if v == s: count += 1 continue for j in range(k + 1): v += j if v == s: count += 1 continue for k in range(k + 1): v += k if v == s: count += 1 continue return count print(main())
Submission Info
Submission Time | |
---|---|
Task | B - Sum of Three Integers |
User | tarunama |
Language | Python (3.4.3) |
Score | 0 |
Code Size | 600 Byte |
Status | WA |
Exec Time | 2104 ms |
Memory | 3064 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 200 | ||||||
Status |
|
|
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 | WA | 17 ms | 3064 KB |
sample_02.txt | WA | 17 ms | 3060 KB |
subtask_1_01.txt | TLE | 2104 ms | 3064 KB |
subtask_1_02.txt | TLE | 2104 ms | 3064 KB |
subtask_1_03.txt | TLE | 2104 ms | 3064 KB |
subtask_1_04.txt | TLE | 2104 ms | 3064 KB |
subtask_1_05.txt | WA | 238 ms | 3064 KB |
subtask_1_06.txt | TLE | 2104 ms | 3060 KB |
subtask_1_07.txt | TLE | 2104 ms | 2940 KB |
subtask_1_08.txt | TLE | 2104 ms | 3064 KB |