PAT 乙级-1008

方法一：

#include<iostream>
using namespace std;

int main() {
	int n, m, flag = 0, num[100] = { 0 };
	cin >> n >> m;
	if (m >= n) m %= n;
	for (int i = 0; i < n; i++) cin >> num[i];
	for (int j = n - m; j < n; j++) {
		if (flag) cout << " ";
		cout << num[j];
		flag = 1;
	}
	for (int i = 0; i < n - m; i++) {
		if (flag) cout << " ";
		cout << num[i];
		flag = 1;
	}
	return 0;
}

方法二：(来自柳神)

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;

int main() {
	int n, m, flag = 0;
	cin >> n >> m;
	vector<int> num(n);
	if (m >= n) m %= n;
	for (int i = 0; i < n; i++) cin >> num[i];
	reverse(num.begin(), num.begin() + n - m);
	reverse(num.begin() + n-m, num.begin() + n);
	reverse(num.begin(), num.end());
	for (int i = 0;i < n - 1;i++) 
		cout << num[i] << " " ;
    cout << num[n-1];
	return 0;
}