Leading and Trailing

You are given two integers: n and k, your task is to find the most significant three digits, and least significant three digits of nk.

Input
Input starts with an integer T (≤ 1000), denoting the number of test cases.

Each case starts with a line containing two integers: n (2 ≤ n < 231) and k (1 ≤ k ≤ 107).

Output
For each case, print the case number and the three leading digits (most significant) and three trailing digits (least significant). You can assume that the input is given such that nk contains at least six digits.

Sample Input

5
123456 1
123456 2
2 31
2 32
29 8751919

Sample Output

Case 1: 123 456
Case 2: 152 936
Case 3: 214 648
Case 4: 429 296
Case 5: 665 669

代码如下

#include
#include
#include
#include
using namespace std;
int main()
{
    int n;
    while(~scanf("%d",&n)&&n)
    {
        queue<long long>q;
        q.push(1);
        while(q.size())
        {
            long long m=q.front();
            q.pop();
            if(m%n==0)
            {
                printf("%lld\n",m);
                break;
            }
            q.push(m*10);
            q.push(m*10+1);
        }
    }
    return 0;
}