#include <stdio.h>

#define n 10

int arr[n][n];

int pos_max(int i){
    int max = 0;
    for (int j = 0; j < n; j++) {
        if (arr[i][j] > arr[i][max]) {
            max = j;
        }
    }
    return max;
}

int main() {
    int i;
    int j;
    int flag = 0;
    char c;
    int max = 0;
    printf("Input arr: \n");
    for (i = 0; i < n; i++){
        for (j = 0; j < n; j++){
            while (scanf("%d%c", &arr[i][j], &c) != 2 && c != '/n'){
                rewind(stdin);
                printf("Try again\n");
            }
        }
    }
    printf("array:\n");
    for (i = 0; i < n; i++) {
        for (j = 0; j < n; j++) {
            printf("%d ",arr[i][j]);
        }
        printf("\n");
    }
    for (i = 0; i < n; i++) {
        max = pos_max(i);
        for (j = 0; j < n; j++) {
            if (arr[j][max] < arr[i][max]) {
                break;
            }
        }
        if (j == n) {
            printf("Saddle points are: ") ;
            printf("arr[%d][%d] = %d\n",i + 1,max +1, arr[i][max]);
            flag = 1;
        }
    }
    if (flag == 0) {
        printf("No saddle points\n");
    }
    return 0;
}