题目链接
解题思路
《数学之美》
把前后两端分别反转,之后再整体反转一遍即可!
/**********************************
*@ID: 3stone
*@ACM: PAT.B1008 数组循环右移
*@Time: 17/2/27
*@IDE: DEV C++ 5.10
***********************************/
#include<cstdio>
#include<algorithm>
using namespace std;
int main() {
int n, m, A[101];
scanf("%d %d", &n, &m);
for (int i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
m = n - (m % n);
for (int i = 0, j = m - 1; i < j; i++, j--) swap(A[i], A[j]);
for (int i = m, j = n - 1; i < j; i++, j--) swap(A[i], A[j]);
for (int i = 0, j = n - 1; i < j; i++, j--) swap(A[i], A[j]);
for (int i = 0; i < n - 1; i++) printf("%d ", A[i]);
printf("%d\n", A[n - 1]);
system("pause");
return 0;
}