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 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 starts with an integer T (≤ 10000), denoting the number of test cases.
Each case contains two integers A and B (1 ≤ A ≤ B < 2^{31}) in a line.
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 |
Output for Sample Input |
2 3 5 10 110 |
Case 1: 2 Case 2: 67 |
Developed and Maintained by
JANE ALAM JAN |
Copyright © 2012
LightOJ, Jane Alam Jan |