Friday 28 November 2014

UVa 11498 - Division of Nlogonia Solution

///     Raihan Ruhin
///     CSE, Jahangirnagar University.
///     Dhaka-Bangladesh.
///     id: raihanruhin (topcoder / codeforces / codechef / hackerrank / uva / uvalive, spoj), 3235 (lightoj)
///     mail: raihanruhin@ (yahoo / gmail / facebook)
///     blog: ruhinraihan.blogspot.com

#include<bits/stdc++.h>
using namespace std;

#define SET(a) memset(a,-1,sizeof(a))
#define CLR(a) memset(a,0,sizeof(a))
#define PI acos(-1.0)

#define MOD 1000000007
#define MX 100010


int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);
    int n, tc, x, xx, y, yy;
    string s;

    while(cin>>n && n)
    {
        cin>>x>>y;
        for(int i=0;i<n;i++)
        {
            cin>>xx>>yy;
            //xx-=x;
            //yy-=y;
            if(xx==x || yy==y) cout<<"divisa\n";
            else if(xx>x && yy>y) cout<<"NE\n";
            else if(xx<x && yy>y) cout<<"NO\n";
            else if(xx>x && yy<y) cout<<"SE\n";
            else cout<<"SO\n";

        }
    }
return 0;
}

No comments:

Post a Comment