11498 - Division of Nlogonia

程式碼:

#include <iostream>
using namespace std;


int main()
{
    int k,n,m,x,y;
    while(cin>>k)
    {
        if(k==0) break;
        cin>>n>>m;
        for(int i=0;i<k;i++)
        {
            cin>>x>>y;
            if(x==n||y==m) cout<<"divisa"<<endl;
            else if(x>n&&y>m) cout<<"NE"<<endl;
            else if(x>n&&y<m) cout<<"SE"<<endl;
            else if(x<n&&y>m) cout<<"NO"<<endl;
            else cout<<"SO"<<endl;
        }
    }
    return 0;
}