Codeforces Round #790 (Div. 4) 1676 A. Lucky? Solution



Problem Link: https://codeforces.com/contest/1676/problem/A

 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()
{
    int  n,x,y,t,r,i,mx,a,b,c,d,e,f;
    cin>>t;
    while(t--)
    {
        string s;
        a=b=0;
        cin>>s;
        for(i=0; i<3; i++)
        {
            a+=s[i]-'0';
        }
        for(i=3; i<6; i++)
        {
            b+=s[i]-'0';
        }
        if(a==b)
            cout<<"YES"<<endl;
        else
            cout<<"NO"<<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.