Description
There is sequence 1, 12, 123, 1234, ..., 12345678910, ... . Now you are given two integers A and B, you have to find the number of integers from Ath number to Bth (inclusive) number, which are divisible by 3.
For example, let A = 3. B = 5. So, the numbers in the sequence are, 123, 1234, 12345. And 123, 12345 are divisible by 3. So, the result is 2.
Input
Input starts with an integer T (≤ 10000), denoting the number of test cases.
Each case contains two integers A and B (1 ≤ A ≤ B < 231) in a line.
Output
For each case, print the case number and the total numbers in the sequence between Ath and Bth which are divisible by 3.
Sample Input
2
3 5
10 110
Sample Output
Case 1: 2
Case 2: 67
解题思路:
这道题是找规律的,首先能被三整除的数满足的的条件是:数的位数相加之和能被三整除,这样的数有一个规律就是001001001;
AC代码:
#include <stdio.h>
int f(int x)
{
int a = x / 3;
int b = x % 3;
if (b != 0)
return a * 2 + b - 1;
else
return a * 2;
}
int main()
{
int T;
int k=0;
int l,r;
scanf ("%d",&T);
while (T--)
{
scanf ("%d %d",&l,&r);
printf ("Case %d: ",++k);
printf ("%d\n", f(r) - f(l-1));
}
return 0;
}