Circular right shift of array elements in C language

---

Algorithm design ideas

1. set up n Number , To the right m position
2. take n-m Number stored in n after （ Be careful m It may be less than n）
3. Print m-n To n+n-m Location information is enough

---

Code

#include <stdio.h>

int main(){
    
    int n, m, x;
    int a[100];
    scanf("%d", &n);
    scanf("%d", &m);
    if(m>n){
    
        m = m % n;
    }
    for(int i=0; i<n; i++){
    
        scanf("%d", &x);
        a[i] = x;
    }
    for(int i=n; i<2*n-m; i++){
    
        a[i] = a[i-n];
    }
    for(int i=n-m; i<2*n-m; i++){
    
        if(i==2*n-m-1){
    
            printf("%d", a[i]);
        }else{
    
            printf("%d ", a[i]);
        }
    }
    return 0;
}

---

Running results