1、void main() float x,y,bx,by; x=208*2.87/287; y=39.6*x/(10-2.08); bx=x/10*100; by=y/12.5*100; printf(bx=%5.1f%n,bx);by=%5.1f%n,by);确保通用性# include double m1,m2,a,b,w1,w2;请输入固体氯化钡样品的质量m1(g): n);scanf(%lf,&m1);printf(请输入加入水的质量m2(g):m2);请输入所取滤液的质量a(g):a);请输入完全反应后生成沉淀的质量b(g):b);w1=208*b/(287*a);w2=208*b*(
2、m1+m2)/(287*a*m1);滤液中溶质的质量分数为:%lf n,w1);样品中氯化钡的质量分数为:,w2); main() * n * n*n 3.#define MAX(x,y) (x)(y)?(x):(y)#define MIN(x,y) (x)void main( ) FILE *fp; if(fp=fopen(f.txt,w)=NULL) Error on open f.txt! exit(0); fprintf(fp,%sProgramming is fun! if(fclose(fp)Can not close d:f.txt and strike any key exit
3、! getch();# define ISLOWER(c) (c=97&=132?1:0) char x;%cx); if ISLOWER(x),x);6. int year=1986,r=76;本世纪地球上见到哈雷彗星的年份是%d年!,year+r);习题三1.D 2.C 3.D 4.A 5.A 6.A 7.D 8.B 9.A 10.D11.C 12.B 13.B 14.A1.82.23.s=94.225.2三、程序填空题【1】m%n 【2】n【3】w【1】&n 【2】s=0【3】k【4】s+=i+【5】%ld【1】i100 【2】i%3=0&i%10=6 float n,s=0,t=1;
4、for(n=1;n=1e-6) n+; e+=k; k=k/n;n=%dte=%fn,n,e); int i; float k,s,fz=2,fm=1,newfz; s=fz/fm; for(i=2;i x1=(x2+1)*2;/*根据题意:第2天剩下的桃子数x2=x1/2-1,也就是说:第一天的桃子数是第2天桃子数加1后的2倍*/ x2=x1; day-;the total is %dn,x1);6 int i,j,s; for(j=2;jj+) s=j; for(i=1;j; if(j%i)=0) s=s-i; if(s=0)%d is a wanshun,j);7 int a,b,c,d
5、,e,f,s1,s2,s3,s4,s5,s6;/a,b,c,d,e,f各代表一个嫌疑人 for(a=0;a=1;a+) for(b=0;bb+) for(c=0;c+) for(d=0;dd+) for(e=0;ee+) for(f=0;fachz ch=ch-32; fputc(ch,fp);#include char xx5080 ;int maxline = 0 ; /* 文章的总行数 */int ReadDat(void) ;void WriteDat(void) ;void StrCharJR(void); if(ReadDat()数据文件in.txt不能打开!n007) ; ret
6、urn ; StrCharJR() ; WriteDat() ;void StrCharJR(void) int i,j; for(i=0;maxline; for(j=0;xxij! xxij+=xxij4;int ReadDat(void) FILE *fp ; int i = 0 ; if(fp = fopen(in.txt, ) = NULL) return 1 ; while(fgets(xxi, 80, fp) != NULL) i+ ; maxline = i ; fclose(fp) ; return 0 ;void WriteDat(void) int i ; fp = fo
7、pen(OUT.txt for(i = 0 ; i number = 0;next = NULL; return(c); /*返回链表头指针*/ void AppendToTable(struct Collelm * x) /*向集合中添加元素x*/%d, &number); while(number) InsertToTable(x,number); scanf(void InsertToTable(struct Collelm * x,int number) /*向集合x中插入一个元素number*/ struct Collelm * newc, * last; /*newc新建节点指针*
8、/ last = x; /*last是链表的尾指针*/ while(last-next!=NULL) last=last-next; newc = (struct Collelm *) malloc(sizeof(struct Collelm); newc-number = number; last-next = newc; newc -next= NULL;void Addition(struct Collelm *x,struct Collelm *y,struct Collelm* collAdd) /*求两集合的并集*/ struct Collelm *p,*q,*r; p=x- q=
9、y- r=collAdd; if(!p) /*若集合p为空*/ if(!q) /*若集合q为空*/ return; else /*若集合q不为空*/ while(q) InsertToTable(r,q- r=r- q=q- else /*若集合p不为空*/ q) /*若集合q为空*/ while(p) InsertToTable(r,p- p=p- else /*若集合q不为空*/ while(q) q=y- while(q) if(p-number!=q-number) q=q- else break; if(!q) InsertToTable(r,p- r=r- PrintTable(collAdd);void Multiply(struct Collelm *x,struct Collelm *y,struct Collelm* collMul) /*求两集合的交集*/ r=collMul;p|!q) /*p,q两个集合中有一个为空*/ return; else while(p) if(p-number=q- p=p- q=y- PrintTable(collMul);void PrintTable(struct Collelm * c) /*输出集合中元素的功能函数*/ struct Collelm *t; t=c; t=t- i
copyright@ 2008-2022 冰豆网网站版权所有
经营许可证编号:鄂ICP备2022015515号-1