Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #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) {
- vector<int> buffer(k);
- for (int i=0;i<k;i++) {
- buffer[i]=a[i];
- }
- for (int i=0;i<n-k;i++) {
- a[i]=a[i+k];
- }
- for (int i=0;i<k;i++) {
- a[i+n-k]=buffer[i];
- }
- return a;
- }
- 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;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement