Submission #162934


Source Code Expand

#include <iostream>
#include <sstream>
#include <iterator>
#include <algorithm>
#include <functional>
#include <bitset>
#include <string>
#include <list>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>

typedef long long unsigned BigInt;

std::string BigIntToString(BigInt n) {
	std::stringstream ss;
	ss << n;
	return ss.str();
}

int search(const std::string& str) {
	int L = str.size();
	
	for(int i=0; i<L; ++i)
	{if(str[i] == '4' || str[i] == '9') return i;}
	
	return -1;
}

BigInt pow(int b, int e) {
	BigInt n = 1;
	for(int _e=0; _e<e; ++_e) n *= b;
	return n;
}

int main(void) {
	BigInt A, B;
	std::cin >> A >> B;
	
	BigInt C = 0;
	
	for(BigInt i=A; i<=B; ) {
		std::string str = BigIntToString(i);
		int p = search(str);
		if(p == -1) {
			++i;
			continue;
		} else {
			BigInt j = pow(10, str.size()-1-p);
			i += j;
			C += j;
		}
	}
	
	std::cout << C << std::endl;
	
	return 0;
}

Submission Info

Submission Time
Task D - 禁止された数字
User material
Language C++11 (GCC 4.8.1)
Score 0
Code Size 989 Byte
Status WA
Exec Time 2037 ms
Memory 932 KB

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 0 / 30 0 / 70
Status
AC × 3
TLE × 1
AC × 8
WA × 8
AC × 8
WA × 9
TLE × 22
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 924 KB
subtask0_sample02.txt AC 21 ms 800 KB
subtask0_sample03.txt AC 21 ms 800 KB
subtask0_sample04.txt TLE 2029 ms 932 KB
subtask1_01.txt AC 26 ms 808 KB
subtask1_02.txt AC 21 ms 924 KB
subtask1_03.txt AC 21 ms 932 KB
subtask1_04.txt WA 21 ms 808 KB
subtask1_05.txt WA 21 ms 796 KB
subtask1_06.txt WA 21 ms 920 KB
subtask1_07.txt WA 23 ms 728 KB
subtask1_08.txt WA 23 ms 808 KB
subtask1_09.txt WA 27 ms 732 KB
subtask1_10.txt AC 23 ms 812 KB
subtask1_11.txt WA 23 ms 924 KB
subtask1_12.txt WA 22 ms 920 KB
subtask1_13.txt AC 24 ms 676 KB
subtask2_01.txt TLE 2030 ms 924 KB
subtask2_02.txt TLE 2030 ms 800 KB
subtask2_03.txt TLE 2029 ms 808 KB
subtask2_04.txt TLE 2030 ms 796 KB
subtask2_05.txt TLE 2030 ms 908 KB
subtask2_06.txt TLE 2029 ms 808 KB
subtask2_07.txt TLE 2030 ms 808 KB
subtask2_08.txt TLE 2029 ms 804 KB
subtask2_09.txt TLE 2029 ms 808 KB
subtask2_10.txt TLE 2029 ms 800 KB
subtask2_11.txt TLE 2029 ms 916 KB
subtask2_12.txt TLE 2029 ms 804 KB
subtask2_13.txt WA 21 ms 788 KB
subtask2_14.txt TLE 2029 ms 808 KB
subtask2_15.txt TLE 2029 ms 804 KB
subtask2_16.txt TLE 2031 ms 912 KB
subtask2_17.txt TLE 2029 ms 808 KB
subtask2_18.txt TLE 2037 ms 916 KB
subtask2_19.txt TLE 2029 ms 800 KB
subtask2_20.txt TLE 2029 ms 804 KB
subtask2_21.txt TLE 2037 ms 808 KB
subtask2_22.txt TLE 2030 ms 800 KB