- 博客(9)
- 收藏
- 关注
RSS订阅原创 2020-12-08
#include <stdio.h>#include <stdlib.h>#include<string.h>void scanfArr(int a[],int m);int main(){int T,i=0,j=0,k;scanf("%d",&T);int a[T],n,r;scanfArr(a,T);char str[1000],str1[1000];while(i<T){n=a[i++];j=0;while(n){r=
2020-12-08 10:20:06
92
原创 2020-12-08
#include<stdio.h>#include<time.h>#include<stdlib.h>void f(int a[],int m);int main(){int a[6];int i;f(a,6);for(i=0;i<6;i++){if(a[i]==1)printf(“郭鑫\t”);else if(a[i]==2)printf(“李烨显\t”);else if(a[i]==3)printf(“黄桓钱\t”);else
2020-12-08 10:19:31
70
原创 2020-12-06
//非递归二分搜索#include<stdio.h>#include<stdlib.h>#include<time.h>#define N 100int halfSearch(int a[N],int m,int num);void makeArr(int a[N],int m);void printfArr(int a[],int m);void sort(int a[],int m);int main(){int a[100];int
2020-12-06 17:03:41
72
原创 2020-12-06
#include <stdio.h>#include <stdlib.h>#include<time.h>#define N 30double sumArr(double a[],int m);void printfArr(double a[],int m);int judgeMax(double a[],int m,int i);int main(){ srand(time(NULL));double a[N]={0};double money,m
2020-12-06 17:03:03
99
原创 2020-12-06
//两个集合的合并#include<stdio.h>void printfArr(int a[],int m);void sort(int a[],int m);void scanfArr(int a[],int m) ;int main(){int m,n;scanf("%d",&m);int a[m];scanfArr(a,m);scanf("%d",&n);int b[n];scanfArr(b,n);int c[m+n];int i=m-1,j=0,
2020-12-06 17:02:15
48
原创 2020-12-06
//鞍点问题#include<stdio.h>#include<time.h>#include<stdlib.h>#define N 10int findMax(int a[N][N],int n,int i);int judgeMin(int a[N][N],int m,int j,int k) ;void makeArr(int a[N][N],int m,int n) ;void outputarr(int a[N][N],int m,int n)
2020-12-06 17:01:33
97
原创 2020-12-06
//手动飞机#include<stdio.h>#include<stdlib.h>int main(void){int i,j,k,l,x=5,y=5;int n=7;n/=2;while(1){system(“cls”);for(l=0; l<y; l++)printf("\n");for(i=-n; i<=n; i++){for(j=0; j<n-abs(i)+x; j++)printf("%c",’ ‘);for(k=0; k
2020-12-06 17:01:02
55
原创 2020-12-06
int halfSearch(int a[],int m,int x,int low,int high){if(low>high)return -1;else{int mid=(low+high)/2;if(x==a[mid])return (mid+1);if(x<a[mid])return (halfSearch(a,x,low,mid));elsereturn (halfSearch(a,x,mid,high));}}
2020-12-06 17:00:30
66
原创 2020-12-05
产生不重复的随机数#include <stdio.h>#include <stdlib.h>#include <time.h>int main(){int num[4], cnt = 0, n;srand(clock()); // 设置随机数种子while (cnt < 4){n = rand() % 4; // 生成4以内随机数，这样更利于测试for (int i = 0; i < cnt; i++)if (num[i] == n)
2020-12-05 15:30:47
63
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人