C :

#include<stdio.h>
int main(){
	int n,i,x;
	scanf("%d",&n);
	int a[n];
	for(i=0;i<n;i++){
		scanf("%d",&a[i]);
	}
	scanf("%d",&x);
	for(i=x;i<=n-1;i++){
		int t = a[i-1];
		a[i-1] = a[i];
		a[i] = t;
	}
	for(i=0;i<n;i++){
		printf("%d ",a[i]);
	}
	
	return 0;
}

C++ :

#include <iostream>
#include <iomanip>
#include <cmath>
 
using namespace std;
 
int main(){
    int a[100],n,x,y;
    cin>>n;
    for(int i=0;i<n;i++){
    	cin>>a[i];
	}
	cin>>x;
	for(int i=0;i<n;i++){
		if(i+1!=x){
			cout<<a[i]<<" ";
		}else{
		    y=a[i];	
		}
	}cout<<y<<endl;
}

Python :

n=int(input())
l1=list(map(int,input().split()))
x=int(input())
t=l1[x-1]  #先把第X个位置的数保存起来
l1.remove(l1[x-1])
l1.append(t)
for i in l1:
    print(i,end=' ')