A. Required Remainder
题意:
问能不能找到一个最大的K使得0≤k≤n &&k%x==y
思路:
还能怎么办?直接算啊
代码附:
#pragma GCC optimize("Ofast","inline","-ffast-math")
#pragma GCC target("avx,sse2,sse3,sse4,mmx")
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N = 2e5+10;
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int t,x,y,n,k;
cin>>t;
while(t--)
{
cin>>x>>y>>n;
k=x*(n/x)+y;
if(k>n)
k=max(k-x,(int)0);
cout<<k<<endl;
}
return 0;
}