00-Self Test 3. Loop right shift problem for array elements

An array A contains N (n>0) integers, and each integer loop is shifted to the right by M (m>=0), and the data from a (A0 A1 ...) is not allowed to use a different array. AN-1) transform to (an-m ... AN-1 A0 A1 ... AN-M-1) (the last m-number loop moves to the first m-position). If you need to consider the number of times a program moves data, how do you design a moving method?

input Format: Each input contains a test case, line 1th input n (1<=n<=100), M (m>=0), and line 2nd enter n integers, separated by a space.

output format: the sequence of integers after the output loop is shifted to the right of the M-bit in a row, separated by a space, with no extra spaces at the end of the sequence.

Input Sample:

6 21 2 3 4 5 6

Sample output:

5 6 1 2 3 4

#include <iostream>using namespacestd;intMain () {inti; intN; intM; intarr[ -]; CIN>> N >>M;  for(i =0; i < N; i++) {cin>>Arr[i]; } M= M%N;  for(i = n-m; i < N; i++) {cout<< Arr[i] <<" "; }     for(i =0; I < n-m-1; i++) {cout<< Arr[i] <<" "; } cout<< Arr[n-m-1]; return 0;}

00-Self Test 3. Loop right shift problem for array elements