246B - Increase and Decrease - CodeForces Solution


greedy math *1300

Please click on ads to support us..

Python Code:

n=int(input())
l=list(map(int,input().split(" ")))
s=sum(l)
val=n if s%n==0 else n-1
print(val)

C++ Code:

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

int main()
{
	int n ;
	cin >> n;
	vector<int>v(n);
	int sum =0;
	
	for(int i=0; i<n; i++)
	{
		cin >> v[i] ;
		sum += v[i] ;
	}

	if(sum%n)
		cout << n-1 << endl;
	else
		cout << n << endl;

}


Comments

Submit
0 Comments
More Questions

1607A - Linear Keyboard
EQUALCOIN Equal Coins
XOREQN Xor Equation
MAKEPAL Weird Palindrome Making
HILLSEQ Hill Sequence
MAXBRIDGE Maximise the bridges
WLDRPL Wildcard Replacement
1221. Split a String in Balanced Strings
1002. Find Common Characters
1602A - Two Subsequences
1555A - PizzaForces
1607B - Odd Grasshopper
1084A - The Fair Nut and Elevator
1440B - Sum of Medians
1032A - Kitchen Utensils
1501B - Napoleon Cake
1584B - Coloring Rectangles
1562B - Scenes From a Memory
1521A - Nastia and Nearly Good Numbers
208. Implement Trie
1605B - Reverse Sort
1607C - Minimum Extraction
1604B - XOR Specia-LIS-t
1606B - Update Files
1598B - Groups
1602B - Divine Array
1594B - Special Numbers
1614A - Divan and a Store
2085. Count Common Words With One Occurrence
2089. Find Target Indices After Sorting Array