#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
#define scan(x) do{while((x=getchar())<'0'); for(x-='0'; '0'<=(_=getchar()); x=(x<<3)+(x<<1)+_-'0');}while(0)
char _;
#define complete_unique(a) a.erase(unique(a.begin(),a.end()),a.end())
#define all(a) a.begin(),a.end()
#define println printf("\n");
#define readln(x) getline(cin,x);
#define pb push_back
#define endl "\n"
#define INT_INF 0x3f3f3f3f
#define LL_INF 0x3f3f3f3f3f3f3f3f
#define MOD 1000000007
#define MOD2 1494318097
#define SEED 131
#define mp make_pair
#define fastio cin.tie(0); cin.sync_with_stdio(0);
#define MAXD 20
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef unordered_map<int,int> umii;
typedef pair<int,int> pii;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef pair<int,pii> triple;
typedef int8_t byte;
mt19937 g1(time(0));
int randint(int a, int b){return uniform_int_distribution<int>(a, b)(g1);}
ll randlong(ll a,ll b){return uniform_int_distribution<long long>(a, b)(g1);}
ll gcd(ll a, ll b){return b == 0 ? a : gcd(b, a % b);}
ll lcm(ll a, ll b){return a*b/gcd(a,b);}
ll fpow(ll b, ll exp, ll mod){if(exp == 0) return 1;ll t = fpow(b,exp/2,mod);if(exp&1) return t*t%mod*b%mod;return t*t%mod;}
ll divmod(ll i, ll j, ll mod){i%=mod,j%=mod;return i*fpow(j,mod-2,mod)%mod;}
int dig[MAXD];
ll a,b,dp[MAXD][MAXD][MAXD][2][2];
ll solve(int pos, int l2, int l1, int lim, int zero){
if(pos == 0) return 1;
if(dp[pos][l2][l1][lim][zero] != -1) return dp[pos][l2][l1][lim][zero];
int up = lim?dig[pos]:9;
ll res = 0;
for(int d=0; d<=up; d++){
int nl = lim&&(d==up), zz = zero&&(d==0);
if(l2 == d || l1 == d) continue;
if(zz) res+=solve(pos-1,10,10,nl,zz);
else res+=solve(pos-1,l1,d,nl,zz);
}
return dp[pos][l2][l1][lim][zero] = res;
}
inline ll init(ll n){
memset(dp,-1,sizeof dp);
int cc = 0;
while(n){
dig[++cc] = (int)(n%10);
n/=10;
}
return solve(cc,10,10,1,1);
}
int main(){
scanf("%lld %lld",&a,&b);
if(a == 0) printf("%lld\n",init(b));
else printf("%lld\n",init(b)-init(a-1));
}
Compilation message
numbers.cpp: In function 'int main()':
numbers.cpp:75:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%lld %lld",&a,&b);
~~~~~^~~~~~~~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
504 KB |
Output is correct |
| 2 |
Correct |
3 ms |
632 KB |
Output is correct |
| 3 |
Correct |
2 ms |
632 KB |
Output is correct |
| 4 |
Correct |
3 ms |
632 KB |
Output is correct |
| 5 |
Correct |
2 ms |
632 KB |
Output is correct |
| 6 |
Correct |
2 ms |
632 KB |
Output is correct |
| 7 |
Correct |
2 ms |
632 KB |
Output is correct |
| 8 |
Correct |
3 ms |
632 KB |
Output is correct |
| 9 |
Correct |
2 ms |
504 KB |
Output is correct |
| 10 |
Correct |
3 ms |
632 KB |
Output is correct |
| 11 |
Correct |
3 ms |
504 KB |
Output is correct |
| 12 |
Correct |
2 ms |
632 KB |
Output is correct |
| 13 |
Correct |
2 ms |
504 KB |
Output is correct |
| 14 |
Correct |
3 ms |
632 KB |
Output is correct |
| 15 |
Correct |
2 ms |
632 KB |
Output is correct |
| 16 |
Correct |
3 ms |
636 KB |
Output is correct |
| 17 |
Correct |
2 ms |
632 KB |
Output is correct |
| 18 |
Correct |
3 ms |
504 KB |
Output is correct |
| 19 |
Correct |
3 ms |
632 KB |
Output is correct |
| 20 |
Correct |
3 ms |
504 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
3 ms |
632 KB |
Output is correct |
| 2 |
Correct |
3 ms |
504 KB |
Output is correct |
| 3 |
Correct |
2 ms |
504 KB |
Output is correct |
| 4 |
Correct |
3 ms |
528 KB |
Output is correct |
| 5 |
Correct |
3 ms |
508 KB |
Output is correct |
| 6 |
Correct |
3 ms |
504 KB |
Output is correct |
| 7 |
Correct |
2 ms |
504 KB |
Output is correct |
| 8 |
Correct |
3 ms |
508 KB |
Output is correct |
| 9 |
Correct |
3 ms |
632 KB |
Output is correct |
| 10 |
Correct |
3 ms |
632 KB |
Output is correct |
| 11 |
Correct |
3 ms |
504 KB |
Output is correct |
| 12 |
Correct |
3 ms |
504 KB |
Output is correct |
| 13 |
Correct |
3 ms |
528 KB |
Output is correct |
| 14 |
Correct |
3 ms |
504 KB |
Output is correct |
| 15 |
Correct |
2 ms |
504 KB |
Output is correct |
| 16 |
Correct |
3 ms |
504 KB |
Output is correct |
| 17 |
Correct |
2 ms |
488 KB |
Output is correct |
| 18 |
Correct |
3 ms |
504 KB |
Output is correct |
| 19 |
Correct |
3 ms |
504 KB |
Output is correct |
| 20 |
Correct |
2 ms |
504 KB |
Output is correct |
| 21 |
Correct |
2 ms |
632 KB |
Output is correct |
| 22 |
Correct |
3 ms |
504 KB |
Output is correct |
| 23 |
Correct |
3 ms |
504 KB |
Output is correct |
| 24 |
Correct |
3 ms |
504 KB |
Output is correct |
| 25 |
Correct |
2 ms |
504 KB |
Output is correct |
| 26 |
Correct |
2 ms |
504 KB |
Output is correct |
| 27 |
Correct |
2 ms |
504 KB |
Output is correct |
| 28 |
Correct |
3 ms |
504 KB |
Output is correct |
| 29 |
Correct |
3 ms |
632 KB |
Output is correct |
| 30 |
Correct |
3 ms |
504 KB |
Output is correct |
| 31 |
Correct |
3 ms |
504 KB |
Output is correct |
| 32 |
Correct |
3 ms |
504 KB |
Output is correct |
| 33 |
Correct |
2 ms |
504 KB |
Output is correct |
| 34 |
Correct |
3 ms |
504 KB |
Output is correct |
| 35 |
Correct |
3 ms |
504 KB |
Output is correct |
| 36 |
Correct |
3 ms |
632 KB |
Output is correct |
| 37 |
Correct |
3 ms |
508 KB |
Output is correct |
| 38 |
Correct |
3 ms |
504 KB |
Output is correct |
| 39 |
Correct |
3 ms |
632 KB |
Output is correct |
| 40 |
Correct |
3 ms |
632 KB |
Output is correct |
| 41 |
Correct |
3 ms |
632 KB |
Output is correct |
| 42 |
Correct |
3 ms |
508 KB |
Output is correct |
| 43 |
Correct |
3 ms |
632 KB |
Output is correct |
| 44 |
Correct |
2 ms |
632 KB |
Output is correct |
| 45 |
Correct |
2 ms |
508 KB |
Output is correct |
