11038.cpp

//BISMILLAHIRRAHMANIRRAHIM
/*
 manus tar shopner soman boro
 Author :: Shakil Ahmed
.............AUST_CSE27.........
 prob   ::
 Type   ::
 verdict::
 */

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <ctype.h>
#include <math.h>
#include <limits.h>
#include <set>
#include <algorithm>
#include <iostream>
#include <vector>
#include <stack>
#include <string>
#include <list>
#include <map>
#include <queue>
#include <sstream>
#include <utility>
#define pf(a) printf("%d\n",a)
#define pf2(a,b) printf("%d %d\n",a,b)
#define pfcs(cs,a) printf("Case %d: %d\n",cs,a)
#define sc(a) scanf("%d",&a)
#define sc2(a,b) scanf("%d %d",&a,&b)
#define pb push_back
#define mp make_pair
#define pi acos(-1.0)
#define ff first
#define i64 long long
#define ss second
#define rep(i,n) for(i = 0; i < n; i++)
#define REP(i,n) for(i=n;i>=0;i--)
#define FOR(i,a,b) for(int i = a; i <= b; i++)
#define ROF(i,a,b) for(int i = a; i >= b; i--)
#define re return
#define QI queue<int>
#define SI stack<int>
#define pii pair <int,int>
#define MAX
#define MOD
#define INF 1<<30
#define SZ(x) ((int) (x).size())
#define ALL(x) (x).begin(), (x).end()
#define sqr(x) ((x) * (x))
#define memo(a,b) memset((a),(b),sizeof(a))
#define G() getchar()


using namespace std;


template< class T > T gcd(T a, T b) { return (b != 0 ? gcd<T>(b, a%b) : a); }
template< class T > T lcm(T a, T b) { return (a / gcd<T>(a, b) * b); }
i64 dp[25][2][2][50],n,str[25];
bool vis[25][2][2][50];

i64 DP(int pos,bool hasSmall,bool start,int count)
{
       if(pos==n) return count;
       if(vis[pos][hasSmall][start][count]) return dp[pos][hasSmall][start][count];
       vis[pos][hasSmall][start][count]=1;
        i64 &ret=dp[pos][hasSmall][start][count];
       int lim=hasSmall?9:str[pos];
       int i;
       ret=0;
       if(start)
       {
              for(i=1;i<=lim;i++)
              {
                     ret+=DP(pos+1,hasSmall || (i<lim),0,count+(i==0));
              }
              ret+=DP(pos+1,1,1,0);
       }
       else
       {
              for(i=0;i<=lim;i++)
              {
                      ret+=DP(pos+1,hasSmall || (i<lim),0,count+(i==0));
              }
       }
       return ret;

}
i64 solve(i64 x)
{
       i64 y=x;
       if(x==-1) return 0;
       if(x<10) return 1;
       n=0;
       while(x)
       {
              str[n++]=x%10;
              x/=10;
       }
       reverse(str,str+n);
       memo(vis,0);
       return DP(0,0,1,0)+1;
}
int main()
{

    //freopen("in.txt", "r", stdin);

           i64 a,b;
           while( 1 )
           {
           scanf("%lld %lld",&a,&b);
           if( a < 0 && b < 0 ) break ;
           if(a>b) swap(a,b);
           printf("%lld\n",solve(b)-solve(a-1));
           }




}