View Code of Problem 85

#include <stdio.h>
int main()
{
	int m, n,i,j;
	scanf("%d%d", &m, &n);
	int a[10][10] = { 0 };
	for (i = 0; i < m; i++)
		for (j = 0; j < n; j++)
			scanf("%d", &a[i][j]);
	int x = m;
	while (x--)
	{
		
		int min = a[x][0],u=0;
		for(j=0;j<n;j++)
			if (min > a[x][j])
			{
				min = a[x][j];
				u = j;
			}
		int max = a[0][u];
		for (i = 0; i < m; i++)
		{
			if (max < a[i][u])
				max=a[i][u];
		}
		if (max == min)
			printf("%d %d\n", x+1,u+1);
	}
	
		
	return 0;
}