}
int n,i;
double sum=0.0; printf(\输入n:\scanf(\for(i=0;i printf(\输入%d个学生的学号、姓名和成绩:\scanf(\sum+=stu.score; printf(\平均成绩:%.2f\\n\return 0; #include struct complex{ int a,b; }x,y,z; printf(\输入a1, a2, b1, b2:\ scanf(\z.a=x.a*y.a-x.b*y.b; z.b=x.a*y.b+x.b*y.a; printf(\×(%d+%di)=%d+%di\\n\ return 0; } #include char name[80]; double price; }abook,min,max; int n,i; printf(\输入n:\scanf(\min.price=10000; max.price=-1; for(i=0;i printf(\输入第%d本书的名称和定价:\scanf(\if(min.price>abook.price) min=abook; if(max.price max=abook; } printf(\价格最高的书: %s ,价格:%.1f\\n\ printf(\价格最低的书: %s ,价格:%.1f\\n\ return 0; } #include struct addres{ char name[20]; int birthday; char phon[80]; }person[10],tmp; int n,i,j,index; printf(\输入n:\scanf(\for(i=0;i printf(\输入第%d个人的姓名、生日、电话号码:\ scanf(\ } for(i=0;i for(j=1;j person[n-i-1]=person[index]; person[index]=tmp; } for(i=0;i printf(\return 0; #include int year,month,day; }; int day_of_year(struct date date){ int k,leap,d=date.day; int tab[2][12]={{31,28,31,30,31,30,31,31,30,31,30,31},{31,29,31,30,31,30,31,31,30,31,30,31}}; } leap=(date.year%4==0&&date.year0!=0||date.year@0==0); for(k=0;k int main(){ } struct date date; printf(\输入日期:\ scanf(\ printf(\该日期是%d年第%d天\\n\return 0; #include void chang_time(struct time* t,int n){ } t->second=t->second+n; t->minit+=t->second/60; t->second=t->second`; t->hour+=t->minit/60; t->minit%=60; t->hour%=24; int hour,minit,second; int main(){ struct time t; } int n; printf(\输入时间:\ scanf(\printf(\输入秒:\scanf(\chang_time(&t,n); printf(\新时间:%d:%d:%d\\n\return 0; 实验10 #include int is_sqr(int m){ int s=sqrt((double)m); return s*s==m; } int same_dig(int m){ int d[3],i,j; d[0]=m; d[1]=(m/10); d[2]=m/100; for(i=0;i<3;i++) } for(j=i+1;j<3;j++) if(d[i]==d[j]) return 1; return 0; int fun(int number){ int i,c=0; } int main(){ int number,i,count; printf(\scanf(\count=fun(number); printf(\return 0; for(i=101;i<=number;i++) if(is_sqr(i)&&same_dig(i)) c++; return c; } #include #include if(m%k==0) return 0; return 1; } int main(){ int i,n,x,count=0; printf(\ scanf(\ printf(\for(i=0;i if(prime(x)) count++; printf(\return 0; } #include if(n==0) return 1.0; if(n==1) return x; return ((2*n-1)*P(n-1,x)-(n-1)*P(n-2,x))/n; } int main(){ } int n; double x; printf(\scanf(\printf(\ scanf(\ printf(\return 0; #include return n+1; if(n==0) return Ack(m-1,1); return Ack(m-1,Ack(m,n-1)); } int main(){ int m,n; printf(\scanf(\ printf(\scanf(\ printf(\return 0; } #include } printf(\return; dectobin(n/2); printf(\ } int main(){ int n;