#include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
const int MAXL = 10;
const int MAXD = 20;
int v[MAXD];
lli A, B;
lli dp[MAXD][MAXL][MAXL][2];
lli solve(int i, int l1, int l2, int eq)
{
lli& ans = dp[i][l1][l2][eq];
if( ans != -1 ) return ans;
if( i == 0 ) return ans = 1;
ans = 0;
if( eq == 1 )
{
if( v[i] != l1 && v[i] != l2 ) ans += solve( i - 1 , v[i] , l1 , 1 );
for(int j = 0 ; j < v[i] ; j++)
if( j != l1 && j != l2 ) ans += solve( i - 1 , j , l1 , 0 );
}
else
{
for(int j = 0 ; j < 10 ; j++)
if( j != l1 && j != l2 ) ans += solve( i - 1 , j , l1 , 0 );
}
return ans;
}
lli s(lli k)
{
if( k <= 10 ) return k + 1;
int last;
for(int i = 1 ; i <= 19 ; i++)
{
v[i] = k%10;
k /= 10;
if( v[i] != 0 ) last = i;
}
memset( dp , -1 , sizeof(dp) );
lli ans = 0;
for(int i = 1 ; i < 10 ; i++)
{
for(int j = 0 ; j < 10 ; j++)
{
if( i == j ) continue;
if( i > v[last] ) continue;
if( i == v[last] && j > v[last - 1] ) continue;
if( i == v[last] && j == v[last - 1] ) ans += solve( last - 2 , j , i , 1 );
else ans += solve( last - 2 , j , i , 0 );
}
}
for(int sz = 2 ; sz < last ; sz++)
for(int i = 1 ; i < 10 ; i++)
for(int j = 0 ; j < 10 ; j++) if( i != j ) ans += solve( sz - 2 , j , i , 0 );
return ans + 10;
}
int main()
{
scanf("%lld %lld",&A,&B);
printf("%lld\n",s( B ) - s( A - 1 ));
}
Compilation message
numbers.cpp: In function 'int main()':
numbers.cpp:81:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%lld %lld",&A,&B);
~~~~~^~~~~~~~~~~~~~~~~~~
numbers.cpp: In function 'lli s(lli)':
numbers.cpp:64:18: warning: 'last' may be used uninitialized in this function [-Wmaybe-uninitialized]
if( i > v[last] ) continue;
~~~~~~^
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
508 KB |
Output is correct |
| 2 |
Correct |
2 ms |
376 KB |
Output is correct |
| 3 |
Correct |
2 ms |
376 KB |
Output is correct |
| 4 |
Correct |
2 ms |
376 KB |
Output is correct |
| 5 |
Correct |
2 ms |
256 KB |
Output is correct |
| 6 |
Correct |
2 ms |
376 KB |
Output is correct |
| 7 |
Correct |
2 ms |
380 KB |
Output is correct |
| 8 |
Correct |
2 ms |
376 KB |
Output is correct |
| 9 |
Correct |
2 ms |
376 KB |
Output is correct |
| 10 |
Correct |
2 ms |
376 KB |
Output is correct |
| 11 |
Correct |
3 ms |
376 KB |
Output is correct |
| 12 |
Correct |
2 ms |
376 KB |
Output is correct |
| 13 |
Correct |
2 ms |
376 KB |
Output is correct |
| 14 |
Correct |
2 ms |
376 KB |
Output is correct |
| 15 |
Correct |
3 ms |
376 KB |
Output is correct |
| 16 |
Correct |
2 ms |
376 KB |
Output is correct |
| 17 |
Correct |
2 ms |
376 KB |
Output is correct |
| 18 |
Correct |
2 ms |
256 KB |
Output is correct |
| 19 |
Correct |
2 ms |
376 KB |
Output is correct |
| 20 |
Correct |
2 ms |
396 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
Output is correct |
| 2 |
Correct |
2 ms |
376 KB |
Output is correct |
| 3 |
Correct |
2 ms |
376 KB |
Output is correct |
| 4 |
Correct |
2 ms |
376 KB |
Output is correct |
| 5 |
Correct |
2 ms |
376 KB |
Output is correct |
| 6 |
Correct |
2 ms |
376 KB |
Output is correct |
| 7 |
Correct |
2 ms |
376 KB |
Output is correct |
| 8 |
Correct |
2 ms |
376 KB |
Output is correct |
| 9 |
Correct |
2 ms |
376 KB |
Output is correct |
| 10 |
Correct |
2 ms |
376 KB |
Output is correct |
| 11 |
Correct |
2 ms |
376 KB |
Output is correct |
| 12 |
Correct |
2 ms |
376 KB |
Output is correct |
| 13 |
Correct |
2 ms |
376 KB |
Output is correct |
| 14 |
Correct |
2 ms |
376 KB |
Output is correct |
| 15 |
Correct |
2 ms |
380 KB |
Output is correct |
| 16 |
Correct |
2 ms |
376 KB |
Output is correct |
| 17 |
Correct |
2 ms |
376 KB |
Output is correct |
| 18 |
Correct |
2 ms |
424 KB |
Output is correct |
| 19 |
Correct |
2 ms |
376 KB |
Output is correct |
| 20 |
Correct |
2 ms |
376 KB |
Output is correct |
| 21 |
Correct |
2 ms |
376 KB |
Output is correct |
| 22 |
Correct |
2 ms |
376 KB |
Output is correct |
| 23 |
Correct |
2 ms |
376 KB |
Output is correct |
| 24 |
Correct |
2 ms |
376 KB |
Output is correct |
| 25 |
Correct |
2 ms |
376 KB |
Output is correct |
| 26 |
Correct |
2 ms |
376 KB |
Output is correct |
| 27 |
Correct |
2 ms |
376 KB |
Output is correct |
| 28 |
Correct |
2 ms |
376 KB |
Output is correct |
| 29 |
Correct |
2 ms |
376 KB |
Output is correct |
| 30 |
Correct |
2 ms |
380 KB |
Output is correct |
| 31 |
Correct |
2 ms |
376 KB |
Output is correct |
| 32 |
Correct |
2 ms |
376 KB |
Output is correct |
| 33 |
Correct |
2 ms |
376 KB |
Output is correct |
| 34 |
Correct |
2 ms |
376 KB |
Output is correct |
| 35 |
Correct |
2 ms |
376 KB |
Output is correct |
| 36 |
Correct |
2 ms |
376 KB |
Output is correct |
| 37 |
Correct |
3 ms |
376 KB |
Output is correct |
| 38 |
Correct |
15 ms |
376 KB |
Output is correct |
| 39 |
Correct |
2 ms |
376 KB |
Output is correct |
| 40 |
Correct |
2 ms |
376 KB |
Output is correct |
| 41 |
Correct |
2 ms |
376 KB |
Output is correct |
| 42 |
Correct |
2 ms |
376 KB |
Output is correct |
| 43 |
Correct |
2 ms |
376 KB |
Output is correct |
| 44 |
Correct |
2 ms |
376 KB |
Output is correct |
| 45 |
Correct |
2 ms |
376 KB |
Output is correct |
