Pta: self test -3 array element cyclic right shift problem (20 points)

Implement... With queues , However, there are some differences between the first in first out (FIFO) mechanism and the array right shift mechanism , So we moved him to the left , Because the number of digits he moves is cyclic , So we can make a left shift n-m position , Then every move n Bit is equivalent to no movement , So for n Make a balance .

#include"stdio.h"
#include"math.h"
#include <cstdlib>
#include <iostream>
#include <queue>

using namespace std;



int main(){
    	
	
	queue<int> q;
	
	int n,step;
	int temp;
	scanf("%d%d",&n,&step);
	
	for(int i =0;i<n;i++){
    
		temp =0;
		scanf("%d",&temp);
		q.push(temp);
	}
	
	for (int i=0;i<abs(n-step%n)%n;i++){
    
		temp = q.front();
		q.pop();
		q.push(temp);
	}
	printf("%d",q.front());
	q.pop();
	for(int i=1;i<n;i++){
    
		printf(" %d",q.front());
		q.pop();
	}
	
	
}