1762A - Divide and Conquer - CodeForces Solution


greedy math number theory *800

Please click on ads to support us..

C++ Code:

#include <bits/stdc++.h>
#define ll long long int
using namespace std;
void solve() {
    int n;
    cin>>n;
    int sum=0, odd=INT_MAX, even=INT_MAX;
    for(int i=0; i<n; i++) {
        int val;
        cin>>val;
        sum+=val;
        if(val&1) {
            int cnt=0;
            while(val&1) {
                // cout<<val<<endl;
                val/=2;
                cnt++;
            }
            odd=min(odd, cnt);
        }
        else {
            int cnt=0;
            while(!(val&1)) {
                val/=2;
                cnt++;
            }
            even=min(even, cnt);
        }
    }
    // cout<<"&"<<sum<<endl;
    if(sum%2==0) 
        cout<<0<<endl;
    else 
        cout<<min(odd, even)<<endl;
}
int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
	int t; cin>>t; while(t--)
	solve();
    return 0;
}


Comments

Submit
0 Comments
More Questions

766B - Mahmoud and a Triangle
1618C - Paint the Array
469A - I Wanna Be the Guy
1294A - Collecting Coins
1227A - Math Problem
349A - Cinema Line
47A - Triangular numbers
1516B - AGAGA XOOORRR
1515A - Phoenix and Gold
1515B - Phoenix and Puzzle
155A - I_love_username
49A - Sleuth
1541A - Pretty Permutations
1632C - Strange Test
673A - Bear and Game
276A - Lunch Rush
1205A - Almost Equal
1020B - Badge
1353A - Most Unstable Array
770A - New Password
1646B - Quality vs Quantity
80A - Panoramix's Prediction
1354B - Ternary String
122B - Lucky Substring
266B - Queue at the School
1490A - Dense Array
1650B - DIV + MOD
1549B - Gregor and the Pawn Game
553A - Kyoya and Colored Balls
1364A - XXXXX