Submission #36512675
Source Code Expand
Copy
memo = {}def D(N):if N in memo: return memo[N]if N == 0: return 1ans = D(N // 3) + D(N // 2)memo[N] = ansreturn ansprint(D(int(input())))
memo = {} def D(N): if N in memo: return memo[N] if N == 0: return 1 ans = D(N // 3) + D(N // 2) memo[N] = ans return ans print(D(int(input())))
Submission Info
Submission Time | |
---|---|
Task | D - Yet Another Recursive Function |
User | arakaki_tokyo |
Language | PyPy3 (7.3.0) |
Score | 400 |
Code Size | 175 Byte |
Status | AC |
Exec Time | 60 ms |
Memory | 64096 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 400 / 400 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt |
All | 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 01_test_01.txt, 01_test_02.txt, 01_test_03.txt, 01_test_04.txt, 01_test_05.txt, 01_test_06.txt, 01_test_07.txt, 01_test_08.txt, 01_test_09.txt, 01_test_10.txt, 01_test_11.txt, 01_test_12.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00_sample_01.txt | AC | 60 ms | 61588 KB |
00_sample_02.txt | AC | 47 ms | 61828 KB |
00_sample_03.txt | AC | 46 ms | 61868 KB |
01_test_01.txt | AC | 46 ms | 61644 KB |
01_test_02.txt | AC | 46 ms | 61836 KB |
01_test_03.txt | AC | 48 ms | 61888 KB |
01_test_04.txt | AC | 46 ms | 61644 KB |
01_test_05.txt | AC | 47 ms | 61868 KB |
01_test_06.txt | AC | 51 ms | 64096 KB |
01_test_07.txt | AC | 47 ms | 63324 KB |
01_test_08.txt | AC | 52 ms | 62964 KB |
01_test_09.txt | AC | 51 ms | 63228 KB |
01_test_10.txt | AC | 45 ms | 63404 KB |
01_test_11.txt | AC | 46 ms | 63200 KB |
01_test_12.txt | AC | 47 ms | 63372 KB |