Data structure exercise 00-Self Test 3. array element loop right shift problem (20)

An array A contains N (n>0) integers, and each integer loop is shifted to the right by the M (m>=0) position, and the data from a (a0a1 ...) is removed by the use of 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 () {intNum,m,last; CIN>>num>>m; int*a =New int[num];  for(intI=0; i<num;i++) {cin>>A[i]; }     for(intI=1; i<=m;i++) { last=a[num-1];  for(intj=0; j<num-1; j + +) {A[num-j-1]=a[num-j-2]; } a[0]=Last ; }     for(intI=0; i<num;i++){        if(i==num-1) {cout<<A[i]; }Else{cout<<a[i]<<" ";    }} Delete [] A; return 0;}

Data structure exercise 00-Self Test 3. array element loop right shift problem (20)