gistfile1.txt

#include <algorithm>
#include <iostream>
#include <vector>

void rotate(std::vector<int> vect, int move, int n) {
    int move1;
    move = move % n;
    std::vector<int> sortVec(n);
    for (int ii = 0; ii < n; ii++) {
        if (ii + move >= n) {
            move1 = (ii + move) % n;
            sortVec[move1] = vect[ii];
        } else if (ii + move < 0) {
            move1 = n + (ii + move);
            sortVec[move1] = vect[ii];
        } else {
            move1 = ii + move;
            sortVec[move1] = vect[ii];
        }
    }
    if (move == 0) {
        for (auto i : vect) {
            std::cout << i << " ";
        }
    } else {
        for (auto i : sortVec) {
            std::cout << i << " ";
        }
    }
}

int main() {
    int n;
    std::cin >> n;
    if (n == 0) {
        std::cout << "";
    } else {
        std::vector<int> Vec;
        for (int i = 0; i < n; i++) {
            int figure;
            std::cin >> figure;
            Vec.push_back(figure);
        }
        int move;
        std::cin >> move;
        rotate(Vec, move, n);
    }
    system("pause");
    return 0;
}