220502026-01-14 16:07:59Tibi23Kövek (100 pont)cpp17Accepted 100/10027ms1168 KiB
#include <iostream>
#include <bits/stdc++.h>

using namespace std;

int main()
{
   int n;
   cin>>n;
   vector<int> kovek(n,0);  //n-eelmű listát csinál
                            //minden elem 0 lesz
   for(int i=0; i<n;i++){
     cin>>kovek[i];
   }

   int osszeg=0;
   for(int i=0; i<n; i++){
        osszeg = osszeg+kovek[i];

   }
   int atlag = osszeg/n;
  // cout<<atlag<<endl;

   int db=0;                        //minden elem 0 lesz

    for(int i=0; i<n;i++){

        if( kovek[i]<atlag){

            kovek[i+1] -= atlag-kovek[i];
            kovek[i]  += atlag-kovek[i];
            db++;
        }

        if (kovek[i]>atlag){
            kovek[i+1] += kovek[i]-atlag;
            kovek[i] -= kovek[i]-atlag;
            db++;
        }


    }
    cout<<db<<endl;
    for(int x : kovek){
      //  cout<<x<<" ";
    }
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base100/100
1Accepted0/01ms316 KiB
2Accepted0/027ms564 KiB
3Accepted5/51ms316 KiB
4Accepted5/51ms316 KiB
5Accepted5/51ms316 KiB
6Accepted5/51ms316 KiB
7Accepted5/51ms316 KiB
8Accepted5/51ms316 KiB
9Accepted7/71ms508 KiB
10Accepted7/71ms332 KiB
11Accepted8/81ms316 KiB
12Accepted8/81ms316 KiB
13Accepted8/82ms416 KiB
14Accepted8/83ms316 KiB
15Accepted8/89ms552 KiB
16Accepted8/823ms756 KiB
17Accepted8/827ms1168 KiB