HDU--4722

Good Numbers

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
#define maxn 100005
#define LL __int64
int main()
{
int T,cas=1;
cin>>T;
LL l,r;
while(T--)
{
scanf("%I64d%I64d",&l,&r);
LL ll=l,rr=r;
LL cnt1=0,cnt2=0;
LL m1=l%10,m2=r%10;
LL tmp1=l/10,tmp2=r/10;
LL t1=(l-m1-1)/10,t2=(r-m2-1)/10;
if(l==m1)t1=-1;
if(r==m2)t2=-1;
t1++,t2++;
while(tmp1)
{
cnt1+=tmp1%10;
tmp1/=10;
}
while(tmp2)
{
cnt2+=tmp2%10;
tmp2/=10;
}
for(LL i=0;i<=m1;i++)
{
if((cnt1+i)%10==0)t1++;
}
for(LL i=0;i<=m2;i++)
{
if((cnt2+i)%10==0)t2++;
}
LL cnt=0;
while(l)
{
cnt+=l%10;
l/=10;
}
if(cnt%10==0)t2++;a
printf("Case #%d: %I64d\n",cas++,t2-t1);
}
return 0;
}