牛客742201245号

分类

/ 注册

全部文章（共69篇）

题解 | #矩阵元素定位#

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

2023-04-06

0 152

题解 | #矩阵相等判定#

#include <stdio.h> int main() { int n = 0; int m = 0; int i = 0; int arr1[10][10]={0}; int arr2[10][10]={0}; scanf("%d...

2023-04-06

0 195

题解 | #最高身高#

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

2023-04-05

0 198

题解 | #序列重组矩阵#

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

2023-04-05

0 176

题解 | #矩阵元素定位#

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

2023-04-05

0 170

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

#include <stdio.h> int main() { double n = 0.0; double score[5][5] = {0}; int i = 0; for(i = 0;i<5;i++) { ...

2023-04-04

0 191

题解 | #有序序列合并#

#include <stdio.h> int main() { int n = 0; int m = 0; int arr1[2000] = {0}; int arr2[1000] = {0}; scanf("%d %d",&n,&m); ...

2023-04-04

0 203

题解 | #序列中整数去重#

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

2023-04-04

0 162

题解 | #序列中删除指定数字#

#include <stdio.h> int main() { int i = 0; int j = 0; int n = 0; int del = 0; int arr[50] = {0}; int arr2[50] = {0}; ...

2023-04-04

0 135

题解 | #有序序列判断#

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

2023-04-04

0 182