2410.cpp

这是哈尔滨工业大学acmOJ的源代码

/* This Code is Submitted by wywcgs for Problem 2410 on 2006-10-26 at 11:57:18 */
#include <cstdio>
#include <algorithm>
using namespace std;

const int N = 102400;
const int D = 1024;

void build(int*, int, int, int);

int rd[D][D], c[D], r[D];

int main()
{
	int T, n, d;

	scanf("%d", &T);
	for(int t = 0; t < T; t++) {
		scanf("%d %d", &d, &n);
		memset(rd, 0, sizeof(rd));
		for(int i = 0; i < n; i++) {
			int x, y; scanf("%d %d", &x, &y);
			int rx = (x%d+d)%d, ry = (y%d+d)%d;
			rd[rx][ry]++;
		}
		memset(r, 0, sizeof(r)); memset(c, 0, sizeof(c));
		for(int i = 0; i < d; i++)
			for(int j = 0; j < d; j++)
				{ r[i] += rd[i][j]; c[j] += rd[i][j]; }
		int dk = N;
		for(int i = 0; i < d; i++)
			for(int j = 0; j < d; j++)
				dk <?= r[i]+c[j]-rd[i][j];
		printf("%d\n", dk);
	}
	
	return 0;
}