Monk and Rotation - HackerEarth Solution

Monk and Rotation - HackerEarth Solution

Monk loves to preform different operations on arrays, and so being the principal of Hackerearth School, he assigned a task to his new student Mishki. Mishki will be provided with an integer array A of size N and an integer K , where she needs to rotate the array in the right direction by K steps and then print the resultant array. As she is new to the school, please help her to complete the task.

Input:
The first line will consists of one integer T denoting the number of test cases.
For each test case:
1) The first line consists of two integers N and K, N being the number of elements in the array and K denotes the number of steps of rotation.
2) The next line consists of N space separated integers , denoting the elements of the array A.

Output:
Print the required array.

Constraints:
$1\le T\le 20$
$1\le N\le {10}^5$
$0\le K\le {10}^6$
$0\le A[i]\le {10}^6$

SAMPLE INPUT

 

1
5 2
1 2 3 4 5

SAMPLE OUTPUT

 

4 5 1 2 3

Explanation

Here T is 1, which means one test case.
$N=5$ denoting the number of elements in the array and $K=2$, denoting the number of steps of rotations.
The initial array is: $1,2,3,4,5$
In first rotation, 5 will come in the first position and all other elements will move to one position ahead from their current position. Now, the resultant array will be $5,1,2,3,4$
In second rotation, 4 will come in the first position and all other elements will move to one position ahead from their current position. Now, the resultant array will be $4,5,1,2,3$

Monk and Rotation - HackerEarth Solution

Code:

#include<iostream>
using namespace std;
int main()
{    int t;    
     cin>>t;
     while(t--)    
     {        
          int n,k,p;        
          cin>>n;        
          int a[n];
          cin>>k;
          for(int i=0;i<n;i++)
          {
              cin>>a[i];        
          }        
          k%=n;
          for(int i=0;i<n;i++)
          {
               p = a[(i+(n-k))%n];
               cout<<p<<" ";
          } cout<<"\n";
      }
return 0;
}

Monk and Rotation - HackerEarth Solution

All rights reserved. No part of this Post may be copied, distributed, or transmitted in any form or by any means, without the prior written permission of the website admin, except in the case of brief quotations embodied in critical reviews and certain other noncommercial uses permitted by copyright law. For permission requests, write to the owner, addressed “Attention: Permissions Coordinator,” to the coderinme.net@gmail.com.

Disclaimer: The above Problem is generated by HackerEarth but the Solution is Provided by Us. This tutorial is only for Educational and Learning purposes. Authority if any of the queries regarding this post or website contact us on coderinme.net@gmail.com .

For DMCA: https://allhackerranksolutionsbykaira.blogspot.com/p/dmca.html