Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <conio.h>
- #include <iomanip>
- using namespace std;
- //zadatak je bio Unijeti 2D niz velicine NxN minimalno trocifrenim neparnim brojevima
- //a zatim izracunati prosjeke redova i naci koji red ima najbolji prosjek i koji je to prosjek
- // Dodatni zadatak za vas je da napravite isto za kolone
- void prosjek(int[][10], int, float[]);
- void unos(int[][10], int);
- void print(int[][10], int);
- int main() {
- const int max = 10;
- int niz[max][max];
- int n;
- cout << "Unesi n: " << endl;
- cin >> n;
- float pros[10];
- unos(niz, n);
- print(niz, n);
- prosjek(niz, n, pros);
- int naj;
- float najp = pros[0];
- for (int i = 0;i < n;i++) {
- if (najp < pros[i])
- {
- najp = pros[i];
- naj = i;
- }
- }
- cout << "najveci red: " << naj << " i njegov prosjek je: " << najp << endl;
- system("pause");
- }
- void unos(int niz[][10], int n) {
- for (int i = 0;i < n;i++) {
- for (int j = 0;j < n;j++) {
- do {
- cout << "unesi [" << i + 1 << "][" << j + 1 << "]";
- cin >> niz[i][j];
- } while (niz[i][j] % 2 == 0);
- }
- }
- }
- void prosjek(int niz[][10], int n, float pros[]) {
- int sum = 0;
- for (int i = 0;i < n;i++) {
- for (int j = 0;j < n;j++)
- {
- sum += niz[i][j];
- }
- pros[i] = sum / n;
- }
- }
- void print(int niz[][10], int n) {
- for (int i = 0;i < n;i++) {
- for (int j = 0;j < n;j++) {
- cout << niz[i][j] << " ";
- }
- cout << endl;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement