Hackerrank-Leetcode/CircularArrayRotation.cpp at master · skanda99/Hackerrank-Leetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31

// problem: "https://www.hackerrank.com/challenges/circular-array-rotation/problem"

#include <iostream>

using namespace std;

int main()
{
    unsigned long int a[1000000],k,n,m[5000];
    unsigned long int q,K;

    cin>>n>>k>>q;
    K=k%n;

    for(k=0;k<n;k++)
        cin>>a[k];

    for(k=0;k<q;k++)
        cin>>m[k];

    for(k=0;k<q;k++)
    {
        if(m[k]>=K)
            cout<<a[m[k]-K]<<endl;
        else
            cout<<a[m[k]-K+n]<<endl;
    }

    return 0;
}