Submission #162928


Source Code Expand

#include<iostream>
#include<sstream>
using namespace std;
#define times(N) for(int n = 0; n < N; n++)
#define times2(N1, N2) for(int i =0; i<N1; i++) for(int j=0; j<N2;j++)

string convertInt(int number)
{
   stringstream ss;//create a stringstream
   ss << number;//add number to the stream
   return ss.str();//return a string with the contents of the stream
}

int main() {
  int n,m;
  cin >> n >> m;

  if(n > m) swap(n, m);
  string str;
  int count = 0;
  for(int i = n; n <= m; n++) {
    str = convertInt(n);
    if(str.find('4', 0) != string::npos || str.find('9', 0) != string::npos)
      count++;
  }

  cout << count << endl;
 return 0;
}

Submission Info

Submission Time
Task D - 禁止された数字
User sakuna63
Language C++ (G++ 4.6.4)
Score 30
Code Size 680 Byte
Status TLE
Exec Time 2035 ms
Memory 932 KB

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 30 / 30 0 / 70
Status
AC × 3
TLE × 1
AC × 16
AC × 16
TLE × 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 21 ms 928 KB
subtask0_sample02.txt AC 20 ms 800 KB
subtask0_sample03.txt AC 22 ms 932 KB
subtask0_sample04.txt TLE 2028 ms 800 KB
subtask1_01.txt AC 31 ms 800 KB
subtask1_02.txt AC 21 ms 800 KB
subtask1_03.txt AC 20 ms 800 KB
subtask1_04.txt AC 21 ms 804 KB
subtask1_05.txt AC 21 ms 796 KB
subtask1_06.txt AC 22 ms 796 KB
subtask1_07.txt AC 21 ms 796 KB
subtask1_08.txt AC 25 ms 800 KB
subtask1_09.txt AC 29 ms 800 KB
subtask1_10.txt AC 24 ms 800 KB
subtask1_11.txt AC 23 ms 924 KB
subtask1_12.txt AC 23 ms 800 KB
subtask1_13.txt AC 26 ms 812 KB
subtask2_01.txt TLE 2029 ms 804 KB
subtask2_02.txt TLE 2029 ms 816 KB
subtask2_03.txt TLE 2029 ms 808 KB
subtask2_04.txt TLE 2028 ms 928 KB
subtask2_05.txt TLE 2029 ms 808 KB
subtask2_06.txt TLE 2028 ms 808 KB
subtask2_07.txt TLE 2029 ms 816 KB
subtask2_08.txt TLE 2030 ms 808 KB
subtask2_09.txt TLE 2029 ms 808 KB
subtask2_10.txt TLE 2029 ms 880 KB
subtask2_11.txt TLE 2029 ms 812 KB
subtask2_12.txt TLE 2029 ms 804 KB
subtask2_13.txt TLE 2035 ms 868 KB
subtask2_14.txt TLE 2029 ms 884 KB
subtask2_15.txt TLE 2029 ms 808 KB
subtask2_16.txt TLE 2029 ms 800 KB
subtask2_17.txt TLE 2029 ms 812 KB
subtask2_18.txt TLE 2029 ms 808 KB
subtask2_19.txt TLE 2029 ms 868 KB
subtask2_20.txt TLE 2029 ms 808 KB
subtask2_21.txt TLE 2029 ms 804 KB
subtask2_22.txt TLE 2029 ms 808 KB