| Submit | All submissions | Best solutions | Back to list |
GFT2 - A Gift for You 2 |
Given two integers A and B. You have to find the smallest multiple of A that is greater than or equal to B.
Input
Input starts with an integer T (1 <= T <= 100) denoting the number of test cases. Each test case contains two integers A and B (1 <= A, B <= 2*109).
Output
For each case of input print the case number and the required answer.
|
Sample Input |
Output for Sample Input |
|
2 |
Case 1: 9 |
Problem Setter: Md Abdul Alim, Dept. of Computer Science, Bangladesh University of Business & Technology
| Added by: | Alim |
| Date: | 2014-10-17 |
| Time limit: | 2s |
| Source limit: | 50000B |
| Memory limit: | 1536MB |
| Cluster: | Cube (Intel G860) |
| Languages: | All except: ASM64 GOSU |
| Resource: | Own Problem |
RSS