G-Good numbers

If we sum up every digit of a number and the result can be exactly divided by 10, we say this number is a good number. 
You are required to count the number of good numbers in the range from A to B, inclusive.
Input
The first line has a number T (T <= 10000) , indicating the number of test cases. 
Each test case comes with a single line with two numbers A and B (0 <= A <= B <= 10 18).
Output
For test case X, output "Case #X: " first, then output the number of good numbers in a single line.
Sample Input
2
1 10
1 20
Sample Output
Case #1: 0
Case #2: 1
Hint
The answer maybe very large, we recommend you to use long long instead of int.

题意大概就是 只要每位数上的数字加起来是十的倍数  就是好数字

直接规律就行了  从19开始  每10个数字里有一个。

#include<iostream>

using namespace std;
long long a,b,c,d,e,ans2;
int suma,sumb,sym;
long long sum( long long n)
{
    long long ans=0;
    while(n)
    {
        ans+=n%10;
        n/=10;
    }
    return ans;
}
int main()
{
int i,t,k,num;
while(cin>>t){
k=0;
while(t--){
cin>>a>>b;    
ans2=0;
suma=b%10;   
d=b/10;      
sumb=sum(d);   
num=(sumb+9)-(sumb+9)%10; 
if(suma>=(num-sumb))
ans2++;
suma=a%10;
d=a/10;
sumb=sum(d);
num=(sumb+9)-(sumb+9)%10;
if((suma>(num-sumb)&&(a>=10))||(a>0&&a<10))
ans2--;
c=b-b%10-a+a%10;
e=c/10;
ans2+=e;
cout<<"Case #"<<++k<<": "<<ans2<<endl;
}}
}