向量

1.题目

2.分析

有四种操作方式 $(a,b),(a,-b),(b,a),(b,-a)$

设第$i$个方程的操作数量是$A_i$

$\therefore A_{1}a+A_{2}a+A_{3}b+A_{4}b=x①$
$且A_{1}b-A_{2}b+A_{3}a-A_{4}a=y②$
由$①+②可得：A_1(a-b)+A_2(a+b)+A_3(b-a)+A_4(a+b)=x+y$
即$(A_2+A_4)(a+b)+(A_1-A_3)(a-b)=x+y$

由$①：(A_1+A_2)a+(A_3+A_4)b=x\Rightarrow (a,b)\mid x$
由$②：(A_1-A_2)a+(A_3-A_4)b=y\Rightarrow (a,b)\mid y$
由$③：(a+b,a-b)\mid (x+y)$

3.参考代码

#include <cstdio>
#include <iostream>
#define LL long long
using namespace std;

int t;

LL a, b, x, y;

LL gcd (LL x, LL y);
LL Abs (LL x) { return x > 0 ? x : -x; }

int main () {
	scanf ("%d", &t);
	while (t--) {
		scanf ("%lld %lld %lld %lld", &a, &b, &x, &y);
//		printf ("x = %d, y = %d\n", x, y);
//		printf ("gcd = %d\n", gcd (b - a, gcd (a + b, a)));
		int flag1 = x % gcd (a, b), flag2 = y % gcd (a, b), flag3 = (x - y) % gcd (a + b, a - b), flag4 = (x + y) % gcd (a + b, a - b);
		if (flag1 || flag2 || flag3 || flag4) {//flag(1~4)随便选3个都能过
			printf ("N\n");
		}
		else {
			printf ("Y\n");
		}
	}
	return 0;
}

LL gcd (LL x, LL y) {
	if (Abs (x) < Abs (y)) swap (x, y);
	if (y == 0) return x;
	return gcd (y, x % y);
}

question:

③由①和②推出，为什么会得到不同的结论呢？求助orz