Submission #8802461
Source Code Expand
#n = int(input()) #n,k = map(int,input().split()) #x = list(map(int,input().split())) #ABC99 C n = int(input()) memo = 1 li3 = [] while(memo<=n): li3.append(memo) memo *= 6 li3.append(memo) memo = 1 while(memo<=n): li3.append(memo) memo *= 9 li3.append(memo) li3 = sorted(li3,reverse = True) i = 0 cnt = 0 while(n >0): if li3[i] <= n: n-=li3[i] cnt += 1 else: i+= 1 print(cnt)
Submission Info
Submission Time | |
---|---|
Task | C - Strange Bank |
User | kato1999 |
Language | Python (3.4.3) |
Score | 0 |
Code Size | 484 Byte |
Status | WA |
Exec Time | 17 ms |
Memory | 3064 KB |
Judge Result
Set Name | Sample | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 300 | ||||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.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, sample_01.txt, sample_02.txt, sample_03.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | WA | 17 ms | 3060 KB |
02.txt | WA | 17 ms | 3060 KB |
03.txt | WA | 17 ms | 3060 KB |
04.txt | AC | 17 ms | 3060 KB |
05.txt | AC | 17 ms | 3060 KB |
06.txt | AC | 17 ms | 3064 KB |
07.txt | AC | 17 ms | 3064 KB |
08.txt | AC | 17 ms | 3060 KB |
09.txt | AC | 17 ms | 3060 KB |
10.txt | AC | 17 ms | 3064 KB |
11.txt | WA | 17 ms | 3060 KB |
12.txt | AC | 17 ms | 3060 KB |
13.txt | WA | 17 ms | 3064 KB |
14.txt | AC | 17 ms | 3060 KB |
15.txt | AC | 17 ms | 3064 KB |
16.txt | WA | 17 ms | 3064 KB |
sample_01.txt | AC | 17 ms | 3060 KB |
sample_02.txt | AC | 17 ms | 3064 KB |
sample_03.txt | WA | 17 ms | 3064 KB |