Submission #2653751


Source Code Expand

from itertools import count, takewhile
from functools import lru_cache
 
@lru_cache(maxsize=None)
def dfs(n):
  if n == 0: return 0
  
  max9 = max(takewhile(lambda x: x<=n, (9**i for i in count())))
  max6 = max(takewhile(lambda x: x<=n, (6**i for i in count())))
  return min(dfs(n-max9), dfs(n-max6))+1
 
print(dfs(int(input())))

Submission Info

Submission Time
Task C - Strange Bank
User zehnpaard
Language Python (3.4.3)
Score 300
Code Size 343 Byte
Status AC
Exec Time 24 ms
Memory 3572 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 19
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 AC 24 ms 3572 KB
02.txt AC 24 ms 3572 KB
03.txt AC 24 ms 3572 KB
04.txt AC 23 ms 3572 KB
05.txt AC 24 ms 3572 KB
06.txt AC 23 ms 3572 KB
07.txt AC 23 ms 3572 KB
08.txt AC 23 ms 3572 KB
09.txt AC 23 ms 3572 KB
10.txt AC 23 ms 3572 KB
11.txt AC 23 ms 3572 KB
12.txt AC 23 ms 3572 KB
13.txt AC 23 ms 3572 KB
14.txt AC 23 ms 3572 KB
15.txt AC 23 ms 3572 KB
16.txt AC 24 ms 3572 KB
sample_01.txt AC 23 ms 3572 KB
sample_02.txt AC 23 ms 3572 KB
sample_03.txt AC 24 ms 3572 KB