# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
467564 | Leonardo_Paes | Palindrome-Free Numbers (BOI13_numbers) | C++17 | 1 ms | 332 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;
typedef long long ll;
vector<int> d;
ll dp[20][2][11][11];
ll solve(int pos, bool flag, int l1, int l2){
if(pos == d.size()) return 1;
if(dp[pos][flag][l1][l2] != -1) return dp[pos][flag][l1][l2];
ll tot = 0;
if(flag){
for(int i=0; i<10; i++){
if(i == l1 or i == l2) continue;
tot += solve(pos+1, flag, l2, i);
}
}
else{
for(int i=0; i<=d[pos]; i++){
if(i == l1 or i == l2) continue;
tot += solve(pos+1, i != d[pos] , l2, i);
}
}
return dp[pos][flag][l1][l2] = tot;
}
ll calc(ll x){
if(x < 0) return 0;
if(x == 0) return 1;
d.clear();
while(x){
d.push_back(x%10);
x /= 10;
}
reverse(d.begin(), d.end());
ll ans = 0;
memset(dp, -1, sizeof dp);
for(int i=0; i<d.size(); i++) ans += solve(i, i != 0, i == 0 ? 10 : 0, 10);
return ans;
}
int main(){
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
ll a, b;
cin >> a >> b;
cout << calc(b) - calc(a-1) << "\n";
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |