解题代码

#include<cstdio>
int gcd(int a, int b) {return !b ? a : gcd(b, a%b);
}
int main() {int n, m, a[100], temp, pos, next;scanf("%d%d", &n, &m);m %= n;for (int i = 0; i < n; i++) scanf("%d", &a[i]);int d = gcd(n, m);if (m) {for (int i = n - m; i < n - m + d; i++) {temp = a[i];pos = i;do {next = (pos - m + n) % n;if (next != i) a[pos] = a[next];else a[pos] = temp;pos = next;} while (pos != i);}}for (int i = 0; i < n; i++) {if (i) printf(" ");printf("%d", a[i]);}return 0;
}

测试结果

问题整理

1.最大公约数与最小公倍数。