第七章：函数调用.docVIP

7.1 #include void main int hcf int,int ; int lcd int,int,int ; int u,v,h,l; scanf %d,%d,u,v ; h hcf u,v ; printf H.C.F %d\n,h ; l lcd u,v,h ; printf L.C.D %d\n,l ; int hcf int u,int v int t,r; if v u t u;u v;v t; while r u%v ! 0 u v; v r; return v ; int lcd int u,int v,int h return u*v/h ; 7.2 #include #include float x1,x2,disc,p,q; void main void greater_than_zero float,float ; void equal_to_zero float,float ; void smaller_than_zero float,float ; float a,b,c; printf input a,b,c: ; scanf %f,%f,%f,a,b,c ; printf equation: %5.2f*x*x+%5.2f*x+%5.2f 0\n,a,b,c ; disc b*b-4*a*c; printf root:\n ; if disc 0 greater_than_zero a,b ; printf x1 %f\t\tx2 %f\n,x1,x2 ; else if disc 0 equal_to_zero a,b ; printf x1 %f\t\tx2 %f\n,x1,x2 ; else smaller_than_zero a,b ; printf x1 %f+%fi\tx2 %f-%fi\n,p,q,p,q ; void greater_than_zero float a,float b x1 -b+sqrt disc / 2*a ; x2 -b-sqrt disc / 2*a ; void equal_to_zero float a,float b x1 x2 -b / 2*a ; void smaller_than_zero float a,float b p -b/ 2*a ; q sqrt -disc / 2*a ; 7.3 #include void main int prime int ; int n; printf \ninput an integer: ; scanf %d,n ; if prime n printf \n %d is a prime.\n,n ; else printf \n %d is not a prime.\n,n ; int prime int n int flag 1,i; for i 2;i n/2 flag 1;i++ if n%i 0 flag 0; return flag ;  7.4#include #define N 3 int array[N][N]; void main void convert int array[][3] ; int i,j; printf input array:\n ; for i 0;i N;i++ for j 0;j N;j++ scanf %d,array[i][j] ; printf \noriginal array :\n ; for i 0;i N;i++ for j 0;j N;j++ printf %5d,array[i][j] ; printf \n ; convert array ; printf convert array:\n ; for i 0;i N;i++ for j 0;j N;j++ printf %5d,array[i][j] ; printf \n ; void convert int array[][3] int i,j,t; for i 0;i N;i++ for j i+1;j N;j++ t array[i][j]; array[i][j] array[j][i]; array[j][i] t; 7.5 #include #include void main void inverse char str[] ; char str[100]; printf input string: ; scanf %s,str ; inverse str ; printf i