一、A. Required Remainder

本题链接：A. Required Remainder

题目：

A. Required Remainder

time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output

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⋅1e4) — 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≤1e9; 0≤y<x; y≤n≤1e9).

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.

本博客给出本题截图：

题意：找到这么一个k使得k % x = y，k的取值范围是0到n，求k的最大值

TLE代码

#include <cstdio>using namespace std;int main()
{int t;scanf("%d", &t);while (t -- ){int x, y, n;scanf("%d%d%d", &x, &y, &n);for (int i = n; i >= 0; i -- )if (i % x == y){printf("%d\n", i);break;}}return 0;
}

AC代码

#include <cstdio>using namespace std;int main()
{int t;scanf("%d", &t);while (t -- ){int x, y, n;scanf("%d%d%d", &x, &y, &n);int k = n % x;if (k >= y)printf("%d\n", n + y - k);else printf("%d\n", n - x + y  -k);}return 0;
}

总结

简单数论小题，动手模拟一下即可

Required Remainder相关推荐

A. Required Remainder
time limit per test 1 second memory limit per test 256 megabytes input standard input output standar ...
Codeforces Round #653 (Div. 3)部分题解
文章目录 A - Required Remainder B - Multiply by 2, divide by 6 C - Move Brackets D - Zero Remainder Arra ...
Codeforces Round #653 (Div. 3)(A, B, C, D, E1详解)
Codeforces Round #653 (Div. 3) Required Remainder Thinking(binary search) 既然是找最大值问题,我又懒得去推式子,于是我直接就上 ...
Codeforces Round #653 (Div. 3)
A.Required Remainder 二分 #include<iostream> #include<algorithm> using namespace std; int ...
QR code 二维码基础入门教程（三）
QR code 入门教程(三) 承接上文,我们已经说过了数据编码和纠错码的生成,接下来我们继续下面的步骤结构化最终的数据所谓的结构化(Structure),说白了就是如何把之前生成的数据排成一个比 ...
MAC最详细配置rz/sz命令
Mac服务器文件交互在Mac中使用rz,sz命令去和服务器进行文件交互,下面介绍一下如何配置MAC上的rz,sz. 1.安装iterm2 Mac自带的终端是不支持lrzsz,需要下载Mac上强大的终 ...
转载一片Mac电脑iterm2配置rz、sz命令超级实用
rz .sz 是什么意思? rz 即 recv-zmodem,receive zmodem 接收协议(对服务器),对本机表现为上传. sz 即 send-zmodem,send zmodem 发送协议 ...
iterm2配置rz sz
1.首先安装brew,参考:Mac 安装 brew_sun_boy的博客-CSDN博客 2.安装lrzsz : brew install lrzsz 3.下载必须文件 iterm2-recv-zmod ...
Mac. 使用 lrzsz
首先,介绍一下这两个命令. sz:将选定的文件发送到本地机器. rz:运行该命令会弹出一个文件选择窗口,从本地选择文件上传到服务器. 1.安装lrzsz 第一种安装方式: [root@msc ~]# ...

Required Remainder

文章目录

一、A. Required Remainder

总结

Required Remainder相关推荐

最新文章

热门文章