Codeforces Round #653 (Div. 3) [A，B，C，D，E1] 题解报告

[比赛传送门]

A. Required Remainder

You are given three integers x,y and n. Your task is to find the maximum integer k such that 0≤k≤n that kmodx=y, where mod is modulo operation. Many programming languages use percent operator % to implement it.

In other words, with given x,y and n you need to find the maximum possible integer from 0 to n that has the remainder y modulo x.

You have to answer t independent test cases. It is guaranteed that such k exists for each test case.

Input

The first line of the input contains one integer t (1≤t≤5⋅10⁴) — the number of test cases. The next t lines contain test cases.

The only line of the test case contains three integers x,y and n (2≤x≤10⁹; 0≤y<x; y≤n≤10⁹).

It can be shown that such k always exists under the given constraints.

Output

For each test case, print the answer — maximum non-negative integer k such that 0≤k≤n and kmodx=y. It is guaranteed that the answer always exists.

Example

input

7
7 5 12345
5 0 4
10 5 15
17 8 54321
499999993 9 1000000000
10 5 187
2 0 999999999

output

12339
0
15
54306
999999995
185
999999998

Note

In the first test case of the example, the answer is 12339=7⋅1762+5 (thus, 12339mod7=5). It is obvious that there is no greater integer not exceeding 12345 which has the remainder 5 modulo 7.

题意

找到n内满足减去y后可以被x整除的最大数

思路

判断floor(n/x)*x+y是否大于n，若是，输出(floor(n/x)-1)*x+y，否则输出floor(n/x)*x+y

my Accepted code

#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>

#define ll long long
#define db double
#define inf INT_MAX
#define s(a, n) memset(a, n, sizeof(a))
#define rep(l, a, b) for (ll l = a; l < b; ++l)
#define per(l, a, b) for (ll l = a; l >= b; --l)
#define debug(a) cout << '#' << a << '#' << endl

using namespace std;
bool fi = true;
const unsigned long long MOD = 1e9 + 7;

int main() {
   
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);

    int t;
    cin >> t;
    while (t--) {
   
        int x, y, n;
        cin >> x >> y >> n;
        int a = n / x;
        if (n - a * x >= y) {
   
            cout << a * x + y << endl;
        } else {
   
            cout << (a - 1) * x + y << endl;
        }
    }
}

B. Multiply by 2, divide by 6

You are given an integer n. In one move, you can either multiply n by two or divide n by 6 (if it is divisible by 6 without the remainder).

Your task is to find the minimum number of moves needed to obtain 1 from n or determine if it’s impossible to do that.

You have to answer t independent test cases.

Input
The first line of the input contains one integer t (1≤t≤2⋅10⁴) — the number of test cases. Then t test cases follow.

The only line of the test case contains one integer n (1≤n≤10⁹).

Output
For each test case, print the answer — the minimum number of moves needed to obtain 1 from n if it’s possible to do that or -1 if it’s impossible to obtain 1 from n.

Example

input

7
1
2
3
12
12345
15116544
387420489

output

0
-1
2
-1
-1
12
36

Note

Consider the sixth test case of the example. The answer can be obtained by the following sequence of moves from the given integer 15116544:

1.Divide by 6 and get 2519424;
2.divide by 6 and get 419904;
3.divide by 6 and get 69984;
4.divide by 6 and get 11664;
5.multiply by 2 and get 23328;
6.divide by 6 and get 3888;
7.divide by 6 and get 648;
8.divide by 6 and get 108;
9.multiply by 2 and get 216;
10.divide by 6 and get 36;
11.divide by 6 and get 6;
12.divide by 6 and get 1.

题意

给你一个数，你可以对它进行两种操作：

• 除以6
• 乘以2

若能在有限次回合内依据以上两种操作将这个数化为1，则输出需要的回合数。
否则输出-1

思路

无思路，暴力，当回合数超过200还没变成1，输出-1

my Accepted code

#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include