Array Simulation LOJ-1133

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

#define flush        cin.ignore(numeric_limits<streamsize>::max(),'\n')
#define fasterio     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define NL           printf("\n")
#define pi           acos(-1.0) //3.1415926535897932384626
#define mx           7500000
#define dpoint(x)    fixed<<setprecision(x)
#define mod          1000000007
#define pb           push_back
#define scn(x)       scanf("%d",&x)
#define scnd(x)      scanf("%lf",&x)
#define sc(x)        scanf("%s",&x)

typedef long long int       ll;
typedef double              dl;
typedef unsigned long long  ul;


// --------------------------Pre made Functions & Proto Type--------------------------//
template <class T> T gcd(T a, T b){if(a == 0) return b;return gcd ( b%a, a );}
template <class T> T lcm(T a, T b){return ( ( a/gcd ( a, b ) )*b );}
template <class T> T digitsum(T n){T sum=0;while(n!=0){sum+=n%10;n/=10;}return sum;}
template <class T> T binaryToDec(T x){T ans=0, i=0, rem;while(x!=0){rem = x%10;x/=10;ans+=rem*pow(2,i);i++;}return ans;}


 //Code Status :ac ;name: ;
int main()
{
   #ifndef ONLINE_JUDGE
       freopen("input.txt","r",stdin);
       freopen("out.txt","w",stdout);
   #endif
     int t;
     scn(t);
     for(int i=1; i<=t; i++)
     {
        int n, op;
        vector<int>v;
        scn(n);scn(op);
        for(int j=0; j<n; j++)
        {
            int x;
            scn(x);
            v.push_back(x);
        }

        for(int a=1; a<=op; a++)
        {
            char ch;
            sc(ch);
            if(ch=='S')
            {
                int D;
                scn(D);
                for(int j=0; j<n; j++)
                {
                    v[j]=v[j]+D;
                }
            }
            else if(ch=='M')
            {
                int D;
                scn(D);
                for(int j=0; j<n; j++)
                {
                    v[j]=v[j]*D;
                }
            }
            else if(ch=='D')
            {
                int K;
                scn(K);
                for(int j=0; j<n; j++)
                {
                    v[j]=v[j]/K;
                }
            }
            else if(ch=='P')
            {
                int Y,Z;
                scn(Y);scn(Z);
                swap(v[Y],v[Z]);
            }
            else if(ch=='R')
                reverse(v.begin(), v.end());

        }
        printf("Case %d:\n",i);
        for(int j=0; j<n; j++)
        {
            if(j==0)printf("%d",v[0]);
            else printf(" %d",v[j]);
        }
        NL;
        v.clear();
     }
    return 0;
}
/// ----------------------------Funaction Descriptions----------------------------------//


//author anikaksh;