Submission #1419831
Source Code Expand
// 基本テンプレート
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <functional>
using namespace std;
#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)
#define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++)
#define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--)
#define int long long int
template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}
typedef pair<int, int> pii;
typedef long long ll;
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
constexpr ll INF = 1001001001001001LL;
constexpr ll MOD = 1000000007LL;
// digit, has4, has9, flag
ll dp[20][2][2][2];
ll solve(string s, int less) {
memset(dp, 0, sizeof(dp));
dp[0][0][0][0] = 1;
int N = s.length();
rep(i,0,N) rep(j,0,2) rep(k,0,2) rep(f,0,2) {
int lim = f ? 9 : s[i] - '0';
rep(x,0,lim+1) {
dp[i+1][j||x==4][k||x==9][f||x<lim] += dp[i][j][k][f];
}
}
ll ret = 0;
rep(j,0,2) rep(k,0,2) rep(f,0,2) {
if(!j && !k) continue;
if(less == 1 && f == 0) continue;
ret += dp[N][j][k][f];
}
return ret;
}
signed main() {
string A, B; cin >> A >> B;
ll ra = solve(A, 1), rb = solve(B, 0);
cout << rb - ra << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
D - 禁止された数字 |
User |
tsutaj |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
1756 Byte |
Status |
AC |
Exec Time |
7 ms |
Memory |
256 KB |
Judge Result
Set Name |
Sample |
Subtask1 |
Subtask2 |
Score / Max Score |
0 / 0 |
30 / 30 |
70 / 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 |
1 ms |
256 KB |
subtask0_sample02.txt |
AC |
1 ms |
256 KB |
subtask0_sample03.txt |
AC |
1 ms |
256 KB |
subtask0_sample04.txt |
AC |
1 ms |
256 KB |
subtask1_01.txt |
AC |
1 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 |
1 ms |
256 KB |
subtask1_09.txt |
AC |
1 ms |
256 KB |
subtask1_10.txt |
AC |
1 ms |
256 KB |
subtask1_11.txt |
AC |
1 ms |
256 KB |
subtask1_12.txt |
AC |
1 ms |
256 KB |
subtask1_13.txt |
AC |
1 ms |
256 KB |
subtask2_01.txt |
AC |
1 ms |
256 KB |
subtask2_02.txt |
AC |
1 ms |
256 KB |
subtask2_03.txt |
AC |
1 ms |
256 KB |
subtask2_04.txt |
AC |
1 ms |
256 KB |
subtask2_05.txt |
AC |
1 ms |
256 KB |
subtask2_06.txt |
AC |
1 ms |
256 KB |
subtask2_07.txt |
AC |
1 ms |
256 KB |
subtask2_08.txt |
AC |
1 ms |
256 KB |
subtask2_09.txt |
AC |
1 ms |
256 KB |
subtask2_10.txt |
AC |
1 ms |
256 KB |
subtask2_11.txt |
AC |
1 ms |
256 KB |
subtask2_12.txt |
AC |
1 ms |
256 KB |
subtask2_13.txt |
AC |
1 ms |
256 KB |
subtask2_14.txt |
AC |
1 ms |
256 KB |
subtask2_15.txt |
AC |
1 ms |
256 KB |
subtask2_16.txt |
AC |
1 ms |
256 KB |
subtask2_17.txt |
AC |
1 ms |
256 KB |
subtask2_18.txt |
AC |
1 ms |
256 KB |
subtask2_19.txt |
AC |
1 ms |
256 KB |
subtask2_20.txt |
AC |
1 ms |
256 KB |
subtask2_21.txt |
AC |
1 ms |
256 KB |
subtask2_22.txt |
AC |
7 ms |
256 KB |