Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- /*
- * Primjer 2.
- *
- * Za uneseno 2D polje treba pronaci najmanji element u svakom redu.
- *
- * Opis je analogan proslom primjeru, samo ovdje imamo vise redova
- */
- #include <iostream>
- using namespace std;
- int main(){
- int n, m, i, j, min;
- cout << "\nUnesite broj redova(n): ";
- cin >> n;
- cout << "\nUnesite broj stupaca(m): ";
- cin >> m;
- int polje[n][m];
- for(i = 0; i < n; i++)
- {
- for(j = 0; j < m; j++)
- {
- cout << "\npolje[" << i << "][" << j << "]: ";
- cin >> polje[i][j];
- }
- }
- for(i = 0; i < n; i++)
- {
- for(j = 0; j < m; j++)
- {
- min = polje[i][0];
- if(polje[i][j] < min)
- {
- min = polje[i][j];
- }
- }
- cout << "\nNajmanji element u " << i+1 << " redu: " << min;
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement