Module: STL algorithms


Problem

1/6

Cyclic shift with rotate

Problem

Cycle through the elements of the array by the desired number of elements.
 
Use as few assignments as possible.
 
Input
Enter a list of numbers. All numbers in the list are on the same line.
 
Output
First given number N — the number of elements in the array and the number of positions to shift K (1<=N<=100, -1000<=K<=1000). Further, through the space, N numbers are written — array elements. The array consists of integers.

Enter Output
5 2
12  3 4 5
3 4 5 1 2
5 1000
1 2 3 4 5 		1 2 3 4 5
5-2
1 2 3 4 5
4 5 1 2 3

time 1000 ms
memory 256 Mb
Rules for program design and list of errors in automatic problem checking

Teacher commentary

Insert the missing code snippets
C++
Write the program below 
#include <iostream>
#include <vector>
#include <algorithm>  
using namespace std;
int main()
{
	int N,K;
	vector<int> myvector;

	cin >> N>>K;
	for (int i = 0; i < N; i++)
	{
		int b;
		cin >> b;
		myvector.push_back(b);
	}
	if(K>0)
           rotate(  
else
             rotate(  
    for (auto now : myvector) {
	     	cout << now << " ";
   }}

     

Program check result

To check the solution of the problem, you need to register or log in!