Zerone·

题解

/ 注册

全部文章 / 题解（共111篇）

题解 | #矩阵转置#

">int main() { int n, m; scanf("%d %d", &n, &m); int val[m][n]; for (int i = 0; i < n; i++) { for (int j = 0; j <...

C

2022-05-25

2 396

题解 | #序列重组矩阵#

">int main() { int n, m; scanf("%d %d", &n, &m); int val[n * m]; for (int i = 0; i < n * m; i++) { scanf("%d ", &am...

C

2022-05-25

1 322

题解 | #KiKi判断上三角矩阵#

">int main() { int n; scanf("%d", &n); int m[n][n], val = 0, count = 0; for (int i = n - 1; i > 0; i--) { //计算主对角线下元素个数 ...

C

2022-05-25

1 361

题解 | #图像相似度#

">int main() { int n, m; scanf("%d %d", &n, &m); int val[2][n][m]; double count = 0.0; for (int i = 0; i < 2; i++) { ...

C

2022-05-25

1 308

题解 | #回型矩阵#

">int main() { int n; scanf("%d", &n); int val[n][n], count = 1; int x = 0, y = n - 1; while (count != n * n + 1) { fo...

C

2022-05-25

1 433

题解 | #矩阵计算#

">int main() { int n, m; scanf("%d %d", &n, &m); int val[n][m], sum = 0; for (int i = 0; i < n; i++) { for (int j =...

C

2022-05-25

1 395

题解 | #矩阵相等判定#

">int main() { int n, m; scanf("%d %d", &n, &m); int val[2][n][m], count = 0; for (int i = 0; i < 2; i++) { for (in...

C

2022-05-25

1 380

题解 | #最高身高#

">int main() { int n, m; scanf("%d %d", &n, &m); int val[n][m], max = 0 ; for (int i = 0; i < n; i++) { for (int j ...

C

2022-05-25

1 432

题解 | #矩阵元素定位#

">int main() { int n, m; scanf("%d %d", &n, &m); int val[n + 1][m + 1]; for (int i = 1; i <= n; i++) { for (int j =...

C

2022-05-25

2 532

题解 | #班级成绩输入输出#

">int main() { double val[5][5], sum = 0; for (int i = 0; i < 5; i++) { for (int j = 0; j < 5; j++) { scanf("%lf ", ...

C

2022-05-25

2 346