luogu1170 GCD 判符号

代码片

// An highlighted block
#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
#include <cmath>
using namespace std;
long long m,a,b,c,d;

bool read(long long &x)
{
	x = 0;
	char ch = getchar();
	while (ch < '0' || ch > '9') ch = getchar();
	while (ch >= '0' && ch <= '9'){
		x = (x<<1) + (x<<3) + ch - '0';
		ch = getchar();
	}
	return x == 0;
} 

long long gcd(long long xx, long long yy){
	if (xx < yy) swap(xx, yy);
	while (yy){
		long long tt = xx%yy;
		xx = yy;
		yy = tt;
	}
	return xx;
}

int main()
{
	read(m);
	while (m--) {
		read(a); read(b); read(c); read(d);
		if (a > c) {
			swap(a,c); swap(b,d);
		}
		if (a == c) {
			if ((b-d)*(b-d) > 1) cout<<"yes\n";
			else cout<<"no\n";
			continue;
		}
		if (b == d) {
			if ((c-a)*(c-a) > 1) cout<<"yes\n";
			else cout<<"no\n";
			continue;
		}
		long long dy = d - b;
		long long dx = c - a;
		bool flag = false;
/*		for (long long i=1; i<(c-a); i++) {
			if ((i*dy) % dx == 0) {
				flag = true;
				break;
			}
		}        */
		if (dy <= 0) dy *= (-1ll);
		if (gcd(dy,dx) != 1) flag = true;
		if (flag) cout<<"yes\n";
		else cout<<"no\n";
	}
}