hdu 5054

http://acm.hdu.edu.cn/showproblem.php?pid=5054

确定是否矩形中点

这都能hack成功，无语

#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <string>
#include <queue>
#include <vector>
#include<set>
#include <iostream>
#include <algorithm>
using namespace std;
#define RD(x) scanf("%d",&x)
#define RD2(x,y) scanf("%d%d",&x,&y)
#define clr0(x) memset(x,0,sizeof(x))
typedef long long LL;
int x,y;
void work(int n,int m)
{
    RD2(x,y);
    if(x*2 == n && y*2 == m)
        puts("YES");
    else
        puts("NO");
    return;
}
int main() {
    int n,m;
    while(~RD2(n,m)){
        work(n,m);
    }
    return 0;
}