Codeforces Round #578 (Div. 2) - C Round Corridor

链接: http://codeforces.com/contest/1200/problem/C

AC代码:

#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <string.h>
#include <string>
using namespace std;
typedef long long ll;
#define mem(a,num) memset(a,num,sizeof(mem))

ll n,m,q;
ll sx,sy,ex,ey;
ll g;

void solve() {
//n / g 是内圈的墙,m / g是外圈的墙;然后根据输入取第几个块
	ll nn = n / g;
	ll mm = m / g;
	sy--,ey--;
	ll c1,c2;
	//对起点
	if(sx == 1) {  //起点是内圈 
		c1 = sy / nn;
	} else {         //sx == 2 起点外圈
		c1 = sy/mm;
	}
	//对终点
	if(ex == 1) {   // 是内
		c2 = ey / nn;
	} else {    //  外
		c2 = ey / mm;
	}
	
	if(c1 == c2) {
		cout << "YES" << endl;
	} else {
		cout << "NO" << endl;
	}
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	while(cin >> n >> m >> q) {
		g = __gcd(n,m);
		for(int i = 0; i < q; i++) {
			cin >> sx >> sy >> ex >> ey;
			solve();
		}
	}
}