题目
题解里一个很好的思路,留着用来复习总结
#include <iostream>
#include <cstdio>
#include <cmath>
#include <iomanip>
#include <queue>
#include <map>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long ll;
const int eps = 1e-5;
int N, card[101];
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cin >> N;
int average = 0;
for (int i = 0; i < N; i++) {
cin >> card[i];
average += card[i];
}
average /= N;
int ans = 0;
for (int i = 0; i < N; i++) {
if (card[i] - average != 0) {
card[i + 1] += card[i] - average;
ans++;
}
}
cout << ans << endl;
return 0;
}