Submission #9590817
Source Code Expand
import heapq N = int(input()) h = [4, 7] heapq.heapify(h) while True: n = heapq.heappop(h) if n > N: print('No') break if n == N: print('Yes') break heapq.heappush(h, n + 4) heapq.heappush(h, n + 7)
Submission Info
Submission Time | |
---|---|
Task | B - Cakes and Donuts |
User | shioyama18 |
Language | Python (3.4.3) |
Score | 200 |
Code Size | 273 Byte |
Status | AC |
Exec Time | 511 ms |
Memory | 7748 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 200 / 200 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
All | in01.txt, in02.txt, in03.txt, in04.txt, in05.txt, in06.txt, in07.txt, in08.txt, in09.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in20.txt, sample_01.txt, sample_02.txt, sample_03.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
in01.txt | AC | 17 ms | 3060 KB |
in02.txt | AC | 17 ms | 3060 KB |
in03.txt | AC | 18 ms | 3060 KB |
in04.txt | AC | 18 ms | 3060 KB |
in05.txt | AC | 18 ms | 3060 KB |
in06.txt | AC | 17 ms | 3060 KB |
in07.txt | AC | 18 ms | 3060 KB |
in08.txt | AC | 18 ms | 3060 KB |
in09.txt | AC | 17 ms | 3060 KB |
in10.txt | AC | 17 ms | 3060 KB |
in11.txt | AC | 17 ms | 3060 KB |
in12.txt | AC | 17 ms | 3060 KB |
in13.txt | AC | 18 ms | 3060 KB |
in14.txt | AC | 18 ms | 3060 KB |
in15.txt | AC | 17 ms | 3060 KB |
in16.txt | AC | 18 ms | 3060 KB |
in17.txt | AC | 19 ms | 3060 KB |
in18.txt | AC | 28 ms | 3188 KB |
in19.txt | AC | 63 ms | 3652 KB |
in20.txt | AC | 511 ms | 7748 KB |
sample_01.txt | AC | 19 ms | 3060 KB |
sample_02.txt | AC | 18 ms | 3060 KB |
sample_03.txt | AC | 17 ms | 3060 KB |