#include <bits/stdc++.h>
using namespace std;
bool isPalindrome (int64_t i) {
string s = to_string(i);
bool fine = true;
for (int64_t j = 0; j < s.length(); j++) {
if (j >= 1 && s[j] == s[j - 1]) {
fine = false;
}
if (j >= 2 && s[j] == s[j - 2]) {
fine = false;
}
}
return fine;
}
int64_t res (int64_t a, int64_t b) {
int64_t ans = 0;
for (int64_t i = a; i <= b; i++) {
ans += isPalindrome(i);
}
return ans;
}
int64_t removeAllBut2 (int64_t x) {
string s = to_string(x);
for (int64_t i = 2; i < s.length(); i++) {
s[i] = '0';
}
assert(to_string(stoll(s)) == s);
return stoll(s);
}
vector<int64_t> pos;
int64_t query (int64_t a, int64_t b) {
if (b - a <= 1000) {
return res(a, b);
}
if (a != 0) {
return query(0, b) - query(0, a - 1);
}
if (a == b) {
return a;
}
string s = to_string(b);
int64_t tot = 0;
int64_t c = 0;
for (int64_t i = 1; i <= 9; i++) {
for (int64_t j = 0; j <= 9; j++) {
for (int64_t k = 0; k <= 9; k++) {
if (i == j || j == k || i == k) continue;
c += (100 * i + 10 * j + k < 100 * (s[0] - '0') + 10 * (s[1] - '0') + (s[2] - '0'));
if (i == s[0] - '0' && j == s[1] - '0' && k == s[2] - '0') {
char ch = s.front();
reverse(s.begin(), s.end());
s.pop_back();
reverse(s.begin(), s.end());
tot += query(removeAllBut2(stoll(s)), stoll(s));
s = ch + s;
}
}
}
}
int64_t t = (int)s.size() - 3;
while (t--) {
c *= 8;
}
tot += c;
return tot + pos[s.length() - 1];
}
int main() {
int64_t a, b;
cin >> a >> b;
pos.resize(19);
pos[1] = 10;
for (int i = 2; i < 18; i++) {
pos[i] = pos[i - 1];
int64_t res = 81;
int t = i - 2;
while (t--) {
res *= 8;
}
pos[i] += res;
}
cout << query(a, b) << '\n';
}
Compilation message
numbers.cpp: In function 'bool isPalindrome(int64_t)':
numbers.cpp:6:27: warning: comparison of integer expressions of different signedness: 'int64_t' {aka 'long int'} and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
6 | for (int64_t j = 0; j < s.length(); j++) {
| ~~^~~~~~~~~~~~
numbers.cpp: In function 'int64_t removeAllBut2(int64_t)':
numbers.cpp:25:27: warning: comparison of integer expressions of different signedness: 'int64_t' {aka 'long int'} and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
25 | for (int64_t i = 2; i < s.length(); i++) {
| ~~^~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
288 KB |
Output is correct |
| 2 |
Correct |
0 ms |
288 KB |
Output is correct |
| 3 |
Correct |
0 ms |
212 KB |
Output is correct |
| 4 |
Correct |
0 ms |
212 KB |
Output is correct |
| 5 |
Correct |
0 ms |
212 KB |
Output is correct |
| 6 |
Correct |
0 ms |
212 KB |
Output is correct |
| 7 |
Correct |
0 ms |
212 KB |
Output is correct |
| 8 |
Correct |
0 ms |
212 KB |
Output is correct |
| 9 |
Correct |
0 ms |
212 KB |
Output is correct |
| 10 |
Correct |
0 ms |
212 KB |
Output is correct |
| 11 |
Correct |
1 ms |
212 KB |
Output is correct |
| 12 |
Correct |
0 ms |
212 KB |
Output is correct |
| 13 |
Correct |
1 ms |
212 KB |
Output is correct |
| 14 |
Correct |
0 ms |
212 KB |
Output is correct |
| 15 |
Correct |
0 ms |
212 KB |
Output is correct |
| 16 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
| 17 |
Correct |
0 ms |
212 KB |
Output is correct |
| 18 |
Correct |
0 ms |
212 KB |
Output is correct |
| 19 |
Correct |
1 ms |
212 KB |
Output is correct |
| 20 |
Correct |
0 ms |
212 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
| 2 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
| 3 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
| 4 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
| 5 |
Correct |
0 ms |
212 KB |
Output is correct |
| 6 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
| 7 |
Correct |
0 ms |
212 KB |
Output is correct |
| 8 |
Correct |
0 ms |
212 KB |
Output is correct |
| 9 |
Correct |
0 ms |
212 KB |
Output is correct |
| 10 |
Correct |
0 ms |
212 KB |
Output is correct |
| 11 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
| 12 |
Correct |
0 ms |
212 KB |
Output is correct |
| 13 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
| 14 |
Correct |
0 ms |
212 KB |
Output is correct |
| 15 |
Correct |
1 ms |
212 KB |
Output is correct |
| 16 |
Correct |
1 ms |
212 KB |
Output is correct |
| 17 |
Correct |
0 ms |
212 KB |
Output is correct |
| 18 |
Correct |
0 ms |
212 KB |
Output is correct |
| 19 |
Correct |
0 ms |
212 KB |
Output is correct |
| 20 |
Correct |
0 ms |
212 KB |
Output is correct |
| 21 |
Correct |
1 ms |
212 KB |
Output is correct |
| 22 |
Correct |
0 ms |
212 KB |
Output is correct |
| 23 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
| 24 |
Correct |
0 ms |
212 KB |
Output is correct |
| 25 |
Correct |
1 ms |
212 KB |
Output is correct |
| 26 |
Incorrect |
1 ms |
276 KB |
Output isn't correct |
| 27 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
| 28 |
Correct |
1 ms |
212 KB |
Output is correct |
| 29 |
Correct |
0 ms |
212 KB |
Output is correct |
| 30 |
Correct |
0 ms |
212 KB |
Output is correct |
| 31 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
| 32 |
Correct |
0 ms |
212 KB |
Output is correct |
| 33 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
| 34 |
Correct |
1 ms |
212 KB |
Output is correct |
| 35 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
| 36 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
| 37 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
| 38 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
| 39 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
| 40 |
Correct |
0 ms |
212 KB |
Output is correct |
| 41 |
Incorrect |
1 ms |
296 KB |
Output isn't correct |
| 42 |
Correct |
0 ms |
212 KB |
Output is correct |
| 43 |
Correct |
0 ms |
212 KB |
Output is correct |
| 44 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
| 45 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
