统计一段页码间出现0的次数

#include<iostream>
#include<algorithm>

using namespace std;
const int N = 11;
int d[11];
int value;
void deal(int n)
{
if(n<=0)return;
int one, ten;
one = n%10;
n = n/10;
ten = n;
for(int i=0; i<=one; i++)
d[i] += value;
while(ten)
{
d[ten%10] += (one+1)*value;
ten /= 10;
}
for(int i=0; i<10; i++)
d[i] += value*n;
d[0] -= value;
value *= 10;
deal(n-1);
}
int main()
{
int a, b;
while(cin>>a>>b)
{
memset(d,0,sizeof(d));
value = 1;
deal(b);
value = -1;
deal(a-1);
cout<<d[0]<<endl;
}
system("pause");
return 0;
}