#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <debug.h>
#else
#define debug(...)
#endif
#define ft front
#define bk back
#define st first
#define nd second
#define ins insert
#define ers erase
#define pb push_back
#define pf push_front
#define _pb pop_back
#define _pf pop_front
#define lb lower_bound
#define ub upper_bound
#define mtp make_tuple
#define bg begin
#define ed end
#define all(x) (x).bg(), (x).ed()
#define sz(x) (int)(x).size()
typedef long long ll; typedef unsigned long long ull;
typedef double db; typedef long double ldb;
typedef pair<int, int> pi; typedef pair<ll, ll> pll;
typedef vector<int> vi; typedef vector<ll> vll; typedef vector<pi> vpi; typedef vector<pll> vpll;
typedef string str;
template<typename T> T gcd(T a, T b) { return (b == 0? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
#define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
#define FOS(i, r, l) for (int (i) = (r); (i) >= (l); --(i))
#define FRN(i, n) for (int (i) = 0; (i) < (n); ++(i))
#define FSN(i, n) for (int (i) = (n) - 1; (i) >= 0; --(i))
#define EACH(i, x) for (auto &(i) : (x))
#define WHILE while
#define file "TEST"
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
ll rand(ll l, ll r) { return uniform_int_distribution<ll>(l, r)(rd); }
/*
----------------------------------------------------------------
END OF TEMPLATE
----------------------------------------------------------------
Tran The Bao - ghostwriter
Training for VOI23 gold medal
----------------------------------------------------------------
DIT ME CHUYEN BAO LOC
----------------------------------------------------------------
*/
const int N = 20;
ll d[N][2][11][11];
vi todi(ll n) {
vi ans(1, 0);
WHILE(n) {
ans.pb(n % 10);
n /= 10;
}
return ans;
}
ll cal(ll n) {
if (n <= 0) return 0;
vi di = todi(n);
int m = sz(di);
FRN(i, m)
FRN(sm, 2)
FRN(p1, 11)
FRN(p2, 11) {
ll &rs = d[i][sm][p1][p2];
rs = 0;
if (i == 0) {
rs = 1;
continue;
}
FOR(z, 0, 9) {
if (!sm && z > di[i]) continue;
if (p2 != 10 && p1 != 10 && p2 == z) continue;
if (p1 != 10 && p1 == z) continue;
rs += d[i - 1][sm || z < di[i]][z][p1];
}
}
return d[m - 1][0][10][10];
}
ll a, b;
signed main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
// freopen(file".inp", "r", stdin);
// freopen(file".out", "w", stdout);
cin >> a >> b;
cout << cal(b) - cal(a - 1);
return 0;
}
/*
----------------------------------------------------------------
From Benq:
stuff you should look for
* int overflow, array bounds
* special cases (n=1?)
* do smth instead of nothing and stay organized
* WRITE STUFF DOWN
* DON'T GET STUCK ON ONE APPROACH
----------------------------------------------------------------
*/
Compilation message
numbers.cpp: In function 'll cal(ll)':
numbers.cpp:34:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
34 | #define FRN(i, n) for (int (i) = 0; (i) < (n); ++(i))
| ^
numbers.cpp:65:2: note: in expansion of macro 'FRN'
65 | FRN(i, m)
| ^~~
numbers.cpp:34:28: warning: unnecessary parentheses in declaration of 'sm' [-Wparentheses]
34 | #define FRN(i, n) for (int (i) = 0; (i) < (n); ++(i))
| ^
numbers.cpp:66:2: note: in expansion of macro 'FRN'
66 | FRN(sm, 2)
| ^~~
numbers.cpp:34:28: warning: unnecessary parentheses in declaration of 'p1' [-Wparentheses]
34 | #define FRN(i, n) for (int (i) = 0; (i) < (n); ++(i))
| ^
numbers.cpp:67:2: note: in expansion of macro 'FRN'
67 | FRN(p1, 11)
| ^~~
numbers.cpp:34:28: warning: unnecessary parentheses in declaration of 'p2' [-Wparentheses]
34 | #define FRN(i, n) for (int (i) = 0; (i) < (n); ++(i))
| ^
numbers.cpp:68:2: note: in expansion of macro 'FRN'
68 | FRN(p2, 11) {
| ^~~
numbers.cpp:32:31: warning: unnecessary parentheses in declaration of 'z' [-Wparentheses]
32 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
| ^
numbers.cpp:75:3: note: in expansion of macro 'FOR'
75 | FOR(z, 0, 9) {
| ^~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
| 2 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
| 3 |
Correct |
1 ms |
340 KB |
Output is correct |
| 4 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
| 5 |
Correct |
0 ms |
212 KB |
Output is correct |
| 6 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
| 7 |
Incorrect |
1 ms |
340 KB |
Output isn't correct |
| 8 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
| 9 |
Correct |
1 ms |
212 KB |
Output is correct |
| 10 |
Correct |
0 ms |
212 KB |
Output is correct |
| 11 |
Correct |
1 ms |
340 KB |
Output is correct |
| 12 |
Correct |
1 ms |
340 KB |
Output is correct |
| 13 |
Correct |
1 ms |
212 KB |
Output is correct |
| 14 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
| 15 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
| 16 |
Correct |
1 ms |
340 KB |
Output is correct |
| 17 |
Correct |
1 ms |
340 KB |
Output is correct |
| 18 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
| 19 |
Correct |
1 ms |
340 KB |
Output is correct |
| 20 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
340 KB |
Output is correct |
| 2 |
Correct |
1 ms |
340 KB |
Output is correct |
| 3 |
Correct |
1 ms |
340 KB |
Output is correct |
| 4 |
Correct |
1 ms |
340 KB |
Output is correct |
| 5 |
Incorrect |
1 ms |
340 KB |
Output isn't correct |
| 6 |
Correct |
0 ms |
340 KB |
Output is correct |
| 7 |
Incorrect |
1 ms |
340 KB |
Output isn't correct |
| 8 |
Incorrect |
1 ms |
340 KB |
Output isn't correct |
| 9 |
Incorrect |
1 ms |
340 KB |
Output isn't correct |
| 10 |
Incorrect |
1 ms |
340 KB |
Output isn't correct |
| 11 |
Correct |
1 ms |
340 KB |
Output is correct |
| 12 |
Incorrect |
1 ms |
340 KB |
Output isn't correct |
| 13 |
Incorrect |
1 ms |
340 KB |
Output isn't correct |
| 14 |
Incorrect |
1 ms |
456 KB |
Output isn't correct |
| 15 |
Incorrect |
1 ms |
340 KB |
Output isn't correct |
| 16 |
Correct |
1 ms |
340 KB |
Output is correct |
| 17 |
Correct |
1 ms |
340 KB |
Output is correct |
| 18 |
Correct |
1 ms |
340 KB |
Output is correct |
| 19 |
Correct |
1 ms |
340 KB |
Output is correct |
| 20 |
Correct |
1 ms |
340 KB |
Output is correct |
| 21 |
Correct |
1 ms |
340 KB |
Output is correct |
| 22 |
Correct |
1 ms |
284 KB |
Output is correct |
| 23 |
Correct |
1 ms |
340 KB |
Output is correct |
| 24 |
Correct |
1 ms |
340 KB |
Output is correct |
| 25 |
Correct |
1 ms |
340 KB |
Output is correct |
| 26 |
Correct |
1 ms |
340 KB |
Output is correct |
| 27 |
Correct |
1 ms |
340 KB |
Output is correct |
| 28 |
Correct |
1 ms |
340 KB |
Output is correct |
| 29 |
Correct |
1 ms |
340 KB |
Output is correct |
| 30 |
Correct |
1 ms |
340 KB |
Output is correct |
| 31 |
Correct |
1 ms |
340 KB |
Output is correct |
| 32 |
Correct |
1 ms |
340 KB |
Output is correct |
| 33 |
Correct |
1 ms |
340 KB |
Output is correct |
| 34 |
Correct |
1 ms |
340 KB |
Output is correct |
| 35 |
Correct |
1 ms |
340 KB |
Output is correct |
| 36 |
Correct |
1 ms |
340 KB |
Output is correct |
| 37 |
Correct |
1 ms |
340 KB |
Output is correct |
| 38 |
Correct |
1 ms |
340 KB |
Output is correct |
| 39 |
Correct |
1 ms |
276 KB |
Output is correct |
| 40 |
Correct |
1 ms |
340 KB |
Output is correct |
| 41 |
Correct |
1 ms |
340 KB |
Output is correct |
| 42 |
Correct |
1 ms |
340 KB |
Output is correct |
| 43 |
Correct |
1 ms |
340 KB |
Output is correct |
| 44 |
Correct |
1 ms |
340 KB |
Output is correct |
| 45 |
Correct |
1 ms |
340 KB |
Output is correct |
