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

  • ashishgulati21 + 2 comments

    Same for me :/ someone please help

    int main() { int n,k,q,r=0; cin >>n>>k>>q;

    int b[n];
int m[q];
for (int i=0;i<n;i++)
   {
    cin >> b[i];
   }
for (int i=0;i<q;i++)
    {
     cin >> m[i];
    }
for (int i=0;i<k;i++)
    {
        r=b[n-1];
    for(int j=n-1;j>0;j--)
        {
          b[j]=b[j-1];
        }
        b[0]=r;
    }
 for(int i=0;i<q;i++)
   {
       cout << b[m[i]]<<endl;
   }
return 0;

    }

    • Dinesh1306 + 1 comment

      Check this

      • chikithapaleti99 + 0 comments
        int main() {
   long int n; 
   long  int k; 
    long  int q,i,t; 
    scanf("%li %li %li", &n, &k, &q);
    long int a [n];
    for (long int a_i = 0; a_i < n; a_i++) {
       scanf("%li",&a[a_i]);
    }
    long int *m = malloc(sizeof(long int) * q);
    for (long int m_i = 0; m_i < q; m_i++) {
       scanf("%li",&m[m_i]);
    }
   long int b[n];
    for(i=0;i<n;i++){
        t=i+k;
      t=t%n;
        b[t]=a[i];
        
    }
     for (long  int m_i = 0; m_i < q; m_i++) {
         printf("%ld\n",b[m[m_i]]);
     }
    return 0;
}
    • chikithapaleti99 + 0 comments
      [deleted]