View Code of Problem 85

#include<stdio.h>
#include<string.h>
#include<math.h>
#include<malloc.h>
 
int judge(int **a, int i, int j,int n, int m) {
	int x = a[i][j];
	for (int k = 0;k < m;k++) {
		if (a[i][k] < x)
			return 0;
	}
	for (int k = 0;k < n;k++) {
		if (a[j][k] > x)
			return 0;
	}
	return 1;
}
 
int main(){
	int n, m;
	scanf("%d%d", &n, &m);
	int a[n+10][m+10];
	for (int i = 0;i < n;i++)
		for (int j = 0;j < m;j++)
			scanf("%d", &a[i][j]);
	for (int i = 0;i < n;i++)
		for (int j = 0;j < m;j++) 
			if (judge(a, i, j, n, m))
				printf("%d %d\n", i + 1, j + 1);
		
 
 
}