#include<iostream>#include<algorithm>#include<vector>usingnamespace std;intmain(){int n, m;
cin >> n >> m;
vector<int>a(n);for(int i =0; i < n; i++)
cin >> a[i];
m %= n;if(m !=0){reverse(begin(a),begin(a)+ n);reverse(begin(a),begin(a)+ m);reverse(begin(a)+ m,begin(a)+ n);}for(int i =0; i < n -1; i++)
cout << a[i]<<" ";
cout << a[n -1];return0;}
python解法
r =input().split()
N =int(r[0])
M =int(r[1])
l =list(input().split())print(' '.join(l[N-M:]+l[:N-M]))