# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
977129 | VMaksimoski008 | Palindrome-Free Numbers (BOI13_numbers) | C++17 | 3 ms | 1880 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 p, int L1, int L2, bool U, bool S, int L) {
if(p == s.size()) return 1;
if(dp[p][L1][L2][U][S][L] != -1) return dp[p][L1][L2][U][S][L];
ll ans = 0;
for(int i=0; i<=9; i++) {
if(L >= 1 && i == L1) continue;
if(L >= 2 && i == L2) continue;
if(!U && (i > (s[p] - '0'))) continue;
bool ns = S | (i > 0);
ans += f(p+1, i, L1, U | (i < (s[p] - '0')), ns, L + ns);
}
return dp[p][L1][L2][U][S][L] = 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... |