CF1352C.K-th Not Divisible by n

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

You are given two positive integers nn and kk . Print the kk -th positive integer that is not divisible by nn .

For example, if n=3n=3 , and k=7k=7 , then all numbers that are not divisible by 33 are: 1,2,4,5,7,8,10,11,131, 2, 4, 5, 7, 8, 10, 11, 13 \dots . The 77 -th number among them is 1010 .

输入格式

The first line contains an integer tt ( 1t10001 \le t \le 1000 ) — the number of test cases in the input. Next, tt test cases are given, one per line.

Each test case is two positive integers nn ( 2n1092 \le n \le 10^9 ) and kk ( 1k1091 \le k \le 10^9 ).

输出格式

For each test case print the kk -th positive integer that is not divisible by nn .

输入输出样例

  • 输入#1

    6
    3 7
    4 12
    2 1000000000
    7 97
    1000000000 1000000000
    2 1

    输出#1

    10
    15
    1999999999
    113
    1000000001
    1
首页