Submission #735406


Source Code Expand

#include <iostream>
#include <string>

using namespace std;
typedef unsigned long long ull;


ull count49(string);
string decrement(string);

int main(void){
    string A, B;
    string A_;

    cin >> A >> B;
    A_ = decrement(A);
    cout << count49(B)-count49(A_) << endl;

    return 0;
}


string decrement(string s){
    int i;

    for (i=s.length()-1; i>-1; i--) {
        if (s[i] == '0') {
            s[i] = '9';
        } else {
            s[i]--;
            break;
        }
    }

    return s;
}

ull count49(string s){
    ull n=0;
    ull m=0;
    bool has_invalid_digit=false;
    unsigned int i;

    for (i=0; i<s.length(); i++) {
        n *= 8;
        m *= 10;
        m += s[i] - '0';

        if (has_invalid_digit) {
            n += 7;
        } else if (s[i] == '4') {
            n += 3;
            has_invalid_digit = true;
        } else if (s[i] == '9') {
            n += 7;
            has_invalid_digit = true;
        } else if (s[i] < '4') {
            n += s[i] - '0';
        } else if (s[i] < '9') {
            n += s[i] - '1';
        }
    }

    return m-n;
}

Submission Info

Submission Time
Task D - 禁止された数字
User rsk0315
Language C++ (G++ 4.6.4)
Score 100
Code Size 1174 Byte
Status AC
Exec Time 34 ms
Memory 928 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 26 ms 800 KB
subtask0_sample02.txt AC 26 ms 928 KB
subtask0_sample03.txt AC 25 ms 796 KB
subtask0_sample04.txt AC 30 ms 728 KB
subtask1_01.txt AC 25 ms 792 KB
subtask1_02.txt AC 25 ms 796 KB
subtask1_03.txt AC 25 ms 796 KB
subtask1_04.txt AC 29 ms 736 KB
subtask1_05.txt AC 28 ms 916 KB
subtask1_06.txt AC 34 ms 800 KB
subtask1_07.txt AC 27 ms 924 KB
subtask1_08.txt AC 25 ms 672 KB
subtask1_09.txt AC 25 ms 800 KB
subtask1_10.txt AC 23 ms 800 KB
subtask1_11.txt AC 26 ms 804 KB
subtask1_12.txt AC 25 ms 804 KB
subtask1_13.txt AC 25 ms 800 KB
subtask2_01.txt AC 25 ms 928 KB
subtask2_02.txt AC 25 ms 800 KB
subtask2_03.txt AC 24 ms 796 KB
subtask2_04.txt AC 25 ms 800 KB
subtask2_05.txt AC 25 ms 928 KB
subtask2_06.txt AC 25 ms 800 KB
subtask2_07.txt AC 25 ms 796 KB
subtask2_08.txt AC 24 ms 924 KB
subtask2_09.txt AC 25 ms 800 KB
subtask2_10.txt AC 23 ms 800 KB
subtask2_11.txt AC 24 ms 800 KB
subtask2_12.txt AC 25 ms 924 KB
subtask2_13.txt AC 25 ms 928 KB
subtask2_14.txt AC 28 ms 676 KB
subtask2_15.txt AC 26 ms 920 KB
subtask2_16.txt AC 26 ms 796 KB
subtask2_17.txt AC 24 ms 920 KB
subtask2_18.txt AC 26 ms 672 KB
subtask2_19.txt AC 23 ms 796 KB
subtask2_20.txt AC 25 ms 796 KB
subtask2_21.txt AC 25 ms 920 KB
subtask2_22.txt AC 25 ms 924 KB