URAL 2091

暴力枚举，搜一遍就行

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <queue>
#include <cstdlib>
#include <cstring>
#include <vector>
#include <set>
using namespace std;
#define ll long long
int N, M;
int grid[105][105];
int main()
{
	//freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);
	scanf("%d%d", &N, &M);
	for (int i = 0; i < N; ++i)
	{
		for (int j = 0; j < M; ++j)
		{
			scanf("%d", &grid[i][j]);
		}
	}
	int ans1, ans2;
	int s1, s2, s3, s4, mins, tmps;
	mins = 999999;
	for (int i = 0; i < M; ++i)
	{
		for (int j = i + 1; j < M; ++j)
		{
			s1 = 0; s2 = 0; s3 = 0; s4 = 0;
			for (int k = 0; k < N; ++k)
			{
				if (grid[k][i] == 0)
				{
					if (grid[k][j] == 0)
						++s1;
					else
						++s2;
				}
				else
				{
					if (grid[k][j] == 0)
						++s3;
					else
						++s4;
				}
			}
			tmps = max(s1, s2); tmps = max(tmps, s3); tmps = max(tmps, s4);
			if (tmps < mins)
			{
				ans1 = i + 1; ans2 = j + 1;
				mins = tmps;
			}
		}
	}
	printf("%d\n%d %d\n", mins, ans1, ans2);
	//system("pause");
	//while (1);
	return 0;
}