Zerone·

分类

题解(113)

/ 注册

全部文章（共115篇）

题解 | #井字棋#

">int output(int val) { //判断是否有三连棋 if (val / 3 == 'K') { printf("KiKi wins!"); val = 1; //有则返回1，代表已打印结果 } else if (val / 3 =...

C

2022-05-26

2 375

题解 | #杨辉三角#

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

C

2022-05-25

1 310

题解 | #矩阵交换#

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

C

2022-05-25

1 0

题解 | #矩阵转置#

">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 441

题解 | #矩阵计算#

">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