J sorevnovanie

#include <stdio.h>

int main()
{
	int a, b, q = 0, cout = 0, max = -1, prob = 1;
	scanf ("%d%d", &a, &b);
	int mas[100][100];
	int arr[100];

	for (int i = 0; i < a; i++)
	{
		for (int j = 0; j < b; j++)
		{
			scanf ("%d", &mas[i][j]);
		}
	}
	for (int i = 0; i < a; i++)
	{
		 for (int j = 0; j < b; j++)
		{
			if (mas[i][j] > max)
			{
				max = mas[i][j];
				prob = 1;
			}
		}

	}
	for (int i = 0; i < a; i++)
	{
		for (int j = 0; j < b; j++)
		{
			if (max == mas[i][j] && prob == 1)
			{
				cout++;
				arr[q] = i;
				prob = 0;
				q++;
			}
		}
		prob = 1;
	}

	printf ("%d\n", cout);
	for(int i = 0; i < q; i++)
	{
			printf ("%d\n", arr[i]);
	}
	return 0;
}