#include <bits/stdc++.h>
#define pii pair<int,int>
#define iii pair<int,pii>
#define fi first
#define se second
#define vi vector<int>
#define vii vector<pii>
#define pb(i) push_back(i)
#define all(x) x.begin(),x.end()
#define TEXT "a"
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
const int inf = 1e9 + 7;
const ld eps = 1e-8;
const double pi = acos(-1);
ll dp[20][11][11][2][2];
string s;
int n;
string conv(ll x){
string res = "";
while(x){
res += (x % 10) + '0';
x /= 10;
}
reverse(all(res));
return res;
}
ll f(int pos,int l,int p,bool small,bool start){
if (pos == n) return 1;
ll &res = dp[pos][l][p][small][start];
if (res != -1) return res;
int num = s[pos] - '0';
res = 0;
for (int i = 0; i <= 9; i++){
bool nsmall = small | (i < num);
bool nstart = start | (i > 0);
if ((small == 0) && (i > num)) break;
if (start && (i == p || i == l)) continue;
res += f(pos + 1,i,l,nsmall,nstart);
}
return res;
}
ll cal(ll x){
if (x < 0) return 0;
memset(dp,-1,sizeof(dp));
s = conv(x);
n = s.size();
return f(0,10,10,0,0);
}
int main(){
cin.tie(0) -> sync_with_stdio(0);
if (fopen(TEXT".inp","r")){
freopen(TEXT".inp","r",stdin);
freopen(TEXT".out","w",stdout);
}
ll a,b;
cin >> a >> b;
ll res = cal(b) - cal(a - 1);
cout << res << "\n";
return 0;
}
Compilation message
numbers.cpp: In function 'int main()':
numbers.cpp:67:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
67 | freopen(TEXT".inp","r",stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
numbers.cpp:68:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
68 | freopen(TEXT".out","w",stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 2 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 7 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 8 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 9 |
Correct |
0 ms |
348 KB |
Output is correct |
| 10 |
Correct |
1 ms |
348 KB |
Output is correct |
| 11 |
Correct |
0 ms |
348 KB |
Output is correct |
| 12 |
Correct |
0 ms |
348 KB |
Output is correct |
| 13 |
Correct |
0 ms |
348 KB |
Output is correct |
| 14 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 15 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 16 |
Correct |
1 ms |
348 KB |
Output is correct |
| 17 |
Correct |
0 ms |
348 KB |
Output is correct |
| 18 |
Correct |
0 ms |
348 KB |
Output is correct |
| 19 |
Correct |
0 ms |
348 KB |
Output is correct |
| 20 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
348 KB |
Output is correct |
| 2 |
Correct |
1 ms |
348 KB |
Output is correct |
| 3 |
Correct |
1 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
| 6 |
Correct |
0 ms |
348 KB |
Output is correct |
| 7 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 8 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 9 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 10 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 11 |
Correct |
0 ms |
348 KB |
Output is correct |
| 12 |
Incorrect |
0 ms |
460 KB |
Output isn't correct |
| 13 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 14 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
| 15 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 16 |
Correct |
1 ms |
344 KB |
Output is correct |
| 17 |
Correct |
1 ms |
348 KB |
Output is correct |
| 18 |
Correct |
0 ms |
348 KB |
Output is correct |
| 19 |
Correct |
0 ms |
348 KB |
Output is correct |
| 20 |
Correct |
1 ms |
348 KB |
Output is correct |
| 21 |
Correct |
0 ms |
348 KB |
Output is correct |
| 22 |
Correct |
0 ms |
348 KB |
Output is correct |
| 23 |
Correct |
0 ms |
348 KB |
Output is correct |
| 24 |
Correct |
0 ms |
348 KB |
Output is correct |
| 25 |
Correct |
0 ms |
348 KB |
Output is correct |
| 26 |
Correct |
0 ms |
348 KB |
Output is correct |
| 27 |
Correct |
0 ms |
348 KB |
Output is correct |
| 28 |
Correct |
1 ms |
348 KB |
Output is correct |
| 29 |
Correct |
0 ms |
348 KB |
Output is correct |
| 30 |
Correct |
1 ms |
348 KB |
Output is correct |
| 31 |
Correct |
1 ms |
348 KB |
Output is correct |
| 32 |
Correct |
1 ms |
348 KB |
Output is correct |
| 33 |
Correct |
1 ms |
460 KB |
Output is correct |
| 34 |
Correct |
1 ms |
348 KB |
Output is correct |
| 35 |
Correct |
0 ms |
348 KB |
Output is correct |
| 36 |
Correct |
1 ms |
348 KB |
Output is correct |
| 37 |
Correct |
0 ms |
348 KB |
Output is correct |
| 38 |
Correct |
1 ms |
348 KB |
Output is correct |
| 39 |
Correct |
1 ms |
348 KB |
Output is correct |
| 40 |
Correct |
1 ms |
348 KB |
Output is correct |
| 41 |
Correct |
1 ms |
344 KB |
Output is correct |
| 42 |
Correct |
1 ms |
348 KB |
Output is correct |
| 43 |
Correct |
0 ms |
348 KB |
Output is correct |
| 44 |
Correct |
1 ms |
348 KB |
Output is correct |
| 45 |
Correct |
0 ms |
348 KB |
Output is correct |
