UVa 11498 - Division of Nlogonia || UVA 11498 - Division of Nlogonia Solution in C C++ CPP
Problem name: 11498 - Division of Nlogonia
Judge: UVa Online Judge
Problem link: 11498 - Division of Nlogonia
UVa Online Judge 11498 - Division of Nlogonia Solution in C C++ CPP
#include <iostream>
using namespace std;
int main()
{
while (true)
{
int k, m, n;
cin >> k;
if (k == 0)
{
break;
}
else
{
cin >> n >> m;
for (int i = 0; i < k; i++)
{
int x, y;
cin >> x >> y;
if (x - n > 0 && y - m > 0)
{
cout << "NE" << endl;
}
else if (x - n > 0 && y - m < 0)
{
cout << "SE" << endl;
}
else if (x - n < 0 && y - m > 0)
{
cout << "NO" << endl;
}
else if (x - n < 0 && y - m < 0)
{
cout << "SO" << endl;
}
else
{
cout << "divisa" << endl;
}
}
}
}
return 0;
}
Tags: uva 11498 solution in c++, 11498 solution, uva 11498 solution in c c++
cpp java python javascript c# php, Division of Nlogonia uva solution,
uva, uva online judge, coding, programming, solutions, online judge solutions
