Codeforces Round #792 (Div. 1 + Div. 2) 1684 B - Z mod X = C Solution

 

Problem Link:  https://codeforces.com/contest/1684/problem/B

Solution in C++: 

///La ilaha illellahu muhammadur rasulullah

///******Bismillahir-Rahmanir-Rahim******///

///Abul Hasnat  Tonmoy

///Department of CSE,23rd batch

///Islamic University,Bangladesh

///**********ALLAH IS ALMIGHTY************///

#include <bits/stdc++.h>

using namespace std;

int main()

{

    long long a,b,c,t;

    cin>>t;

    while(t--)

    {

        cin>>a>>b>>c;

        cout<<a+b+c<<" "<<b+c<<" "<<c<<endl;

    }

}