#10994- Need help

[dotnet12]

The solution is correct but it exceeds time limit so what can I do about it? Please tell me anyone. Here is my solution:



#include <stdio.h>

int fu(int ab)
{

if(ab%10>0 && ab>0)
{
return ab%10;
}
else
{
return ab/10;
}
}

int S(int a,int b)
{
int ans=0,i;
for(i=a;i<=b;i++)
{
ans+=fu(i);

}
printf("%d", ans);
return 0;
}


int main()
{
int in1,in2,ans;
while((scanf("%d %d",&in1,&in2)==2) && (in1!=-1 && in2!=-1))
{

if(in1>in2)
{
S(in2,in1);

}
else
{
S(in1,in2);

}

}
return 0;


}

[brianfry713]

Brute force won't work here, you'll need to come up with a faster solution.

[dotnet12]

can u give 1?

[brianfry713]

If you were asked to simply sum all the integers between p and q, would you loop? Is there a faster way?