#include <iostream>
#include <vector>
#include <algorithm>
#include <cstring>
using namespace std;
typedef long long ll;
struct SOLUTION {
bool vis[30][11][11][2][2];
// memo[index][penultimate][end_digit][tight][notzeros];
ll memo[30][11][11][2][2];
vector<int> digits;
SOLUTION() {
memset(vis, 0, sizeof(vis));
memset(memo, 0, sizeof(memo));
}
ll dp(int index, int penultimate, int end, bool tight, bool notzeros) {
if (index == digits.size()) {
if (notzeros) return 1;
else return 0;
}
if (vis[index][penultimate][end][tight][notzeros])
return memo[index][penultimate][end][tight][notzeros];
ll res = 0;
int max_next = 9;
if (tight) max_next = digits[index];
for (int i = 0; i <= max_next; i++) {
if (i != penultimate && i != end) {
int t_penultimate = end;
int t_end = i;
if (!notzeros && i == 0) t_end = 10;
bool t_tight = tight && (i == max_next);
bool t_notzeros = notzeros || (i > 0);
res += dp(index + 1, t_penultimate, t_end, t_tight, t_notzeros);
}
}
vis[index][penultimate][end][tight][notzeros] = true;
memo[index][penultimate][end][tight][notzeros] = res;
return res;
}
void get_digits(ll n) {
while (n != 0) {
digits.push_back(n%10);
n /= 10;
}
reverse(digits.begin(), digits.end());
}
bool is_palindrome() {
//cout << digits.size() << endl;
bool res = false;
int i = 0;
if (digits.size()>1)
while (i < digits.size() - 1) {
if (digits[i] == digits[i+1]) res = true;
i++;
}
i = 0;
if (digits.size() > 2)
while (i < digits.size() - 2) {
if (digits[i] == digits[i+2]) res = true;
i++;
}
return res;
}
};
int main() {
int a, b;
SOLUTION l_bound;
cin >> a >> b;
if (a > b) swap(a, b);
l_bound.get_digits(a-1);
ll lres = -1;
// index 0, allow all numbers inc 0, allow all numbers, tight = true
if (a != 0) lres = l_bound.dp(0, 10, 10, true, false);
SOLUTION u_bound;
u_bound.get_digits(b);
ll ures = u_bound.dp(0, 10, 10, true, false);
//cout << lres << " " << ures << endl;
cout << ures - lres << endl;
}
Compilation message
numbers.cpp: In member function 'll SOLUTION::dp(int, int, int, bool, bool)':
numbers.cpp:22:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
22 | if (index == digits.size()) {
| ~~~~~~^~~~~~~~~~~~~~~~
numbers.cpp: In member function 'bool SOLUTION::is_palindrome()':
numbers.cpp:64:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
64 | while (i < digits.size() - 1) {
| ~~^~~~~~~~~~~~~~~~~~~
numbers.cpp:71:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
71 | while (i < digits.size() - 2) {
| ~~^~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
620 KB |
Output is correct |
| 2 |
Correct |
1 ms |
620 KB |
Output is correct |
| 3 |
Incorrect |
1 ms |
620 KB |
Output isn't correct |
| 4 |
Correct |
1 ms |
620 KB |
Output is correct |
| 5 |
Correct |
1 ms |
620 KB |
Output is correct |
| 6 |
Correct |
1 ms |
620 KB |
Output is correct |
| 7 |
Correct |
1 ms |
620 KB |
Output is correct |
| 8 |
Correct |
1 ms |
620 KB |
Output is correct |
| 9 |
Correct |
1 ms |
620 KB |
Output is correct |
| 10 |
Correct |
1 ms |
640 KB |
Output is correct |
| 11 |
Correct |
1 ms |
620 KB |
Output is correct |
| 12 |
Correct |
1 ms |
620 KB |
Output is correct |
| 13 |
Correct |
1 ms |
620 KB |
Output is correct |
| 14 |
Correct |
1 ms |
620 KB |
Output is correct |
| 15 |
Correct |
1 ms |
620 KB |
Output is correct |
| 16 |
Correct |
1 ms |
620 KB |
Output is correct |
| 17 |
Correct |
1 ms |
620 KB |
Output is correct |
| 18 |
Correct |
1 ms |
620 KB |
Output is correct |
| 19 |
Incorrect |
1 ms |
620 KB |
Output isn't correct |
| 20 |
Correct |
1 ms |
620 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
620 KB |
Output is correct |
| 2 |
Incorrect |
1 ms |
620 KB |
Output isn't correct |
| 3 |
Incorrect |
1 ms |
620 KB |
Output isn't correct |
| 4 |
Incorrect |
1 ms |
620 KB |
Output isn't correct |
| 5 |
Correct |
1 ms |
620 KB |
Output is correct |
| 6 |
Correct |
1 ms |
620 KB |
Output is correct |
| 7 |
Correct |
1 ms |
620 KB |
Output is correct |
| 8 |
Correct |
1 ms |
620 KB |
Output is correct |
| 9 |
Correct |
1 ms |
620 KB |
Output is correct |
| 10 |
Correct |
1 ms |
620 KB |
Output is correct |
| 11 |
Correct |
1 ms |
640 KB |
Output is correct |
| 12 |
Correct |
1 ms |
620 KB |
Output is correct |
| 13 |
Correct |
1 ms |
620 KB |
Output is correct |
| 14 |
Correct |
1 ms |
620 KB |
Output is correct |
| 15 |
Correct |
1 ms |
620 KB |
Output is correct |
| 16 |
Incorrect |
1 ms |
620 KB |
Output isn't correct |
| 17 |
Incorrect |
1 ms |
620 KB |
Output isn't correct |
| 18 |
Incorrect |
1 ms |
620 KB |
Output isn't correct |
| 19 |
Incorrect |
1 ms |
620 KB |
Output isn't correct |
| 20 |
Incorrect |
1 ms |
620 KB |
Output isn't correct |
| 21 |
Incorrect |
1 ms |
620 KB |
Output isn't correct |
| 22 |
Incorrect |
1 ms |
620 KB |
Output isn't correct |
| 23 |
Incorrect |
1 ms |
620 KB |
Output isn't correct |
| 24 |
Incorrect |
1 ms |
620 KB |
Output isn't correct |
| 25 |
Incorrect |
1 ms |
620 KB |
Output isn't correct |
| 26 |
Incorrect |
1 ms |
620 KB |
Output isn't correct |
| 27 |
Incorrect |
1 ms |
620 KB |
Output isn't correct |
| 28 |
Incorrect |
1 ms |
620 KB |
Output isn't correct |
| 29 |
Incorrect |
1 ms |
620 KB |
Output isn't correct |
| 30 |
Incorrect |
1 ms |
620 KB |
Output isn't correct |
| 31 |
Incorrect |
1 ms |
620 KB |
Output isn't correct |
| 32 |
Incorrect |
1 ms |
620 KB |
Output isn't correct |
| 33 |
Incorrect |
1 ms |
620 KB |
Output isn't correct |
| 34 |
Incorrect |
1 ms |
620 KB |
Output isn't correct |
| 35 |
Incorrect |
1 ms |
620 KB |
Output isn't correct |
| 36 |
Incorrect |
1 ms |
620 KB |
Output isn't correct |
| 37 |
Incorrect |
1 ms |
620 KB |
Output isn't correct |
| 38 |
Incorrect |
1 ms |
620 KB |
Output isn't correct |
| 39 |
Incorrect |
1 ms |
620 KB |
Output isn't correct |
| 40 |
Incorrect |
1 ms |
620 KB |
Output isn't correct |
| 41 |
Incorrect |
1 ms |
620 KB |
Output isn't correct |
| 42 |
Incorrect |
1 ms |
620 KB |
Output isn't correct |
| 43 |
Incorrect |
1 ms |
620 KB |
Output isn't correct |
| 44 |
Incorrect |
1 ms |
620 KB |
Output isn't correct |
| 45 |
Incorrect |
1 ms |
620 KB |
Output isn't correct |
