题解 | #Zero-Transposition#
Zero-complexity Transposition
https://www.nowcoder.com/practice/c54775799f634c72b447ef31eb36e975
#include <stdio.h>
int main() {
int n;
while (scanf("%d", &n) != EOF) {
long long a[n];
for (int i = 0; i < n; i++) {
scanf("%lld", &a[i]);
}
for (int i = n - 1; i > 0; i--) {
printf("%lld ", a[i]);
}
printf("%lld\n", a[0]);
}
return 0;
}
查看8道真题和解析