LeftRotation.cpp

#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <unordered_map>

using namespace std;

vector<int> array_left_rotation(vector<int> a, int n, int k) {
    int rotation = k % n;
    vector<int> copyV(n);
    int sizeV = a.size();
    if (rotation == 0){
            return a;
        }
    
    for (unsigned i = 0; i < sizeV; i++){
        if (rotation > i ){
            int pos = sizeV - (rotation-i);
            copyV.at(pos) = a.at(i);
        }
        if( rotation <= i){
            int pos = i - rotation;
            copyV.at(pos) = a.at(i);
        }
    }
    return copyV;
    
}

int main(){
    int n;
    int k;
    cin >> n >> k;
    vector<int> a(n);
    for(int a_i = 0;a_i < n;a_i++){
        cin >> a[a_i];
    }
    vector<int> output = array_left_rotation(a, n, k);
    for(int i = 0; i < n;i++)
        cout << output[i] << " ";
    cout << endl;
    return 0;
}