#include <iostream>
using namespace std;
int main(){
	int n,m[1000];
	cin>>n;
	int a=1;
	for(int i=0;i<=n-1;i++){
        cin>>m[i];
	}
	for(int i=0;i<=n-1;i++){
        cout<<m[i]<<' ';
	}
	cout<<endl;
	while (a<=n-1){
        cout <<m[a]<<' ';
        a++;
	}
	cout<<m[0];
	return 0;
}

c++

python的哦~

x=input()

y=input().split()

yy=[]

for i in y:

    yy.append(i)


a=y[0]


yy.pop(0)

yy.append(a)

for i in y:

    print(i,end=" ")

print()    

for i in yy:

    print(i,end=" ")

一道队列的模板题

#include <bits/stdc++.h>
using namespace std;

queue<int> q;

void print()
{
	for(auto x:q) cout << x << " ";
}

int main()
{
	int n;
	while(n--)
	{
		int x;
		cin >> x;
		q.push(x);
	}
	print();
	int t = q.front();
	q.pop();
	q.push(t);
	print();
	return 0;
}

using namespace std;
int m[101];
int main(){
	int a,b;
	cin>>a;
	for(int i=0;i<=a-1;i++){
		cin>>m[i];
	}
	for(int o=0;o<=a-1;o++){
		cout<<m[o]<<" ";
	}
	cout<<endl;
	for(int l=1;l<=a-1;l++){
		cout<<m[l]<<" ";
	}
	cout<<m[0];
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
int main()
{
	int n,m[101],d=0;
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		cin>>m[i];
		d++;
	}
	for(int i=1;i<=n;i++)
	{
		cout<<m[i]<<" ";
	}
	cout<<endl;
	for(int i=1;i<=n;i++)
	{
		if(i!=n)cout<<m[i+1]<<" ";
		else cout<<m[1];
	}
    return 0;
}