1130A - Be Positive - CodeForces Solution


implementation *800

Please click on ads to support us..

Python Code:

import math
n = int(input())
target = math.ceil(n / 2)
arr = [int(k) for k in input().split()]
neg, pos = 0, 0
for el in arr:
    if el > 0:
        pos += 1
    elif el < 0:
        neg += 1

if pos >= target:
    print(1)
elif neg >= target:
    print(-1)
else:
    print(0)

C++ Code:

#include <iostream>
#include <algorithm>
using namespace std;

int main()
{
	int n;
	while(cin>>n)//cin>>n;
	{
		int num[n],count[3]={0};
		for(int i=0;i<n;++i)
		{
			cin>>num[i];
			if( num[i] < 0 )//count -1 0 1
				count[0]++;
			else if( num[i] == 0 )
				count[1]++;
			else 
				count[2]++;
		}
//		cout<<count[0]<<" "<<count[1]<<" "<<count[2]<<endl;
		if( count[0] == count[2] && count[1] )
			cout<<  0 << endl;
		else if( (count[0] >= count[1] && count[0] >= count[2]) && (count[0] >= count[1]+count[2] ) )
			cout<< -1 << endl;
		else if( (count[2] >= count[1] && count[2] > count[0] ) && (count[2] >= count[1]+count[0]) )
			cout<<  1 << endl;	
		else 
			cout<<  0 << endl;
	}
} 
 			 		   	 	  	 			     			 	


Comments

Submit
0 Comments
More Questions

1342A - Road To Zero
1520A - Do Not Be Distracted
352A - Jeff and Digits
1327A - Sum of Odd Integers
1276A - As Simple as One and Two
812C - Sagheer and Nubian Market
272A - Dima and Friends
1352C - K-th Not Divisible by n
545C - Woodcutters
1528B - Kavi on Pairing Duty
339B - Xenia and Ringroad
189A - Cut Ribbon
1182A - Filling Shapes
82A - Double Cola
45A - Codecraft III
1242A - Tile Painting
1663E - Are You Safe
1663D - Is it rated - 3
1311A - Add Odd or Subtract Even
977F - Consecutive Subsequence
939A - Love Triangle
755A - PolandBall and Hypothesis
760B - Frodo and pillows
1006A - Adjacent Replacements
1195C - Basketball Exercise
1206A - Choose Two Numbers
1438B - Valerii Against Everyone
822A - I'm bored with life
9A - Die Roll
1430B - Barrels