Time Limit: 2 second(s) | Memory Limit: 32 MB |
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 toBth (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 | Output for Sample Input |
2 3 5 10 110 | Case 1: 2 Case 2: 67 |
题解:多写几个就会发现规律
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
#define CLR(a,b) memset(a,b,sizeof(a))
#define INF 0x3f3f3f3f
#define LL long long
#define M 1e9+10
int main()
{
int u,ca=1;
scanf("%d",&u);
while(u--)
{
LL n,m,num1,num2;
scanf("%lld%lld",&n,&m);
n-=1;
num1=n/3;
if(n%3==0)
num1*=2;
else if(n%3==1)
num1=num1*2;
else
num1=2*num1+1;
num2=m/3;
if(m%3==0)
num2=num2*2;
else if(m%3==1)
num2=num2*2;
else
num2=2*num2+1;
printf("Case %d: %d\n",ca++,num2-num1);
}
return 0;
}