1324A - Yet Another Tetris Problem - CodeForces Solution

implementation number theory *900

Please click on ads to support us..

Python Code: 

t = int(input())
while (t):
    n = int(input())
    a = []
    s = input()
    s = s.split(' ')
    for i in range(n):
        a.append(int(s[i]))
    count = [0, 0]
    for i in range(n):
        count[a[i] % 2] = count[a[i] % 2] + 1

    if count[0] and count[1]:
        print('NO')
    else:
        print('YES')
    t = t-1

C++ Code: 

#include<bits/stdc++.h>
using namespace std;

int main(){

    int t;
    cin>>t;
    for(int l=0 ; l<t ; l++){
        int n;
        cin>>n;
        int arr[n];
        int odd=0, even=0;
        for(int i=0 ; i<n ; i++){
            cin>>arr[i];
            if(arr[i]%2==0){
                even++;
            }
            else{
                odd++;
            }
        }
        if(even==0 || odd==0){
            cout<<"YES"<<endl;
        }
        else{
            cout<<"NO"<<endl;
        }
        


    }
    return 0;
}


Comments

Submit
0 Comments
More Questions

1108B - Divisors of Two Integers
1175A - From Hero to Zero
1141A - Game 23
1401B - Ternary Sequence
598A - Tricky Sum
519A - A and B and Chess
725B - Food on the Plane
154B - Colliders
127B - Canvas Frames
107B - Basketball Team
245A - System Administrator
698A - Vacations
1216B - Shooting
368B - Sereja and Suffixes
1665C - Tree Infection
1665D - GCD Guess
29A - Spit Problem
1097B - Petr and a Combination Lock
92A - Chips
1665B - Array Cloning Technique
1665A - GCD vs LCM
118D - Caesar's Legions
1598A - Computer Game
1605A - AM Deviation
1461A - String Generation
1585B - Array Eversion
1661C - Water the Trees
1459A - Red-Blue Shuffle
1661B - Getting Zero
1661A - Array Balancing