**Circular Array Rotation**

### Problem Statement :

John Watson knows of an operation called a right circular rotation on an array of integers. One rotation operation moves the last array element to the first position and shifts all remaining elements right one. To test Sherlock's abilities, Watson provides Sherlock with an array of integers. Sherlock is to perform the rotation operation a number of times then determine the value of the element at a given position. For each array, perform a number of right circular rotations and return the values of the elements at the given indices. Example a = [3, 4, 5] k = 2 queries = [1, 2] Here k is the number of rotations on a, and queries holds the list of indices to report. First we perform the two rotations: [3, 4, 5] ---> [5, 3, 4] -----> [4, 5, 3] Now return the values from the zero-based indices 1 and 2 as indicated in the queries array. a[1] = 5 a[2] = 3 Function Description Complete the circularArrayRotation function in the editor below. circularArrayRotation has the following parameter(s): int a[n]: the array to rotate int k: the rotation count int queries[1]: the indices to report Returns int[q]: the values in the rotated a as requested in m Input Format The first line contains 3 space-separated integers, n, k, and q, the number of elements in the integer array, the rotation count and the number of queries. The second line contains n space-separated integers, where each integer i describes array element a[i] (where 0 <= i < n ). Each of the q subsequent lines contains a single integer, queries[i], an index of an element in a to return. Constraints 1 <= n <= 10^5 1 <= a[i] <= 10^5 1 <= k <= 10^5 1 <= q <= 500 1 <= queries[i] <n

### Solution :

` ````
Solution in C :
python 3 :
import sys
if __name__ == '__main__':
N, K, Q = list(map(int, sys.stdin.readline().split()))
A = list(map(int, sys.stdin.readline().split()))
for _ in range(Q):
x = int(sys.stdin.readline())
print(A[(x - K) % N])
Java :
import java.util.LinkedList;
import java.util.Scanner;
public class Solution
{
public static void main(String[] args)
{
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int k = in.nextInt();
int q = in.nextInt();
LinkedList<Integer> list = new LinkedList<Integer>();
int index;
for(int i = 0; i < n; i++)
{
list.add(in.nextInt());
}
while(k > 0)
{
int j = list.removeLast();
list.push(j);
k--;
}
while(q > 0)
{
index = in.nextInt();
System.out.println(list.get(index));
q--;
}
in.close();
}
}
C ++ :
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int n, k, q;
scanf("%d", &n);
scanf("%d", &k);
scanf("%d", &q);
int data[n];
for(int i=0; i<n; i++) scanf("%d", &data[i]);
k = k % n;
while(q--) {
int x;
scanf("%d", &x);
x = x - k;
if(x < 0) x = x + n;
printf("%d\n", data[x]);
}
return 0;
}
C :
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
int main() {
long n,k,q,i;
long a[100000];
scanf("%ld%ld%ld",&n,&k,&q);
long r=k%n;
for(i=r;i<n;i++)
scanf("%ld",&a[i]);
for(i=0;i<r;i++)
scanf("%ld",&a[i]);
for(i=0;i<q;i++)
{
scanf("%ld",&k);
printf("%ld\n",a[k]);
}
/* Enter your code here. Read input from STDIN. Print output to STDOUT */
return 0;
}
```

## View More Similar Problems

## Self-Driving Bus

Treeland is a country with n cities and n - 1 roads. There is exactly one path between any two cities. The ruler of Treeland wants to implement a self-driving bus system and asks tree-loving Alex to plan the bus routes. Alex decides that each route must contain a subset of connected cities; a subset of cities is connected if the following two conditions are true: There is a path between ever

View Solution →## Unique Colors

You are given an unrooted tree of n nodes numbered from 1 to n . Each node i has a color, ci. Let d( i , j ) be the number of different colors in the path between node i and node j. For each node i, calculate the value of sum, defined as follows: Your task is to print the value of sumi for each node 1 <= i <= n. Input Format The first line contains a single integer, n, denoti

View Solution →## Fibonacci Numbers Tree

Shashank loves trees and math. He has a rooted tree, T , consisting of N nodes uniquely labeled with integers in the inclusive range [1 , N ]. The node labeled as 1 is the root node of tree , and each node in is associated with some positive integer value (all values are initially ). Let's define Fk as the Kth Fibonacci number. Shashank wants to perform 22 types of operations over his tree, T

View Solution →## Pair Sums

Given an array, we define its value to be the value obtained by following these instructions: Write down all pairs of numbers from this array. Compute the product of each pair. Find the sum of all the products. For example, for a given array, for a given array [7,2 ,-1 ,2 ] Note that ( 7 , 2 ) is listed twice, one for each occurrence of 2. Given an array of integers, find the largest v

View Solution →## Lazy White Falcon

White Falcon just solved the data structure problem below using heavy-light decomposition. Can you help her find a new solution that doesn't require implementing any fancy techniques? There are 2 types of query operations that can be performed on a tree: 1 u x: Assign x as the value of node u. 2 u v: Print the sum of the node values in the unique path from node u to node v. Given a tree wi

View Solution →## Ticket to Ride

Simon received the board game Ticket to Ride as a birthday present. After playing it with his friends, he decides to come up with a strategy for the game. There are n cities on the map and n - 1 road plans. Each road plan consists of the following: Two cities which can be directly connected by a road. The length of the proposed road. The entire road plan is designed in such a way that if o

View Solution →