We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
int n;
int k;
int q;
cin >> n >> k >> q;
int a[n];
for (int i=0;i<n;i++) cin >> a[i];
int dest=k%n;
int b[n];
for (int i=0;i<n;i++) {
b[dest++]=a[i];
if (dest==n) dest=0;
}
for (int i=0;i<q;i++) {
int m;
cin >> m;
cout << b[m] << endl;
}
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Circular Array Rotation
You are viewing a single comment's thread. Return to all comments →