Educational Codeforces Round 131 (Rated for Div. 2) 1701A. Grass Field Solution



Problem Link: https://codeforces.com/contest/1701/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 x,t,i,j,o,e,n;
    cin>>t;
    while(t--)
    {
        o=0;
      for(i=0;i<4;i++)
      {
          cin>>x;
          if(x==1)o++;
      }
      if(o==0)cout<<"0"<<endl;
      else if(o==4)cout<<"2"<<endl;
      else cout<<"1"<<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.