rotate(int* arr, int n, int k)
{
	k %= n;
	int i = 0;
	for (i = 0; i < k; i++)//旋轉(zhuǎn)k次
	{
		int tmp = arr[n - 1];//把最后一個數(shù)拿出來賦給tmp
		//剩余元素整體向后移動
		int j = 0;
		for (j = n - 1; j > 0; j--)
		{
			arr[j] = arr[j - 1];
		}
		arr[0] = tmp;//把最后一個值賦給數(shù)組的首元素處
	}
	int a = 0;
	for (a = 0; a < n; a++)
	{
		printf("%d", arr[a]);
	}
}
int main()
{
	int arr[10] = { 0,1,2,3,4,5,6,7,8,9 };
	int n = sizeof(arr) / sizeof(arr[0]);
	int k = 0;
	scanf("%d", &k);
	rotate(arr, n, k);
	return 0;
}

void rotate(int* nums, int numsSize, int k) 
{
	int* tmp = (int*)malloc(sizeof(int) * numsSize);//開辟大小為n的動態(tài)內(nèi)存
	k = k % numsSize;
	memcpy(tmp, nums + numsSize - k, sizeof(int) * k);//把旋轉(zhuǎn)的數(shù)拷貝到新數(shù)組中
	memcpy(tmp+k, nums, sizeof(int) * (numsSize-k));//剩下的數(shù)拷貝到新數(shù)組的后面
	memcpy( nums,tmp,  sizeof(int) * numsSize);//把新數(shù)組拷貝給原來的數(shù)組
	free(tmp);
}

void reve(int arr[], int left, int right)//逆置函數(shù)，三個逆置都適用
{
	while (left < right)
	{
		int tmp = arr[left];
		arr[left] = arr[right];
		arr[right] = tmp;
		left++;
		right--;
	}
}
rotate(int* arr, int n, int k)
{
	k %= n;
	reve(arr, n - k, n - 1);//逆置后面的數(shù)
	reve(arr, 0, n - k - 1);//逆置前面的數(shù)
	reve(arr, 0, n - 1);//整體逆置
	int i = 0;
	for (i = 0; i < n; i++)
	{
		printf("%d ", arr[i]);
	}
}
int main()
{
	int arr[10] = { 0,1,2,3,4,5,6,7,8,9 };
	int n = sizeof(arr) / sizeof(arr[0]);
	int k = 0;
	scanf("%d", &k);
	rotate(arr, n, k);
	return 0;
}