2012百度之星初赛第一场

#include <string>
#include <iostream>
#include <math.h>
using namespace std;
int main(){
long int x,a,b;
int n;
cin>>n;
while(n--)
{
cin>>x>>a>>b;
if(x>b)
cout<<0<<endl;
int length1=(int)floor(log10((double)x))+1;
int length2=(int)floor(log10((double)a))+1;
int length3=(int)floor(log10((double)b))+1;
int head1=a/(int)pow(10.0,length1);
int head2=b/(int)pow(10.0,length2);
int end1=a%(int)pow(10.0,length1);
int end2=b%(int)pow(10.0,length2);
int cha=head2-head1;
if(end1<=x&&end2>=end1)
cha++;
cout<<cha<<endl;
}
system("pause");
return 0;
}