Light OJ -- 1212(Double Ended Queue)

To learn dequeue:
In bangla:http://www.shafaetsplanet.com/?p=2316
Learn function:https://www.cplusplus.com/reference/deque/deque/

///Bismillahir Rahmanir Rahim

///Author:Tanvir Ahmmad

///CSE,Islamic University,Bangladesh

#include<iostream>

#include<cstdio>

#include<algorithm>

#include<string>

#include<cstring>

#include<sstream>

#include<cmath>

#include<cstring>

#include<vector>

#include<queue>

#include<map>

#include<set>

#include<stack>

#include<vector>

#include<iterator>

#include <functional> ///sort(arr,arr+n,greater<int>()) for decrement of array

/*every external angle sum=360 degree

  angle find using polygon hand(n) ((n-2)*180)/n*/

///Floor[Log(b)  N] + 1 = the number of digits when any number is represented in base b

using namespace std;

typedef long long ll;

int main()

{

    int tst,sz,step,num,ca=1;

    scanf("%d",&tst);

    while(tst--)

    {

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

        deque<int>dq;

        scanf("%d%d",&sz,&step);

        while(step--)

        {

            string str;

            cin>>str;

            if(str=="pushLeft")

            {

                cin>>num;

                if(dq.size()<sz) dq.push_front(num),printf("Pushed in left: %d\n",num);

                else printf("The queue is full\n");

            }

            else if(str=="pushRight")

            {

                cin>>num;

                if(dq.size()<sz) dq.push_back(num),printf("Pushed in right: %d\n",num);

                else printf("The queue is full\n");

            }

            else if(str=="popLeft")

            {

                if(dq.size()>=1) printf("Popped from left: %d\n",dq.front()),dq.pop_front();

                else printf("The queue is empty\n");

            }

            else if(str=="popRight")

            {

                if(dq.size()>=1) printf("Popped from right: %d\n",dq.back()),dq.pop_back();

                else printf("The queue is empty\n");

            }

        }

    }

    return 0;

}

///Alhamdulillah 

Problem Link:https://lightoj.com/problem/double-ended-queue