View Code of Problem 85

#include<bits/stdc++.h>
using namespace std;
int main()
{
	int m, n;
	int a[100][100];
	cin >> m >> n;
	for (int i = 0; i < m; i++) {
		for (int j = 0; j < n; j++)
		{
			cin >> a[i][j];
		}
	}
	for (int i = 0; i < m; i++) {
		int min = a[i][0];
		int row = 0;
		for (int j = 0; j < n; j++)
		{
			if (min > a[i][j]) {
				min = a[i][j];
				//cout << j << endl;
				row = j;
			}
		}
		int max = a[0][row];
		for (int k = 0; k < m; k++) {
			if (max < a[k][row]) {
				max = a[k][row];
			}
		}
		if (max == min) {
			cout << i + 1 << " " << row + 1 << endl;
		}
	}
}

Double click to view unformatted code.


Back to problem 85