饥饿的大魔王

分类

/ 注册

全部文章（共31篇）

题解 | #数位五五#

#include <stdio.h> #include <string.h> void Num(int a, int b) { int c = 0; int sum = 0; int count = 0; for (int i = a; i <= b; i++...

2023-06-09

0 318

题解 | #[NOIP2008]笨小猴#

#include <stdio.h> #include <string.h> int main() { char arr[100]; scanf("%s", &arr); int max, s, a; int min = 100; int count = 0; ...

2023-06-03

0 235

题解 | #扫雷#

#include <stdio.h> int main() { int count = 0; int n, m; scanf("%d%d", &n, &m); //吃掉回车 getchar(); char arr[1000][1000]; for (int i = 0; i...

2023-05-27

3 353

题解 | #扫雷#

#include <stdio.h> int main() { int count = 0; int n, m; scanf("%d%d", &n, &m); //吃掉回车 getchar(); char arr[1000][1000]; for (int i = 0; i...

2023-05-27

0 277

题解 | #井字棋#

#include <stdio.h> int main() { char arr[100][100] = { 'O'}; for (int i = 0; i < 3; i++) { for (int j = 0; j < 3; j++) { scanf(...

2023-05-26

1 217

题解 | #杨辉三角#

#include <stdio.h> int main() { //定义二维数组 int arr[100][100] = { 0 }; //输入行数 int n = 0; scanf("%d", &n); for (int i = 0; i < n; i++) { ...

2023-05-26

1 301

题解 | #矩阵交换#

#include <stdio.h> /* n , m 代表行和列 k 代表执行几次操作 t = 'r' 进行行变换 t = 'c' 进行列变换 */ int main() { int tmp = 0; int k = 0; char t; int a, b; int n...

2023-05-23

1 310

题解 | #矩阵交换#

#include <stdio.h> /* n , m 代表行和列 k 代表执行几次操作 t = 'r' 进行行变换 t = 'c' 进行列变换 */ int main() { int tmp = 0; int k = 0; char t; int a, b; int n...

2023-05-23

2 300

题解 | #矩阵转置#

#include <stdio.h> int main() { int n, m; scanf("%d%d", &n, &m); int arr[100][100] = { 0 }; for (int i = 0; i < n; i++) { for (int ...

2023-05-23

1 273

题解 | #序列重组矩阵#

#include <stdio.h> int main() { int arr[100][100] = { 0 }; int n,m; scanf("%d%d", &n, &m); for (int i = 0; i < n; i++) { for (int j =...

2023-05-23

1 209