Cod sursa(job #3248673)
Utilizator | Data | 12 octombrie 2024 16:41:44 | |
---|---|---|---|
Problema | Algoritmul lui Dijkstra | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include<iostream>
using namespace std;
int main() {
int n,a[201], sum=0, cnt=0;
cin >> n;
for(int i=1; i<=n; i++) {
cin >> a[i];
if(a[i]!=0) {
cnt++;
}
sum+=a[i];
}
sum/=cnt;
for(int i=1; i<=n; i++) {
if(a[i] == 0)
cout << sum << ' ';
else
cout << a[i] << ' ';
}
return 0;
}