Submission #163631
Source Code Expand
#include <sstream> #include<stdlib.h> #include <string> #include<string.h> #include <vector> #include <map> #include <algorithm> #include <iostream> #include <utility> #include <set> #include <cctype> #include <queue> #include <stack> #include <cstdio> #include <cstdlib> #include<math.h> using namespace std; typedef long long ll; #define INF 100000000 #define EPS 0.000001 int main(){ ll A, B; ll ans = 0; cin >> A >> B; for(ll i = A; i <= B; i++){ bool flag = false; ll kari = i; while(true){ if(kari%10 == 4 || kari%10 == 9){ flag = true; break; } if(kari/10 == 0) break; kari /= 10; } if(flag) ans++; } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - 禁止された数字 |
User | taketake0609 |
Language | C++ (G++ 4.6.4) |
Score | 30 |
Code Size | 744 Byte |
Status | TLE |
Exec Time | 2032 ms |
Memory | 916 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 30 / 30 | 0 / 70 | ||||||||||
Status |
|
|
|
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 | 20 ms | 792 KB |
subtask0_sample02.txt | AC | 23 ms | 892 KB |
subtask0_sample03.txt | AC | 20 ms | 912 KB |
subtask0_sample04.txt | TLE | 2032 ms | 816 KB |
subtask1_01.txt | AC | 22 ms | 796 KB |
subtask1_02.txt | AC | 23 ms | 792 KB |
subtask1_03.txt | AC | 21 ms | 916 KB |
subtask1_04.txt | AC | 22 ms | 792 KB |
subtask1_05.txt | AC | 22 ms | 916 KB |
subtask1_06.txt | AC | 21 ms | 792 KB |
subtask1_07.txt | AC | 21 ms | 788 KB |
subtask1_08.txt | AC | 19 ms | 788 KB |
subtask1_09.txt | AC | 22 ms | 792 KB |
subtask1_10.txt | AC | 20 ms | 912 KB |
subtask1_11.txt | AC | 22 ms | 792 KB |
subtask1_12.txt | AC | 20 ms | 788 KB |
subtask1_13.txt | AC | 19 ms | 780 KB |
subtask2_01.txt | TLE | 2029 ms | 804 KB |
subtask2_02.txt | TLE | 2029 ms | 804 KB |
subtask2_03.txt | TLE | 2030 ms | 804 KB |
subtask2_04.txt | TLE | 2030 ms | 804 KB |
subtask2_05.txt | TLE | 2032 ms | 776 KB |
subtask2_06.txt | TLE | 2029 ms | 804 KB |
subtask2_07.txt | TLE | 2030 ms | 796 KB |
subtask2_08.txt | TLE | 2030 ms | 808 KB |
subtask2_09.txt | TLE | 2028 ms | 800 KB |
subtask2_10.txt | TLE | 2030 ms | 804 KB |
subtask2_11.txt | TLE | 2031 ms | 812 KB |
subtask2_12.txt | TLE | 2030 ms | 804 KB |
subtask2_13.txt | TLE | 2032 ms | 900 KB |
subtask2_14.txt | TLE | 2030 ms | 808 KB |
subtask2_15.txt | TLE | 2029 ms | 804 KB |
subtask2_16.txt | TLE | 2030 ms | 804 KB |
subtask2_17.txt | TLE | 2030 ms | 808 KB |
subtask2_18.txt | TLE | 2030 ms | 816 KB |
subtask2_19.txt | TLE | 2030 ms | 800 KB |
subtask2_20.txt | TLE | 2028 ms | 804 KB |
subtask2_21.txt | TLE | 2029 ms | 808 KB |
subtask2_22.txt | TLE | 2032 ms | 812 KB |