Submission #3730026
Source Code Expand
# [0, n] def count(n): cnt = 0 n = list(str(n)) n.reverse() for i, m in enumerate(n): m = int(m) if m < 4: cnt += m * pow10[i] elif m < 8: cnt += (m-1) * pow10[i] + 10**i else: cnt += 7 * pow10[i] + 2 * 10**i return cnt a, b = [int(s) for s in input().rstrip().split()] # [0, 10^0] ~ [0, 10^18] pow10 = [0] for i in range(1, 19): pow10.append(pow10[-1] * 8 + 10**(i-1) * 2) print(count(b) - count(a-1))
Submission Info
Submission Time | |
---|---|
Task | D - 禁止された数字 |
User | kirikirijin |
Language | Python (3.4.3) |
Score | 0 |
Code Size | 521 Byte |
Status | WA |
Exec Time | 18 ms |
Memory | 3064 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 30 | 0 / 70 | ||||||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0_sample01.txt, subtask0_sample02.txt, subtask0_sample03.txt, subtask0_sample04.txt |
Subtask1 | subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask0_sample01.txt, subtask0_sample02.txt, subtask0_sample03.txt |
Subtask2 | subtask0_sample01.txt, subtask0_sample02.txt, subtask0_sample03.txt, subtask0_sample04.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt, subtask2_13.txt, subtask2_14.txt, subtask2_15.txt, subtask2_16.txt, subtask2_17.txt, subtask2_18.txt, subtask2_19.txt, subtask2_20.txt, subtask2_21.txt, subtask2_22.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0_sample01.txt | AC | 18 ms | 3064 KB |
subtask0_sample02.txt | AC | 18 ms | 3064 KB |
subtask0_sample03.txt | AC | 18 ms | 3064 KB |
subtask0_sample04.txt | AC | 18 ms | 3064 KB |
subtask1_01.txt | AC | 18 ms | 3064 KB |
subtask1_02.txt | AC | 18 ms | 3064 KB |
subtask1_03.txt | AC | 18 ms | 3064 KB |
subtask1_04.txt | WA | 18 ms | 3064 KB |
subtask1_05.txt | WA | 18 ms | 3064 KB |
subtask1_06.txt | WA | 18 ms | 3064 KB |
subtask1_07.txt | WA | 18 ms | 3064 KB |
subtask1_08.txt | WA | 18 ms | 3064 KB |
subtask1_09.txt | WA | 18 ms | 3064 KB |
subtask1_10.txt | AC | 18 ms | 3064 KB |
subtask1_11.txt | WA | 18 ms | 3064 KB |
subtask1_12.txt | WA | 18 ms | 3064 KB |
subtask1_13.txt | AC | 18 ms | 3064 KB |
subtask2_01.txt | AC | 18 ms | 3064 KB |
subtask2_02.txt | AC | 18 ms | 3064 KB |
subtask2_03.txt | WA | 18 ms | 3060 KB |
subtask2_04.txt | WA | 18 ms | 3064 KB |
subtask2_05.txt | WA | 18 ms | 3064 KB |
subtask2_06.txt | WA | 18 ms | 3064 KB |
subtask2_07.txt | WA | 18 ms | 3064 KB |
subtask2_08.txt | WA | 18 ms | 3064 KB |
subtask2_09.txt | WA | 18 ms | 3064 KB |
subtask2_10.txt | WA | 18 ms | 3064 KB |
subtask2_11.txt | WA | 18 ms | 3064 KB |
subtask2_12.txt | WA | 18 ms | 3064 KB |
subtask2_13.txt | WA | 18 ms | 3064 KB |
subtask2_14.txt | WA | 18 ms | 3064 KB |
subtask2_15.txt | WA | 18 ms | 3064 KB |
subtask2_16.txt | WA | 18 ms | 3064 KB |
subtask2_17.txt | WA | 18 ms | 3064 KB |
subtask2_18.txt | WA | 18 ms | 3064 KB |
subtask2_19.txt | WA | 18 ms | 3064 KB |
subtask2_20.txt | WA | 18 ms | 3064 KB |
subtask2_21.txt | WA | 18 ms | 3064 KB |
subtask2_22.txt | WA | 18 ms | 3060 KB |