10 Wrong Answer
# | 状态 分数 | 耗时 | 内存占用 |
---|---|---|---|
#1 | Wrong Answer 0 | 3ms | 536 KiB |
#2 | Wrong Answer 0 | 3ms | 536 KiB |
#3 | Wrong Answer 0 | 3ms | 764 KiB |
#4 | Wrong Answer 0 | 3ms | 764 KiB |
#5 | Wrong Answer 0 | 3ms | 540 KiB |
#6 | Wrong Answer 0 | 3ms | 536 KiB |
#7 | Wrong Answer 0 | 3ms | 536 KiB |
#8 | Wrong Answer 0 | 3ms | 764 KiB |
#9 | Wrong Answer 0 | 3ms | 324 KiB |
#10 | Accepted 10 | 3ms | 320 KiB |
代码
#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string>
#include<cmath>
#include<cstdio>
#include<cstring>
#include <iomanip>
using namespace std;
int main() {
int n = 0, x = 1;
int a[20][20];
cin >> n;
a[1][1] = 1;
for (int i = 1; i <= n; i++) {//先右后左
for (int j = 1; j <= i; j++) {//左
a[j][i] = x;//[1][n]到[n][n]
x += 1;
}
for (int k = i - 1; k >= 1; k--) {//右
a[i][k] = x;//[n][n]到[n][1]
x += 1;
}
}
for (int i = n; i >= 1; i--) {
for (int j = 1; j <= n; j++) {
cout << setw(4) << a[j][i] << " ";
}
cout << endl;
}
return 0;
}
信息
- 递交者
- 题目
- P369 练63.3 迂回方阵
- 语言
- C++17(O2)
- 代码长度
- 621 Bytes
- 递交时间
- 2024-12-27 18:40:27
- 评测时间
- 2024-12-27 18:40:30
- 分数
- 10
- 总耗时
- 29ms
- 峰值时间
- 3ms
- 峰值内存
- 764 KiB