1374A - Required Remainder - CodeForces Solution


math *800

Please click on ads to support us..

Python Code:

t=int(input())
for _ in range(t):
    x,y,n=map(int,input().split())
    temp=n%x 
    while True:
        if temp==y:
            print(n)
            break
        else:
            if y<temp:
                print(n-temp+y)
                break
            else:
                temp+=x

C++ Code:

#include <bits/stdc++.h>
using namespace std;
 
#define pb push_back
#define ll long long
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()

ll sum,mx,mn,n,m,k,d,i,j,t,ans,a,b,c,x,y,l,r;
string s,s1,s2;
char ch;

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

    t=1;cin>>t;
    while(t--){
    	cin>>a>>b>>c;
        if(c-c%a+b<=c){
            cout<<c-c%a+b<<endl;
        }else{
            cout<<c-c%a-(a-b)<<endl;
        }
        
    }




}


Comments

Submit
0 Comments
More Questions

1373C - Pluses and Minuses
1173B - Nauuo and Chess
318B - Strings of Power
1625A - Ancient Civilization
864A - Fair Game
1663B - Mike's Sequence
448A - Rewards
1622A - Construct a Rectangle
1620A - Equal or Not Equal
1517A - Sum of 2050
620A - Professor GukiZ's Robot
1342A - Road To Zero
1520A - Do Not Be Distracted
352A - Jeff and Digits
1327A - Sum of Odd Integers
1276A - As Simple as One and Two
812C - Sagheer and Nubian Market
272A - Dima and Friends
1352C - K-th Not Divisible by n
545C - Woodcutters
1528B - Kavi on Pairing Duty
339B - Xenia and Ringroad
189A - Cut Ribbon
1182A - Filling Shapes
82A - Double Cola
45A - Codecraft III
1242A - Tile Painting
1663E - Are You Safe
1663D - Is it rated - 3
1311A - Add Odd or Subtract Even