View Code of Problem 85

#include <stdio.h>

int main(void)
{
    int arr[101][101],m,n;
    while(scanf("%d%d",&m,&n) != EOF)
    {
        int i,j;
        int max[101]={0},min[101] = {0},ma[101],mi[101];
        for(i = 1;i <= m;i++)
        {
            for(j = 1;j <= n;j++)
            {
                scanf("%d",&arr[i][j]);
            }
        }
        for(i = 1;i <=m;i++)
        {
            mi[i] = 1;
            for(j = 2;j <= n;j++)
            {
                if(arr[i][mi[i]] > arr[i][j])
                    mi[i] = j;
            }
        }
        for(i = 1;i <=n;i++)
        {
            ma[i] = 1;
            for(j = 2;j <= m;j++)
            {
                if(arr[i][ma[i]] < arr[i][j])
                    ma[i] = j;
            }
        }
        for(i = 1;i <= m;i++)
        {
            if(ma[mi[i]] == i)
                printf("%d %d\n",i,mi[i]);
        }
    }
    return 0;
}

Double click to view unformatted code.


Back to problem 85