# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
696224 | vjudge1 | Palindrome-Free Numbers (BOI13_numbers) | C++14 | 3 ms | 392 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;
#define F first
#define S second
#define all(a) a.begin(), a.end()
#define pb push_back
typedef long long ll;
typedef pair<int, int> ii;
void print() {cerr << '\n';} template<typename T1, typename... T2> void print(T1 a, T2... b) {cerr << a << ' ', print(b...);}
vector<int> num;
ll a, b;
ll f[20][11][11][2];
ll dp(int i, int pre1, int pre2, bool smaller)
{
if(i == (int)num.size()) return 1;
ll &res = f[i][pre1 + 1][pre2 + 1][smaller];
if(~res) return res;
res = 0;
int lim = (smaller ? 9 : num[i]);
for(int d = 0; d <= lim; d++)
{
if(d == pre1 || d == pre2) continue;
res += dp(i + 1, pre2, pre2 == -1 && d == 0 ? -1 : d, smaller || (d < lim));
}
return res;
}
ll calc(ll n)
{
if(n <= 0) return n == 0;
num.clear();
while(n) num.pb(n % 10), n /= 10;
reverse(all(num));
memset(f, -1, sizeof f);
return dp(0, -1, -1, 0);
}
void solve()
{
cin >> a >> b;
cout << calc(b) - calc(a - 1);
}
signed main()
{
freopen("test.inp", "r", stdin);
freopen("test.out", "w", stdout);
cin.tie(0) -> sync_with_stdio(0);
int t = 1;
// cin >> t;
while(t--) solve();
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |