诗酒田园
诗酒田园
全部文章
分类
归档
标签
去牛客网
登录
/
注册
诗酒田园的博客
全部文章
(共41篇)
题解 | 矩阵交换
#include <stdio.h>int main(){ int n = 0; int m = 0; while (scanf("%d %d", &n, &m) == 2) { int arr[n][m]; ...
2026-02-03
0
33
题解 | 矩阵转置
#include <stdio.h> int main() { int n = 1;//行数 int m = 1;//列数 while (scanf("%d %d", &n, &m) == 2 && n <...
2026-02-03
0
34
题解 | 上三角矩阵判定
#include <stdio.h> int main() { int n = 0; while (scanf("%d", &n) == 1) { int arr[n][n]; int i = 0; ...
2026-02-03
0
38
题解 | 矩阵相等判定
#include <stdio.h> int main() { int n = 0; int m = 0; while (scanf("%d %d", &n, &m) == 2) { int arr1...
2026-02-03
0
32
题解 | 最高身高
#include <stdio.h> int main() { int n = 0; int m = 0; while (scanf("%d %d", &n, &m) == 2) { int i = ...
2026-02-02
0
40
题解 | 序列重组矩阵
#include <stdio.h> int main() { int n = 0; int m = 0; while (scanf("%d %d", &n, &m) == 2) { int a = ...
2026-02-02
0
36
题解 | 矩阵元素定位
#include <stdio.h> int main() { int n = 0; int m = 0; while (scanf("%d %d", &n, &m) == 2) { int arr[...
2026-02-02
0
31
题解 | 班级成绩输入输出
#include <stdio.h> int main() { double arr[5][5]; while (scanf("%lf", &arr[0][0]) == 1) { int i = 0; ...
2026-02-02
0
33
题解 | 有序序列合并
#include <stdio.h> #include <string.h> int main() { int n = 0; int m = 0; scanf ("%d %d", &n, &m); int arr1...
2026-02-01
0
27
题解 | 序列中整数去重
#include <stdio.h> int main() { int n = 0; while (scanf("%d", &n) == 1) { int arr[n]; int i = 0; ...
2026-02-01
0
31
首页
上一页
1
2
3
4
5
下一页
末页