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.
  • Practice
  • Certification
  • Compete
  • Career Fair
  • Hiring developers?
  1. Practice
  2. Algorithms
  3. Implementation
  4. Circular Array Rotation
  5. Discussions

Circular Array Rotation

Problem
Submissions
Leaderboard
Discussions
Editorial

    You are viewing a single comment's thread. Return to all comments →

  • rvrishav7 3 years ago+ 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;
    }
    
    18|
    ParentPermalink
  • Contest Calendar
  • Blog
  • Scoring
  • Environment
  • FAQ
  • About Us
  • Support
  • Careers
  • Terms Of Service
  • Privacy Policy
  • Request a Feature