LightOJ 1136 - Division by 3（找规律）

最新推荐文章于 2021-08-22 11:20:08 发布

原创最新推荐文章于 2021-08-22 11:20:08 发布 · 987 阅读

1 ·

本内容遵循CC 4.0 BY-SA版权协议

OJ练习专栏收录该内容

218 篇文章

订阅专栏

本文介绍了一种解决特定数学序列问题的方法，该序列由连续递增的整数组成，从1开始连接形成一个长数字串。文章通过分析数的特性找到了一种快速判断这些数是否能被3整除的规律，并给出了解决方案。

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 A^th number to B^th (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 < 2³¹) in a line.

Output

For each case, print the case number and the total numbers in the sequence between A^th and B^th which are divisible by 3.

Sample Input

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;
}