Submission #978012


Source Code Expand

a, b = map(int, input().split())

def f(n):
    dp = [[0] * 2 for i in range(len(n)+1)]
    dp[0][1] = 1
    for i in range(len(n)):
        for j in range(2):
            if(j == 0):
                dp[i+1][j] += dp[i][j] * 8
            if(j == 1):
                for k in range(int(n[i])+1):
                    if k == 4 or k == 9: continue
                    if k != int(n[i]):
                        dp[i+1][0] += dp[i][j]
                    else:
                        dp[i+1][1] += dp[i][j]
    return sum(dp[len(n)])

print(b-a+1-f(str(b))+f(str(a-1)))

Submission Info

Submission Time
Task D - 禁止された数字
User ferin_tech
Language Python (3.2.3)
Score 100
Code Size 585 Byte
Status AC
Exec Time 102 ms
Memory 8544 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 102 ms 8388 KB
subtask0_sample02.txt AC 80 ms 8368 KB
subtask0_sample03.txt AC 80 ms 8416 KB
subtask0_sample04.txt AC 80 ms 8424 KB
subtask1_01.txt AC 80 ms 8368 KB
subtask1_02.txt AC 82 ms 8416 KB
subtask1_03.txt AC 81 ms 8492 KB
subtask1_04.txt AC 80 ms 8420 KB
subtask1_05.txt AC 81 ms 8496 KB
subtask1_06.txt AC 81 ms 8472 KB
subtask1_07.txt AC 82 ms 8420 KB
subtask1_08.txt AC 80 ms 8420 KB
subtask1_09.txt AC 83 ms 8420 KB
subtask1_10.txt AC 83 ms 8416 KB
subtask1_11.txt AC 83 ms 8412 KB
subtask1_12.txt AC 82 ms 8416 KB
subtask1_13.txt AC 82 ms 8420 KB
subtask2_01.txt AC 82 ms 8368 KB
subtask2_02.txt AC 82 ms 8368 KB
subtask2_03.txt AC 82 ms 8412 KB
subtask2_04.txt AC 80 ms 8420 KB
subtask2_05.txt AC 82 ms 8368 KB
subtask2_06.txt AC 80 ms 8544 KB
subtask2_07.txt AC 82 ms 8420 KB
subtask2_08.txt AC 81 ms 8420 KB
subtask2_09.txt AC 82 ms 8420 KB
subtask2_10.txt AC 80 ms 8420 KB
subtask2_11.txt AC 82 ms 8452 KB
subtask2_12.txt AC 81 ms 8420 KB
subtask2_13.txt AC 81 ms 8392 KB
subtask2_14.txt AC 82 ms 8420 KB
subtask2_15.txt AC 82 ms 8368 KB
subtask2_16.txt AC 80 ms 8416 KB
subtask2_17.txt AC 82 ms 8420 KB
subtask2_18.txt AC 82 ms 8420 KB
subtask2_19.txt AC 82 ms 8416 KB
subtask2_20.txt AC 81 ms 8420 KB
subtask2_21.txt AC 81 ms 8420 KB
subtask2_22.txt AC 81 ms 8500 KB