#include <bits/stdc++.h> using namespace std; typedef long long int LL; typedef vector<pair<int,int>> VPII; const int LCM = 2520; LL dp[20][1 << 9][LCM][2]; LL compute_dp(LL N) { string n = to_string(N); int len = (int)(n.length()); dp[0][0][0][1] = 1; for (int i = 1; i <= len; i++) dp[i][0][0][0] = 1; for (int i = 0; i < len; i++) for (int bm = 0; bm < (1 << 9); bm++) for (int r = 0; r < LCM; r++) for (int j = 1; j <= 9; j++) { int nbm = bm | (1 << (j - 1)); int nr = (10 * r + j) % LCM; if (j == n[i]-'0') dp[i+1][nbm][nr][1] += dp[i][bm][r][1]; if (j < n[i]-'0') dp[i+1][nbm][nr][0] += dp[i][bm][r][1]; dp[i+1][nbm][nr][0] += dp[i][bm][r][0]; } LL res = 0; for (int bm = 0; bm < (1 << 9); bm++) { int lcm = 1; for (int j = 1; j <= 9; j++) if (bm & (1 << (j - 1))) lcm = (lcm * j) / __gcd(lcm, j); for (int v = 0; v < LCM; v += lcm) res += dp[len][bm][v][0] + dp[len][bm][v][1]; } for (int i = 0; i <= len; i++) for (int bm = 0; bm < (1 << 9); bm++) for (int r = 0; r < LCM; r++) dp[i][bm][r][0] = dp[i][bm][r][1] = 0; return res; } LL solve(LL l, LL r) { return compute_dp(r) - compute_dp(l-1); } int main() { LL l, r; cin >> l >> r; cout << solve(l, r) << "\n"; return 0; }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 | #include <bits/stdc++.h> using namespace std; typedef long long int LL; typedef vector<pair<int,int>> VPII; const int LCM = 2520; LL dp[20][1 << 9][LCM][2]; LL compute_dp(LL N) { string n = to_string(N); int len = (int)(n.length()); dp[0][0][0][1] = 1; for (int i = 1; i <= len; i++) dp[i][0][0][0] = 1; for (int i = 0; i < len; i++) for (int bm = 0; bm < (1 << 9); bm++) for (int r = 0; r < LCM; r++) for (int j = 1; j <= 9; j++) { int nbm = bm | (1 << (j - 1)); int nr = (10 * r + j) % LCM; if (j == n[i]-'0') dp[i+1][nbm][nr][1] += dp[i][bm][r][1]; if (j < n[i]-'0') dp[i+1][nbm][nr][0] += dp[i][bm][r][1]; dp[i+1][nbm][nr][0] += dp[i][bm][r][0]; } LL res = 0; for (int bm = 0; bm < (1 << 9); bm++) { int lcm = 1; for (int j = 1; j <= 9; j++) if (bm & (1 << (j - 1))) lcm = (lcm * j) / __gcd(lcm, j); for (int v = 0; v < LCM; v += lcm) res += dp[len][bm][v][0] + dp[len][bm][v][1]; } for (int i = 0; i <= len; i++) for (int bm = 0; bm < (1 << 9); bm++) for (int r = 0; r < LCM; r++) dp[i][bm][r][0] = dp[i][bm][r][1] = 0; return res; } LL solve(LL l, LL r) { return compute_dp(r) - compute_dp(l-1); } int main() { LL l, r; cin >> l >> r; cout << solve(l, r) << "\n"; return 0; } |