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 →

  • rwan7727 4 years ago+ 0 comments
    int n;
    int k;
    int q;
    cin >> n >> k >> q;
    int a[n];
    for (int i=0;i<n;i++) cin >> a[i];
    
    int dest=k%n;
    int b[n];
    for (int i=0;i<n;i++) {
        b[dest++]=a[i];
        if (dest==n) dest=0;
    }
    
    for (int i=0;i<q;i++) {
        int m;
        cin >> m;
        cout << b[m] << endl;
    }
    
    17|
    ParentPermalink
  • Contest Calendar
  • Blog
  • Scoring
  • Environment
  • FAQ
  • About Us
  • Support
  • Careers
  • Terms Of Service
  • Privacy Policy
  • Request a Feature