forked from hanascodes/Programiranje-1
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathGrupa A - Zadatak 04.cpp
99 lines (76 loc) · 1.64 KB
/
Grupa A - Zadatak 04.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
#include <iostream>
using namespace std;
const int d = 10;
void unos(int niz[][d]);
int brCif(int broj);
int max_avg(int niz[][d]);
int min_avg(int niz[][d]);
int main()
{
int niz[d][d];
unos(niz);
cout << "Red sa najvecim prosjekom je: " << max_avg(niz) + 1 << endl;
cout << "Kolona sa najmanjim prosjekom je: " << min_avg(niz) + 1 << endl;
system("pause>0");
return 0;
}
int max_avg(int niz[][d])
{
double max_avg_r[d] = {0};
int max;
for(int i = 0; i < d; i++)
{
for(int j = 0; j < d; j++)
{
max_avg_r[i] += niz[j][i];
}
max_avg_r[i] /= d;
}
max = 0;
for(int i = 1; i < d; i++)
if(max_avg_r[max] < max_avg_r[i])
max = i;
return max;
}
int min_avg(int niz[][d])
{
double min_avg_k[d] = {0};
int min;
for(int i = 0; i < d; i++)
{
for(int j = 0; j < d; j++)
{
min_avg_k[i] += niz[i][j];
}
min_avg_k[i] /= d;
}
min = 0;
for(int i = 1; i < d; i++)
if(min_avg_k[min] > min_avg_k[i])
min = i;
return min;
}
int brCif(int broj)
{
int duzina = 0;
do
{
broj /= 10;
duzina++;
}while(broj > 0);
return duzina;
}
void unos(int niz[][d])
{
for(int i = 0; i < d; i++)
{
for(int j = 0; j < d; j++)
{
do
{
cout << "Unesite niz["<< i << "][" << j << "]: " << endl;
cin >> niz[i][j];
}while(brCif(niz[i][j]) % 2 == 0);
}
}
}