LightOj 1007 How Cow Solution

Problem Link:  https://lightoj.com/problem/how-cow 

Solution in C++:

///La ilaha illellahu muhammadur rasulullah

///******Bismillahir-Rahmanir-Rahim******///

///Abul Hasnat  Tonmoy

///Department of CSE,23rd batch

///Islamic University,Bangladesh

#include <bits/stdc++.h>

using namespace std;

int main()

{

    long long  ts=1,n,t,x,y,i,x1,y1,x2,y2;

    cin>>t;

    while(t--)

    {

        cin>>x1>>y1>>x2>>y2>>n;

        printf("Case %d:\n",ts++);

        for(i=1; i<=n; i++)

        {

            cin>>x>>y;

            if(x>x1&&x<x2&&y>y1&&y<y2)

                cout<<"Yes"<<endl;

            else

                cout<<"No"<<endl;

        }

    }

}