Submission #1609640


Source Code Expand

#include <iostream>
#include <math.h>
#include <string>

using namespace std;

long long int mypow(int x, long long int n)
{
    if(n == 0) return 1;
    if(n < 0) return 1;
    long long int result = x;
    for(int i = 1; i < n; i++)
    {
        result *= x;
    }
    return result;
}

void test()
{
    int a, b;
    cin >> a >> b;
    if(to_string(b).size() >= 6)
        return;
    int count = 0;
    for(int i = a; i <= b; i++)
    {
        string str = to_string(i);
        for(auto s : str)
        {
            if(s == '4')
            {
               count++;
                break;
            }else if(s == '9')
            {
                count++;
                break;
            }

        }
    }
    cout << count << endl;
}
int main() {
    /*long long int a, b;
    cin >> a >> b;
    string stra = to_string(a);
    string strb = to_string(b);
    int bdigit = strb.size();
    long long int b2 = mypow(10, bdigit + 1);
    string strb2 = to_string(b2);*/
    /*int count = 0;
    for(int i = strb2.size() - 1; i >= 0 ; i++)
    {
       if(i < stra.size())
       {
           if(stra[i]  < 4)
           {
               count += 9 - stra[1];
               count += 9;
           }
       }
    }*/
    test();
    return 0;
}

Submission Info

Submission Time
Task D - 禁止された数字
User umisan
Language C++14 (GCC 5.4.1)
Score 30
Code Size 1328 Byte
Status WA
Exec Time 3 ms
Memory 256 KB

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 30 / 30 0 / 70
Status
AC × 3
WA × 1
AC × 16
AC × 16
WA × 23
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 1 ms 256 KB
subtask0_sample02.txt AC 1 ms 256 KB
subtask0_sample03.txt AC 1 ms 256 KB
subtask0_sample04.txt WA 1 ms 256 KB
subtask1_01.txt AC 3 ms 256 KB
subtask1_02.txt AC 1 ms 256 KB
subtask1_03.txt AC 1 ms 256 KB
subtask1_04.txt AC 1 ms 256 KB
subtask1_05.txt AC 1 ms 256 KB
subtask1_06.txt AC 1 ms 256 KB
subtask1_07.txt AC 1 ms 256 KB
subtask1_08.txt AC 2 ms 256 KB
subtask1_09.txt AC 2 ms 256 KB
subtask1_10.txt AC 2 ms 256 KB
subtask1_11.txt AC 1 ms 256 KB
subtask1_12.txt AC 1 ms 256 KB
subtask1_13.txt AC 2 ms 256 KB
subtask2_01.txt WA 1 ms 256 KB
subtask2_02.txt WA 1 ms 256 KB
subtask2_03.txt WA 1 ms 256 KB
subtask2_04.txt WA 1 ms 256 KB
subtask2_05.txt WA 1 ms 256 KB
subtask2_06.txt WA 1 ms 256 KB
subtask2_07.txt WA 1 ms 256 KB
subtask2_08.txt WA 1 ms 256 KB
subtask2_09.txt WA 1 ms 256 KB
subtask2_10.txt WA 1 ms 256 KB
subtask2_11.txt WA 1 ms 256 KB
subtask2_12.txt WA 1 ms 256 KB
subtask2_13.txt WA 1 ms 256 KB
subtask2_14.txt WA 1 ms 256 KB
subtask2_15.txt WA 1 ms 256 KB
subtask2_16.txt WA 1 ms 256 KB
subtask2_17.txt WA 1 ms 256 KB
subtask2_18.txt WA 1 ms 256 KB
subtask2_19.txt WA 1 ms 256 KB
subtask2_20.txt WA 1 ms 256 KB
subtask2_21.txt WA 1 ms 256 KB
subtask2_22.txt WA 1 ms 256 KB