Radical and array

時間限制: 1 Sec??內存限制: 128 MB
提交: 46??解決: 27
[提交][狀態]

題目描述

Radical has an array , he wants the array to have as many equal numbers as possible. He can performs the following operation as many times as he wants: 1.he chooses two elements of the array a[i] , a[j] (i!=j). 2.he simultaneously increases number a[i] by 1 and decreases number a[j] by 1 Now he want to know what maximum number of equal array elements he can get if he performs an arbitary number of such operation.

輸入

The first line contains integer n (1?≤?n?≤?10⁵) — the array size. The second line contains space-separated integers a1,?a2,?...,?an (ai?≤?100000) — the original array.

輸出

Print a single integer — the maximum number of equal array elements Radical can get if he performs an arbitrary number of the given operation.

樣例輸入

2 2 3 3 2 4 3

樣例輸出

1 3

經過任意次，在數組里任意取數，一個數相加，一個數相減后，最多可以得到幾個相等的數
先求出平均值想必是極好噠。我們當然想盡量把所有數都湊成平均值，如果一定會有的數湊不成，那這些數就可以讓我們隨意拿來減或者加，以便讓其他數減或加湊成平均值。而這些數之和與平均值的余數 #include<iostream> #include<cstdio> #include<cstring>using namespace std;#define N 100005int main() {int n, a[N], sum;while(cin >> n){memset(a, 0, sizeof(a));sum = 0;for(int i = 0; i < n; i++){cin >> a[i];sum += a[i];}int x = sum / n;int y = sum % n;if(y == 0)printf("%d\n", n);else{printf("%d\n", n-1-y/(x+1));}}return 0; }

?

轉載于:https://www.cnblogs.com/Tinamei/p/4689691.html

總結

以上是生活随笔為你收集整理的Radical and array的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。