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.
Loading...
  1. Practice
  2. Algorithms
  3. Implementation
  4. Circular Array Rotation
  5. Discussions

Circular Array Rotation

  • ZEUS_DEVELOPER + 1 comment
    n,k,q=raw_input().split()
n,k,q=[int(n),int(k),int(q)]
s=raw_input()
s=map(int,s.split())
while(q!=0):
    m=input()
    print s[(m-k)%n]
    q=q-1

    bitch plz python rules

    • morettocarlo + 1 comment

      I really like this one Zeus! I tried to make it more compact: 

      n, k, q =   map(int, input().strip().split())
a       =   [int(i) for i in input().strip().split(' ')]
for i in range(q):
    m   =   int(input())    
    print(a[(m-k)%n])
      • beckwithdylan + 0 comments

        and if you wanted to make it really compact..

        n,k,q = list(map(int, input().split()))
a = list(map(int, input().split()))
print(*(a[(int(input())-k)%n] for _ in range(q)),sep='\n')