Submission #899149


Source Code Expand

#include <cstdio>
#include <string>
#include <vector>

using namespace std;

using i64=long long;
using vx=vector<i64>;
using vvx=vector<vx>;
using vvvx=vector<vvx>;

i64 F(i64 N) {
    char buf[20];
    int n=sprintf(buf, "%lld", N);
    string s(buf);

    vvvx dp(n+1, vvx(2, vx(2))); dp[0][0][0]=1;
    for (int i=0; i<n; ++i)
        for (int j=0; j<2; ++j)
            for (int k=0; k<2; ++k) {
                int ub=j? 9:s[i]-'0';
                for (int d=0; d<=ub; ++d)
                    dp[i+1][j||d<ub][k||d==4||d==9] += dp[i][j][k];
            }

    i64 res=0;
    for (int j=0; j<2; ++j)
        res += dp[n][j][1];

    return res;
}

int main() {
    i64 A, B;
    scanf("%lld %lld", &A, &B);
    printf("%lld\n", F(B)-F(A-1));
    return 0;
}

Submission Info

Submission Time
Task D - 禁止された数字
User rsk0315
Language C++11 (GCC 4.8.1)
Score 100
Code Size 803 Byte
Status AC
Exec Time 19 ms
Memory 920 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:35:31: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%lld %lld", &A, &B);
                               ^

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 16 ms 792 KB
subtask0_sample02.txt AC 18 ms 792 KB
subtask0_sample03.txt AC 18 ms 800 KB
subtask0_sample04.txt AC 18 ms 796 KB
subtask1_01.txt AC 17 ms 796 KB
subtask1_02.txt AC 18 ms 796 KB
subtask1_03.txt AC 18 ms 800 KB
subtask1_04.txt AC 17 ms 788 KB
subtask1_05.txt AC 19 ms 792 KB
subtask1_06.txt AC 18 ms 792 KB
subtask1_07.txt AC 18 ms 668 KB
subtask1_08.txt AC 18 ms 800 KB
subtask1_09.txt AC 18 ms 800 KB
subtask1_10.txt AC 19 ms 796 KB
subtask1_11.txt AC 16 ms 800 KB
subtask1_12.txt AC 16 ms 796 KB
subtask1_13.txt AC 18 ms 800 KB
subtask2_01.txt AC 17 ms 788 KB
subtask2_02.txt AC 18 ms 796 KB
subtask2_03.txt AC 18 ms 672 KB
subtask2_04.txt AC 18 ms 796 KB
subtask2_05.txt AC 19 ms 712 KB
subtask2_06.txt AC 17 ms 796 KB
subtask2_07.txt AC 18 ms 796 KB
subtask2_08.txt AC 18 ms 792 KB
subtask2_09.txt AC 16 ms 920 KB
subtask2_10.txt AC 18 ms 796 KB
subtask2_11.txt AC 18 ms 800 KB
subtask2_12.txt AC 18 ms 672 KB
subtask2_13.txt AC 18 ms 672 KB
subtask2_14.txt AC 19 ms 732 KB
subtask2_15.txt AC 17 ms 800 KB
subtask2_16.txt AC 18 ms 916 KB
subtask2_17.txt AC 18 ms 668 KB
subtask2_18.txt AC 18 ms 796 KB
subtask2_19.txt AC 18 ms 800 KB
subtask2_20.txt AC 18 ms 796 KB
subtask2_21.txt AC 16 ms 712 KB
subtask2_22.txt AC 16 ms 800 KB