Coodechef Root of the Problem Problem Code: TREEROOT solution


Solution in C++:
///**********ALLAH IS ALMIGHTY************///
///AH Tonmoy
///Department of CSE,23rd batch
///Islamic University,Bangladesh

#include<iostream>
using namespace std;
int main()
{
    int n,a,b,t1,b1,t;
    cin>>t;
    while(t--)
    {
        t1=0,b1=0;
        cin>>n;
        while(n--)
        {
            cin>>a>>b;
            t1=t1+a;
            b1=b1+b;
        }
        cout<<t1-b1<<endl;
    }
    return 0;
}

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.