在写代码的贝贝很幸福

分类

/ 注册

全部文章（共35篇）

题解 | #矩阵元素定位#

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

2024-11-24

1 8

题解 | #扫雷#

#include <stdio.h> #include <stdlib.h> int main() { int n = 0; int m = 0; scanf("%d %d", &n, &m); char a...

2024-11-24

1 9

题解 | #杨辉三角#

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

2024-11-24

1 11

题解 | #矩阵交换#

#include <stdio.h> #include <stdlib.h> int main() { int n, m; scanf("%d%d", &n, &m); int arr1[n][m]; for...

2024-11-24

1 9

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

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

2024-11-23

1 10

题解 | #蛇形矩阵#

#include <stdio.h> #include <stdlib.h> int main() { int N=1; int num=1; scanf("%d",&N); int arr[N][N]; for(int n=0;n<=N-1...

2024-11-23

1 10

题解 | #蛇形矩阵#

#include <stdio.h> #include <stdlib.h> int main() { int N=1; int num=1; scanf("%d",&N); int arr[N][N]; for(int n=0;n<=N-1...

2024-11-23

1 7

题解 | #回型矩阵#

#include<stdio.h> int main() { int N = 1; scanf("%d", &N); int arr[N][N]; arr[N / 2][N / 2] = N * N; int num =...

2024-11-23

1 7

题解 | #字符串操作#

#include <stdio.h> 借鉴了一种认为比较好的代码 int main() { int n, m, l, r; char s[1000] = {0}, c1, c2; scanf("%d %d\n%s", &n, &...

2024-11-08

1 13

题解 | #有序序列判断#

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

2024-11-08

1 12