1691A - Beat The Odds - CodeForces Solution


brute force greedy math *800

Please click on ads to support us..

Python Code:

t_c = int(input())
while(t_c>0):
    num = int(input())
    arr = list(map(int,input().split()))
    even =0
    odd = 0
    for i in arr:
        if i%2==0:
            even = even + 1
        else:
            odd = odd + 1
    print(min(even,odd))
    t_c = t_c - 1
		 		 		  			    	 				    			

C++ Code:

#include<bits/stdc++.h>
using namespace std;
#define int long long int
int solve() {
	int t;
	cin >> t;
	while(t--) {
		int n;
		cin >> n;
		int e = 0, o = 0;
		for(int i=0; i<n; i++) {
			int y; cin >> y;
			if(y&1) {
				o++;
			}
			else {
				e++;
			}
		}
		int a = max(o, e);
		cout << n - a << endl;
	}
	return 0;
}
int32_t main(){
	#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
	#endif
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
 	solve();  
	return 0;
}


Comments

Submit
0 Comments
More Questions

1490A - Dense Array
1650B - DIV + MOD
1549B - Gregor and the Pawn Game
553A - Kyoya and Colored Balls
1364A - XXXXX
1499B - Binary Removals
1569C - Jury Meeting
108A - Palindromic Times
46A - Ball Game
114A - Cifera
776A - A Serial Killer
25B - Phone numbers
1633C - Kill the Monster
1611A - Make Even
1030B - Vasya and Cornfield
1631A - Min Max Swap
1296B - Food Buying
133A - HQ9+
1650D - Twist the Permutation
1209A - Paint the Numbers
1234A - Equalize Prices Again
1613A - Long Comparison
1624B - Make AP
660B - Seating On Bus
405A - Gravity Flip
499B - Lecture
709A - Juicer
1358C - Celex Update
1466B - Last minute enhancements
450B - Jzzhu and Sequences