37 lines
841 B
C
37 lines
841 B
C
|
#include <stdio.h>
|
||
|
|
#include <stdlib.h>
|
||
|
|
|
||
|
|
void shift(int *array, int num, int size);
|
||
|
|
|
||
|
|
int main() {
|
||
|
|
int i, n, p, array[100];
|
||
|
|
|
||
|
|
scanf(" %d%d", &n, &p); //测试用例保证0<p<n<=100
|
||
|
|
for (i = 0; i < n; i++)
|
||
|
|
scanf("%d", &array[i]); //测试用例保证所有输入可以用整型存储
|
||
|
|
|
||
|
|
shift(array, p, n); //向左移p位
|
||
|
|
for (i = 0; i < n - 1; i++)
|
||
|
|
printf("%d ", array[i]);
|
||
|
|
printf("%d\n", array[i]);
|
||
|
|
|
||
|
|
return 0;
|
||
|
|
}
|
||
|
|
|
||
|
|
/* 请在这里填写答案 */
|
||
|
|
void shift(int *array, int num, int size) {
|
||
|
|
// Store data that will be overridden by shifting, starting from array[0]
|
||
|
|
int cache;
|
||
|
|
|
||
|
|
// Start shifting once a time.
|
||
|
|
for (int i = 0; i < num; i++) {
|
||
|
|
// Shift to the left.
|
||
|
|
cache = array[0];
|
||
|
|
for (int j = 0; j < size - 1; j++) {
|
||
|
|
array[j] = array[j + 1];
|
||
|
|
}
|
||
|
|
// Circular
|
||
|
|
array[size - 1] = cache;
|
||
|
|
}
|
||
|
|
}
|