#include <stdio.h> int main() { int a[100], b[100] = { 0 }, n, k = 0; scanf_s("%d", &n); for (int i = 1; i <= n; i++) scanf_s("%d", &a[i]); scanf_s("%d", &k); if (k > n)k %= n; for (int i = 1; i <= n; i++) { if (k > n - i) b[k - (n - i)]=a[i]; b[i+k] = a[i]; } for (int i = 1; i <= n; i++) printf("%d ", b[i]); }
0.0分
1 人评分
众数问题 (C语言代码)浏览:830 |
1908题解浏览:640 |
1025题解浏览:738 |
A+B for Input-Output Practice (VI) (C语言代码)浏览:558 |
C二级辅导-公约公倍 (C语言代码)浏览:483 |
C二级辅导-等差数列 (C语言代码)浏览:824 |
C语言程序设计教程(第三版)课后习题7.4 (C语言代码)浏览:450 |
1052题解(链表操作)浏览:674 |
杨辉三角 (C语言代码)浏览:679 |
C语言程序设计教程(第三版)课后习题9.6 (C语言代码)浏览:565 |