AcWing 1085. 不要62 灵神模板
原题链接
中等
作者:
zwh
,
2023-10-10 15:02:24
,
所有人可见
,
阅读 66
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 10;
int n, m;
int memo[N][N];
int dfs(string& s, int i, int last, bool is_limit) {
if (i == s.size()) {
return 1;
}
if (!is_limit && memo[i][last] != -1) return memo[i][last];
int res = 0;
int up = is_limit ? s[i] - '0' : 9;
for (int j = 0; j <= up; j++) {
if (j != 4 && (last != 6 || j != 2))
res += dfs(s, i+1, j, is_limit && j == up);
}
if (!is_limit) memo[i][last] = res;
return res;
}
int main() {
while (cin >> n >> m, n || m) {
string s = to_string(n-1);
memset(memo, -1, sizeof memo);
int r1 = dfs(s, 0, 0, true);
s = to_string(m);
memset(memo, -1, sizeof memo);
int r2 = dfs(s, 0, 0, true);
cout << r2-r1 << endl;
}
return 0;
}