木懿尔

分类

/ 注册

全部文章（共22篇）

题解 | #矩阵元素定位#

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

2022-12-17

0 245

题解 | #有序序列合并#

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

2022-12-17

1 295

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

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

2022-12-17

0 190

题解 | #有序序列插入一个整数#

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

2022-12-16

0 248

题解 | #有序序列判断#

int main() { int n = 0; scanf("%d", &n); int arr[10]; int i = 0; int flag1 = 0;//标记升序 int flag2 = 0;//标记降序 for (i = 0...

2022-12-16

0 199

题解 | #最高分与最低分之差#

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

2022-12-16

0 325

题解 | #统计数据正负个数#

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

2022-12-16

0 194

题解 | #逆序输出#

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

2022-12-16

0 204

题解 | #矩阵计算#

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

2022-12-16

0 224

题解 | #密码验证#

#include <stdio.h> int main() { char arr1[20] = { 0 }; char arr2[20] = { 0 }; scanf("%s %s", arr1, arr2); if (strcmp(arr1, arr2) == 0) pr...

2022-12-16

0 250