Codeforces 1618A - Polycarp and Sums of Subsequences Solution

   ///La ilaha illellahu muhammadur rasulullah

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

///Abul Hasnat  Tonmoy

///Department of CSE,23rd batch

    ///Islamic University,Bangladesh

    #include <bits/stdc++.h>

    using namespace std;

    int main()

    {

        int t,i,n,ans,a[10];

        cin>>t;

        while(t--)

        {

            for(i=0; i<7; i++)

                cin>>a[i];


            if(a[0]+a[1]!=a[2])

                ans=a[2];

            else

                ans=a[3];

                

            cout<<a[0]<<" "<<a[1]<<" "<<ans<<endl;

        }

    }



    No comments

    Most View Post

    Recent post

    Codeforces Round 925 (Div. 3) 1931D. Divisible Pairs Solution

        Problem Link  :   https://codeforces.com/contest/1931/problem/D S olution in C++: /// Author : AH_Tonmoy #include < bits / stdc ++. ...

    Powered by Blogger.