-
Notifications
You must be signed in to change notification settings - Fork 14
/
Copy pathGrupa A - Zadatak 04.cpp
66 lines (55 loc) · 1.19 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
#include <iostream>
using namespace std;
void unos(int niz[], int duzina)
{
for (int i = 0; i < duzina; i++)
cin >> niz[i];
}
void pronaci(int niz[], int duzina)
{
int max1 = 0, max2 = 1;
if (niz[max1] > niz[max2])
{
int temp = max1;
max1 = max2;
max2 = temp;
}
for (int i = 2; i < duzina; i++)
{
if (niz[i] > niz[max1])
max1 = i;
if (niz[i] > niz[max2] && i != max1)
max2 = i;
}
cout << "Dva najveca broja su " << niz[max1] << " i " << niz[max2] << endl;
}
float suma(int niz[], int duzina)
{
float suma = 0;
for (int i = 0; i < duzina; i++)
suma += 1.F / niz[i];
return suma;
}
int prebrojati(int niz[], int duzina)
{
int brojac = 0;
for (int i = 0; i < duzina; i++)
{
if (niz[i] > 0)
{
cout << i << " " << niz[i] << endl;
brojac++;
}
}
return brojac;
}
int main()
{
int niz[6];
unos(niz, 6);
pronaci(niz, 6);
cout << "Suma reciprocnih vrijednosti: " << suma(niz, 6) << endl;
cout << "Broj pozitivnih brojeva: " << prebrojati(niz, 6) << endl;
system("pause>0");
return 0;
}