除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

2

3 5

10 110

Sample Output

Case 1: 2

Case 2: 67

题意：如题，刚开始用暴力直接循环求每个数求余3的值，最后超时，后来发现每三个数就会有两个是3的倍数，于是乎规律出来了....

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;
int main()
{
	int T,i,a,b;
	scanf("%d",&T);
	int cc=1;
	while (T--)
	{
		int s=0,t=0;
		scanf("%d%d",&a,&b);
		if (a % 3!=1) t=1;
		if (b>a)
			t+=(b-a)/3*2;
		int k=(b-a)%3;
		for (i=0;i<k;i++)
			if ((b-i) % 3!=1) t++;
		printf("Case %d: %d\n",cc++,t);
	}
	return 0;
}