231372026-01-16 13:17:02KrisaKövek (100 pont)cpp17Accepted 100/10025ms568 KiB
#include <iostream>
#include<vector>
using namespace std;

int main()
{
    int mozg=0;
    int n;
    int osszeg=0;
    cin >> n;
vector <int> kovek(n);

int atlag;
for (int i=0;i<n;i++){
    cin >> kovek[i];
    osszeg+=kovek[i];
}
atlag=osszeg/n;
for (int i=0;i<n;i++){
    if (kovek[i]>atlag){
        mozg++;
        kovek[i+1]+=kovek[i]-atlag;
    }
    if (kovek[i]<atlag){
        mozg++;
        kovek[i+1]-=atlag-kovek[i];
    }

}
cout << mozg;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base100/100
1Accepted0/01ms512 KiB
2Accepted0/025ms564 KiB
3Accepted5/51ms316 KiB
4Accepted5/51ms316 KiB
5Accepted5/51ms316 KiB
6Accepted5/51ms316 KiB
7Accepted5/51ms316 KiB
8Accepted5/51ms316 KiB
9Accepted7/71ms316 KiB
10Accepted7/71ms316 KiB
11Accepted8/81ms500 KiB
12Accepted8/81ms316 KiB
13Accepted8/82ms408 KiB
14Accepted8/83ms316 KiB
15Accepted8/89ms568 KiB
16Accepted8/821ms520 KiB
17Accepted8/825ms568 KiB