Submission #391043


Source Code Expand

#include <iostream>
#include <iomanip>
#include <sstream>
#include <vector>
#include <string>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <functional>
#include <iterator>
#include <limits>
#include <numeric>
#include <utility>
#include <cmath>
#include <cassert>
#include <cstdio>

using namespace std; using namespace placeholders;

template < typename T > inline string toString( const T &a ) { ostringstream oss; oss << a; return oss.str(); };

long long dp[ 32 ][ 2 ][ 2 ];
// dp[ 決めた桁数 ][ 未満フラグ ][ 4 または 9 を含むか ] := 総数

long long solve( const string &S )
{
	const int L = S.size();

	fill( ( long long * )dp, ( long long * )dp + sizeof( dp ) / sizeof( long long ), 0 );
	dp[0][0][0] = 1;

	for ( int i = 0; i < L; ++i )
	{
		const int D = S[i] - '0';

		for ( int j = 0; j < 2; ++j )
		{
			for ( int k = 0; k < 2; ++k )
			{
				for ( int d = 0; d <= ( j ? 9 : D ); ++d )
				{
					dp[ i + 1 ][ j || ( d < D ) ][ k || d == 4 || d== 9 ] += dp[i][j][k];
				}
			}
		}
	}

	return dp[L][0][1] + dp[L][1][1];
}

int main()
{
	long long A, B;
	cin >> A >> B;
	cout << solve( toString( B ) ) - solve( toString( A - 1 ) ) << endl;

	return 0;
}

Submission Info

Submission Time
Task D - 禁止された数字
User torus711
Language C++11 (GCC 4.8.1)
Score 100
Code Size 1364 Byte
Status AC
Exec Time 36 ms
Memory 1176 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 31 ms 988 KB
subtask0_sample02.txt AC 28 ms 1048 KB
subtask0_sample03.txt AC 29 ms 1052 KB
subtask0_sample04.txt AC 29 ms 1044 KB
subtask1_01.txt AC 29 ms 1152 KB
subtask1_02.txt AC 29 ms 1052 KB
subtask1_03.txt AC 27 ms 1052 KB
subtask1_04.txt AC 28 ms 996 KB
subtask1_05.txt AC 27 ms 924 KB
subtask1_06.txt AC 31 ms 1052 KB
subtask1_07.txt AC 30 ms 984 KB
subtask1_08.txt AC 30 ms 1164 KB
subtask1_09.txt AC 28 ms 988 KB
subtask1_10.txt AC 28 ms 1044 KB
subtask1_11.txt AC 28 ms 916 KB
subtask1_12.txt AC 29 ms 1020 KB
subtask1_13.txt AC 30 ms 980 KB
subtask2_01.txt AC 30 ms 992 KB
subtask2_02.txt AC 29 ms 1176 KB
subtask2_03.txt AC 28 ms 1048 KB
subtask2_04.txt AC 30 ms 992 KB
subtask2_05.txt AC 31 ms 988 KB
subtask2_06.txt AC 30 ms 988 KB
subtask2_07.txt AC 30 ms 988 KB
subtask2_08.txt AC 28 ms 1000 KB
subtask2_09.txt AC 29 ms 1176 KB
subtask2_10.txt AC 30 ms 1044 KB
subtask2_11.txt AC 27 ms 924 KB
subtask2_12.txt AC 27 ms 1048 KB
subtask2_13.txt AC 28 ms 1052 KB
subtask2_14.txt AC 28 ms 924 KB
subtask2_15.txt AC 28 ms 924 KB
subtask2_16.txt AC 30 ms 1032 KB
subtask2_17.txt AC 27 ms 1044 KB
subtask2_18.txt AC 30 ms 928 KB
subtask2_19.txt AC 29 ms 1156 KB
subtask2_20.txt AC 36 ms 988 KB
subtask2_21.txt AC 29 ms 1048 KB
subtask2_22.txt AC 30 ms 992 KB