offer快朝我砸来
offer快朝我砸来
全部文章
分类
归档
标签
去牛客网
登录
/
注册
offer快朝我砸来的博客
全部文章
(共75篇)
题解 | #序列重组矩阵#
#include <stdio.h> int main() { int a = 0, b = 0; int sum = 0; int i = 0, j = 0; int m = 0, n = 0; int arr[1000] = { 0 }; ...
2023-04-22
0
194
题解 | #矩阵元素定位#
#include <stdio.h> int main() { int m = 0, n = 0; int i = 0, j = 0; int arr[100][100] = { 0 }; scanf("%d %d", &m, &n); for (i = 0; i < m...
2023-04-21
0
185
题解 | #班级成绩输入输出#
#include <stdio.h> int main() { double sum = 0; double arr[5][5] = { 0 }; int i = 0, j = 0; for (i = 0; i < 5; i++) { ...
2023-04-21
0
171
题解 | #序列中整数去重#
#include <stdio.h> int main() { int arr[100] = { 0 }; int n = 0, i = 0, j = 0, m = 0; scanf("%d", &n); for (i = 0; i < n; i++...
2023-04-21
0
179
题解 | #序列中删除指定数字#
#include <stdio.h> int main() { int arr1[100] = { 0 }; int arr2[100] = { 0 }; int temp = 0; int p = 0; int n = 0, i = 0, j =...
2023-04-21
0
229
题解 | #有序序列插入一个整数#
//这个题跟前面一道题重复了 #include <stdio.h> int main() { int arr[100] = { 0 }; int temp = 0; int n = 0, i = 0, j = 0, m = 0; scanf("%d", &...
2023-04-21
0
164
题解 | #有序序列判断#
#include <stdio.h> int main() { int n = 0, m = 0, i = 0; int count1 = 0, count2 = 0; scanf("%d", &n); int arr[100] = { 0 }; for (i = 0; i &...
2023-04-21
0
168
题解 | #最高分与最低分之差#
#include <stdio.h> int main() { int n = 0, i = 0, j = 0; int arr[500] = { 0 }; int temp = 0; int Dis = 0; scanf("%d", &n); ...
2023-04-21
0
198
题解 | #逆序输出#
#include <stdio.h> int main() { int arr[10] = { 0 }; int i = 0; int j = 0; for (i = 0; i < 10; i++) { scanf("%d", &arr[i]); } for (j...
2023-04-20
0
183
题解 | #成绩输入输出问题#
#include <stdio.h> int main() { int i = 0; int arr[10] = { 0 }; for (i = 0; i < 10; i++) { scanf("%d", &arr[i]); } for (i = 0; i <...
2023-04-20
0
172
首页
上一页
1
2
3
4
5
6
7
8
下一页
末页