Submission #3786360


Source Code Expand

A, B = input().split()
base = [0] * 20
for i in range(1, 20):
  base[i] = 2 * 10 ** (i - 1) + 8 * base[i - 1]
def forbidden(N):
  cnt = 0
  for i, n in enumerate(N):
    n = int(n)
    if n < 4:
      cnt += base[len(N) - i - 1] * n
    elif n == 4:
      cnt += base[len(N) - i - 1] * 4 + (int(N[i + 1:]) if i < len(N) - 1 else 0) + 1
      break
    elif n < 9:
      cnt += base[len(N) - i - 1] * (n - 1) + 10 ** (len(N) - i - 1)
    elif n == 9:
      cnt += base[len(N) - i - 1] * 8 + 10 ** (len(N) - i - 1) + (int(N[i + 1:]) if i < len(N) - 1 else 0) + 1
      break
  return cnt
print(forbidden(B) - forbidden(A) + (1 if '4' in A or '9' in A else 0))

Submission Info

Submission Time
Task D - 禁止された数字
User nooka
Language Python (3.4.3)
Score 100
Code Size 676 Byte
Status AC
Exec Time 18 ms
Memory 3064 KB

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 30 / 30 70 / 70
Status
AC × 4
AC × 16
AC × 39
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 AC 18 ms 3064 KB
subtask1_05.txt AC 18 ms 3064 KB
subtask1_06.txt AC 18 ms 3064 KB
subtask1_07.txt AC 18 ms 3064 KB
subtask1_08.txt AC 18 ms 3064 KB
subtask1_09.txt AC 18 ms 3064 KB
subtask1_10.txt AC 18 ms 3064 KB
subtask1_11.txt AC 18 ms 3064 KB
subtask1_12.txt AC 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 AC 18 ms 3064 KB
subtask2_04.txt AC 18 ms 3064 KB
subtask2_05.txt AC 18 ms 3064 KB
subtask2_06.txt AC 18 ms 3064 KB
subtask2_07.txt AC 18 ms 3064 KB
subtask2_08.txt AC 18 ms 3064 KB
subtask2_09.txt AC 18 ms 3064 KB
subtask2_10.txt AC 18 ms 3064 KB
subtask2_11.txt AC 18 ms 3064 KB
subtask2_12.txt AC 18 ms 3064 KB
subtask2_13.txt AC 18 ms 3064 KB
subtask2_14.txt AC 18 ms 3064 KB
subtask2_15.txt AC 18 ms 3064 KB
subtask2_16.txt AC 18 ms 3064 KB
subtask2_17.txt AC 18 ms 3064 KB
subtask2_18.txt AC 18 ms 3064 KB
subtask2_19.txt AC 18 ms 3064 KB
subtask2_20.txt AC 18 ms 3064 KB
subtask2_21.txt AC 18 ms 3064 KB
subtask2_22.txt AC 18 ms 3064 KB