牛客965706134号

分类

题解(22)

/ 注册

全部文章（共22篇）

题解 | #KiKi去重整数并排序#

#include<stdio.h> #include<stdlib.h> int compare(const void* a, const void* b) { return (*(int*)a)-(*(int*)b); } int main() { int ...

C

2021-12-28

0 254

题解 | #小乐乐查找数字#

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

C

2021-12-16

2 279

题解 | #小乐乐计算函数#

#include<stdio.h> int max3(int a,int b,int c) { int max = a; if(max<b) { max = b; } if(max<c) { ma...

C

2021-12-16

0 305

题解 | #小乐乐改数字#

#include<stdio.h> #include<math.h> int main() { int n = 0; int arr[10] = {0}; int i = 0; int sum = 0; int tmp = 0; ...

C

2021-12-10

0 255

题解 | #小乐乐定闹钟#

#include<stdio.h> int main() { int hour = 0; int minute = 0; int k = 0; scanf("%d:%d %d", &hour, &minute, &k); m...

C

2021-12-08

0 307

题解 | #杨辉三角#

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

C

2021-12-02

0 236

题解 | 矩阵交换

矩阵交换 #include<stdio.h> int main() { int n = 0;//行 int m = 0;//列 int arr[10][10] = { 0 };//原数组 int arr1[10][10] = { 0 };//变换存储在中间...

C

2021-12-01

0 336

题解 | 有序序列判断

标题有序序列判断 #include<stdio.h> int main() { int n = 0; int arr[50] = { 0 };//存放原序列 int arr1[50] = { 0 };//存放升序列 int arr2[50] = { 0 ...

C

2021-11-28

0 294

题解 | 最大值最小值之差

标题最大值最小值之差 ">int main() { int n = 0; int m = 0; int max = 0; int min = 100; scanf("%d",&n); for(int i = 0;i<n;i++) ...

C

2021-11-28

17 474

题解 | 矩阵计算

标题矩阵计算 ">int main() { int N = 0; int M = 0; int sum = 0; int arr[10][10] ={0}; scanf("%d %d",&N,&M); for(int i = 0;i&...

C

2021-11-28

0 341