Circular Array Rotation

                            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;
}