# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
977125 | VMaksimoski008 | Palindrome-Free Numbers (BOI13_numbers) | C++17 | 3 ms | 1800 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
string s;
ll dp[19][11][11][2][2][19];
ll f(int pos, int last1, int last2, bool under, bool started, int len) {
if(pos == s.size()) return 1;
if(dp[pos][last1][last2][under][started][len] != -1) return dp[pos][last1][last2][under][started][len];
ll ans = 0;
for(int i=0; i<=9; i++) {
if(len >= 1 && i == last1) continue;
if(len >= 2 && i == last2) continue;
if(!under && (i > (s[pos] - '0'))) continue;
bool ns = started | (i > 0);
ans += f(pos+1, i, last1, under | (i < (s[pos] - '0')), ns, len + ns);
}
return dp[pos][last1][last2][under][started][len] = ans;
}
ll cnt(ll x) {
s = to_string(x);
memset(dp, -1, sizeof(dp));
return f(0, 10, 10, 0, 0, 0);
}
int main() {
ll l, r;
cin >> l >> r;
cout << cnt(r) - cnt(l-1) << '\n';
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |