按我的写,保你拿到时空双修者 名额限一位
2026-09-15 21:49:24
发布于:广东
24阅读
0回复
0点赞
执行用时:2ms
内存消耗:1.39MB
击败了100.00%的用户
击败了100.00%的用户
#include <unistd.h>
static char inBuf[1 << 10];
static int inLen = 0, inPos = 0;
inline int readChar() {
if (inPos == inLen) {
inLen = read(0, inBuf, sizeof(inBuf));
inPos = 0;
if (inLen <= 0) return -1;
}
return inBuf[inPos++];
}
inline int readInt() {
int c = readChar();
while (c <= ' ') { if (c == -1) return -1; c = readChar(); }
int x = 0;
while (c > ' ') { x = x * 10 + (c - '0'); c = readChar(); }
return x;
}
static int a[305], b[305];
int main() {
int T = readInt();
while (T--) {
int n = readInt();
for (int i = 0; i < n; i++) a[i] = readInt();
int left = 0, right = n - 1;
for (int i = 0; i < n; i++) {
if (i % 2 == 0) b[i] = a[left++];
else b[i] = a[right--];
}
char out[4096];
int len = 0;
for (int i = 0; i < n; i++) {
int v = b[i];
if (v == 0) out[len++] = '0';
else {
char tmp[12]; int tl = 0;
while (v) { tmp[tl++] = '0' + v % 10; v /= 10; }
while (tl) out[len++] = tmp[--tl];
}
out[len++] = ' ';
}
out[len++] = '\n';
write(1, out, len);
}
return 0;
}
全部评论 1
已通过
100%
2026-09-15 21:47:00
2ms
1.39MB
C++
Liu这就是证据
2026-09-15 来自 广东
0





有帮助,赞一个