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

  • wildmud + 2 comments
    #include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */ 
    int n,k,q,i,s=0,e=0, t=0,b;
    cin>>n>>k>>q;
    int a[n];
    for(i=0;i<n;i++)
    {
        cin>>a[i];
        
    }
    
    k=k%n;
    
    s=0,e=n-k-1;
    while(s<e)
    {
       t=a[s];
        a[s]=a[e];
        a[e]=t;
        s++;e--;
        
    }
  
     s=n-k,e=n-1;
    while(s<e)
    {
       t=a[s];
        a[s]=a[e];
        a[e]=t;
        s++;e--;
        
    }
    
     s=0,e=n-1;
    while(s<e)
    {
       t=a[s];
        a[s]=a[e];
        a[e]=t;
        s++;e--;
        
    }
    
     for(i=0;i<q;i++)
    {
        cin>>b;
         cout<<a[b]<<endl;
        
    }
    
    
    
    
    return 0;
}
    • rvrishav7 + 0 comments
      faster than urs i guess.. happy coding
#include<bits/stdc++.h>

using namespace std;


int main() {
   long long int k,n,q;
    cin>>n>>k>>q;
    k=k%n;
   long long int i,ar[n],x,s=0;
    for(i=0;i<n;i++)
        cin>>ar[i];
    for(i=1;i<=q;i++)
    {
          cin>>x;
     s=n-k+x;
     if(s<n)
         cout<<ar[s]<<endl;
     else if(s>=n)
     { s=s-n;
         cout<<ar[s]<<endl;
    }}

    return 0;
}
    • aiswarya110498 + 0 comments

      Thank you very much..passed all test cases.