代码实现:
#include <iostream>
#include <algorithm>
using namespace std;
const int N = 110;
int n, m, q[N];
int main()
{
cin >> n >> m;
m %= n; // 要是m>n的话,先%n
for (int i = 0; i < n; i++)
cin >> q[i];
reverse(q, q + n);
reverse(q, q + m);
reverse(q + m, q + n);
for (int i = 0; i < n; i++)
{
if (i) cout << " ";
cout << q[i];
}
return 0;
}