1684B - Z mod X = C - CodeForces Solution

constructive algorithms math *800

Please click on ads to support us..

Python Code: 

for i in range(int(input())):
    f,g,h = map(int,input().split())
    a = f+g+h
    b = g+h
    print(a,b,h)

C++ Code: 

#include <bits/stdc++.h>
using namespace std;
int main(){
long long t;
cin>>t;
while (t--)
{
long long a,b,c;
cin>>a>>b>>c;
long long x=(a+b+c)-((b+c)%b);
cout<<x<<" "<<b<<" "<<c<<endl;
}
}


Comments

Submit
0 Comments
More Questions

1608B - Build the Permutation
1505A - Is it rated - 2
169A - Chores
765A - Neverending competitions
1303A - Erasing Zeroes
1005B - Delete from the Left
94A - Restoring Password
1529B - Sifid and Strange Subsequences
1455C - Ping-pong
1644C - Increase Subarray Sums
1433A - Boring Apartments
1428B - Belted Rooms
519B - A and B and Compilation Errors
1152B - Neko Performs Cat Furrier Transform
1411A - In-game Chat
119A - Epic Game
703A - Mishka and Game
1504C - Balance the Bits
988A - Diverse Team
1312B - Bogosort
1616B - Mirror in the String
1660C - Get an Even String
489B - BerSU Ball
977C - Less or Equal
1505C - Fibonacci Words
1660A - Vasya and Coins
1660E - Matrix and Shifts
1293B - JOE is on TV
1584A - Mathematical Addition
1660B - Vlad and Candies