- 博客(24)
- 收藏
- 关注
原创 2021-08-25C语言暑假作业
#include<stdio.h>#include<string.h>main(){char a[100],b[100],c[200],*p;scanf("%s%s",a,b);int i=0,j=0,k=0;while(a[i]!=’\0’&&b[j]!=’\0’){if(a[i]<=b[j])c[k++]=a[i++];elsec[k++]=b[j++];}c[k]=’\0’;if(a[i]==’\0’)p=b+j;e...
2021-08-25 14:58:40
167
原创 C语言暑假作业100题
#include<stdio.h>fun(int a[],int n,int m){int i,j,b[m];for(i=0;i<m;i++)b[i]=a[n-1-i];for(i=n-m-1;i>=0;i–)a[i+m]=a[i];for(i=0;i<m;i++)a[i]=b[i];}main(){int i,a[10],m;for(i=0;i<10;i++)scanf("%d",&a[i]);scanf("%d",&...
2021-08-25 14:57:48
148
原创 二级暑假作业
#include <stdlib.h>#include <stdio.h>#define N 20void fun( int a){ int i, x, n=0;x=rand()%20;/found/while (n<N){ for(i=0; i<n; i++ )/found/if( xa[i] )break;/found/if( in){ a[n]=x; n++; }x=rand()%20;}}void mai...
2021-08-16 20:01:15
168
原创 二级暑假作业71/80
#include<Stdio.h>#include<math.h>main(){int i,j,m;for(m=1;m<100000;m++){i=sqrt(m+100);{if(ii==(m+100)){j=sqrt(m+268);if(jj==(m+268))printf(" %d",m);}}}}72.#include<stdio.h>main(){int i,j;for(i=0;i<8;i++){...
2021-08-16 20:00:09
126
原创 C语言++++++++++
#include <stdio.h>void fun(){int a[3][3],sum;int i,j;/found*/sum=0;for (i=0;i<3;i++){ for (j=0;j<3;j++)/found*/scanf("%d",&a[i][j]);}for(i=0;i<3;i++)sum=sum+a[i][i];printf(“Sum=%d\n”,sum);}void main(){fun();}43....
2021-08-09 15:20:45
1290
原创 2021-08-09C语言
#include<stdio.h>#include<stdlib.h>main(){FILE *fp;char a[10],ch;scanf("%s",a);if((fp=fopen(a,“w”))==NULL)exit(0);ch=getchar();ch=getchar();while(ch!=’#’){fputc(ch,fp);ch=getchar();}putchar(10);fclose(fp);}62.#include<...
2021-08-09 15:18:22
90
原创 暑假作业二级C语言练习
#include<stdio.h>#include<stdlib.h>#define LEN sizeof(struct student)struct student{int num;char name[100];struct student *next;};int n;struct student *scan(void){struct student *p1,*p2,*head;p1=p2=(struct student *)malloc(LEN);...
2021-08-02 12:13:24
94
原创 2021-07-27C语言二级
#include<stdio.h>scan(int a){int i;for(i=0;i<10;i++)scanf("%d",(a+i));}fun(int a){int max=a,min=a,i;for(i=0;i<10;i++){if(max<(a+i))max=(a+i);if(min>(a+i))min=(a+i);}for(i=0;i<10;i++){if(max==*(a+i)){(a+i)=(a+9);...
2021-07-27 19:39:57
68
原创 2021-07-27暑假C语言作业
#include <stdlib.h>#include <stdio.h>#define N 10double fun(double *x){ int i, j; double s, av, y[N];s=0;for(i=0; i<N; i++) s=s+x[i];/found/av=s/N;for(i=j=0; i<N; i++)if( x[i]>av ){/found/y[j++]=x[i];x[i]=-...
2021-07-27 19:37:07
160
原创 2021-07-20
double fun(double x[],double *av){ int i,j; double d,s;s=0;for(i=0; i<N; i++) s = s +x[i];/found/av=s/N;d=32767;for(i=0; i<N; i++)if(x[i]<av && av - x[i]<=d){/found/d=av-x[i];j=i;}/found/return x[j];}void main()
2021-07-20 14:05:03
65
原创 暑假作业3
21#include<stdio.h>struct student{int num;char name[10];int cheng[3];}stu[10];main(){int i,j;for(i=0;i<10;i++){scanf("%d%s%d%d%d",&stu[i].num,stu[i].name,&stu[i].cheng[0],&stu[i].cheng[1],&stu[i].cheng[2]);}int avger
2021-07-18 09:51:22
92
原创 暑假二级作业
第一题.#include <stdlib.h>#include <stdio.h>#define N 10double fun(double x[],double *y){ int i,j; double av;/found/av=0.0;/found/for(i=0; i<N; i++)av=av+x[i]/N;for(i=j=0; i<N; i++)/found/if(x[i]>av) y[j++]= x[i];
2021-07-11 10:23:37
108
原创 暑假作业11—20
11.13个人围成一圈,从第一个人开始顺序报数,1,2,3。凡报到3者退出圈子。找出最后留在圈子中的人原来的序号。要求用循环链表处理。#include<stdio.h>float fish(float n){if(n==5) return (11);else return ((n+1)/n)*(fish(n+1)+1/(n+1));}main(){printf("%f",fish(1));}12#include<stdio.h>void splitfloat
2021-07-11 10:21:28
68
原创 二级C暑假作业
#include <stdio.h>#define N 5typedef struct student {long sno;char name[10];float score[3];} STU;void fun(char *filename, STU n){ FILE *fp;/found/fp = fopen(filename, “rb+”);/found/fseek(fp, -(long)sizeof(STU), SEEK_END);/found/fwrite(&
2021-07-04 10:29:48
138
原创 C语言暑假作业一至十题
1.使用函数求奇数和:输入一批正整数(以零或负数为结束标志),求其中所有奇数的和。要求定义和调用函数even(n),判断整数的奇偶性,当n为偶数时返回1,否则返回0。#include <stdio.h>#include <stdlib.h>int even(int n){return n %2 ==0?1: 0;}int main(){int n,sum=0;printf(“请输入-批数整数: \n”);scanf( “%d”, &n);while (
2021-07-04 10:09:36
530
原创 2021-02-27
99#include <stdio.h>void main(){int a,b,c;for (a=1; a<=3; a++)for (b=1; b<=3; b++)for (c=1; c<=3; c++)if (a!=1&&c!=1&&c!=3&&a!=b&&a!=c&&b!=c){ printf("%c will marry to a\n", 'x' + a - 1);
2021-02-27 21:24:00
69
原创 2021-02-27
85#include<stdio.h>void main(){int i,j,k;int num;for(num=100;num<1000;num++){i=num/100;j=(num-i*100)/10;k=num%10;if(i+kj&&num%50&&num%7==0)printf("%d ",num);}}86#include<stdio.h>void main(){int i,j;int s
2021-02-27 21:23:24
245
原创 c语言
73#include"stdio.h"void main(){int num;printf(“please input a num:\n”);scanf("%d",&num);if(num%30&&num%50&&num%70)printf("%d可以被3、5、7整除!\n",num);else if(num%30&&num%50)printf("%d可以被3、5整除!\n",num);else if(num%30&&am
2021-02-26 19:32:15
83
原创 2021-02-25
61#include<stdio.h>void main(){int n,i;printf("\nplease input a number:\n");scanf("%d",&n);printf("%d=",n);for(i=2;i<=n;i++)while(n!=i){if(n%i==0){printf("%d*",i);n=n/i;}elsebreak;}printf("%d",n);}62#include <stdio.h&g
2021-02-25 19:22:06
99
原创 2021-02-24
49#include"stdio.h"void main(){int a,b,t,r,n;printf(“please input the a and b:\n”);scanf("%d%d",&a,&b);if(a<b){t=b;b=a;a=t;}r=a%b;n=a*b;while(r!=0){a=b;b=r;r=a%b;}printf(“这两个数的最大公约数为%d,最小公倍数为%d\n”,b,n/b);}50#include <s
2021-02-24 17:40:04
180
原创 2021-02-23
37#include"stdio.h"#include"string.h"void main(){char st[20],string[3][20];int i,j,p;printf(“input three string:\n”);for(i=0;i<3;i++)gets(string[i]);printf("\n");for(i=0;i<3;i++){ p=i; strcpy(st,string[i]); for(j=i+1;j<3;j++)
2021-02-23 18:15:05
95
原创 2021-02-22
25#include<stdio.h>void main(){int N,a=2,b=0,c=0,i=1;scanf("%d",&N);if(N>1){while(c<2*N){ c=a+b;b=a;a=c;i++;}printf("%d",i);}else printf(“1”);}26#include<stdlib.h>#include<stdio.h>void main(){int i,count=0
2021-02-22 20:13:49
85
原创 2021-02-21
13#include"stdio.h"void main(){int a,b,c,min;printf(“please input the a,b and c:\n”);scanf("%d%d%d",&a,&b,&c);if(a<b){if(a<c)min=a;elsemin=c;}else{if(b<c)min=b;elsemin=c;}printf(“the min is %d\n”,min);}14#includ
2021-02-21 18:05:40
93
原创 2021-02-20
1#include “stdio.h”void main(){int arr[3][3];int i,j,max,min;int max_i,max_j;int min_i,min_j;printf(“please input the arr:\n”);for(i=0;i<3;i++)for(j=0;j<3;j++)scanf("%d",&arr[i][j]);for(i=0;i<3;i++){for(j=0;j<3;j++)printf("%5
2021-02-20 15:56:05
85
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人