自测题III——数组元素循环右移问题 (20)

无需数组真正的排序，直接输出即可。

#include <iostream>
using namespace std;

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