Problem Name : Division of Nlogonia
Problem Link : See Problem : Uva – 11498
Solution :
#include<iostream> #include<cstdio> using namespace std; int main() { int k,n,m,x,y; while(1){ cin>>k; if(k==0) break; cin>>n>>m; while(k--) { 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<<"NO"<<endl; else if(x>n&&y<m) cout<<"SE"<<endl; else cout<<"SO"<<endl; } } return 0; }
Advertisements