USACO 1.3 Combination Lock

难道是USACO更新新加的题？我以前好像没写过这题啊！

直接穷举判重，省事直接用map解决。

/*
TASK:combo
LANG:C++
*/
#include <iostream>
#include <cstdio>
#include <map>
using namespace std;

int n;

struct num
{
	int a, b, c;
	num(int A, int B, int C):a(A), b(B), c(C){};
	num(){}
}A1, A2;

bool operator < (num A, num B)
{
	if (A.a != B.a)	return A.a < B.a;
	if (A.b != B.b)	return A.b < B.b;
	return A.c < B.c;
}

inline int adj(int k)
{
	if (k < 0)	k += n;
	return k %= n;
}

map<num, bool>G;

int main()
{
	freopen("combo.in","r",stdin);
	freopen("combo.out", "w", stdout);
	std::ios::sync_with_stdio(false);
	cin >> n;
	int tx, ty, tz;
	cin >> tx >> ty >> tz;
	G[A1 = num(tx - 1, ty - 1, tz - 1)] = 0;
	cin >> tx >> ty >> tz;
	G[A2 = num(tx - 1, ty - 1, tz - 1)] = 0;

	for (int i = -2; i <= 2; ++ i)
		for (int j = -2; j <= 2; ++ j)
			for (int k = -2; k <= 2; ++ k)
			{
				tx = adj(A1.a + i);
				ty = adj(A1.b + j);
				tz = adj(A1.c + k);
				G[num(tx, ty, tz)] = 0;
				tx = adj(A2.a + i);
				ty = adj(A2.b + j);
				tz = adj(A2.c + k);
				G[num(tx, ty, tz)] = 0;
			}
	cout<<G.size()<<endl;
	return 0;
}