c答案(5)

{int a,b,t,r;

if(u>v){t=u;u=v;v=t;} a=u;b=v;

while((r=b%a)!=0) {b=a;a=r;} return(a); } lcd(u,v,h) int u,v,h; {return(u*v/h);} main() {int u,v,h,l;

scanf(\ h=hcf(u,v);

printf(\ l=lcd(u,v,h);

printf(\}

7.2

＃i nclude\float x1,x2,disc,p,q; greater_than_zero(a,b) float a,b;

{x1=(-b+sqrt(disc))/(2*a); x2=(-b-sqrt(disc))/(2*a); }

equal_to_zero(a,b) flaot a,b;

{x1=x2=-b/(2*a);} smaller_than_zero(a,b) float a,b;

{p=-b/(2*a);

q=sqrt(-disc)/(2*a); }

main() {float a,b,c;

scanf(\ disc=b*b-4*a*c; if(fabs(disc)<=1e-5) {equal_to_zero(a,b);

printf(\ }

else if(disc>0)

21

{greater_than_zero(a,b);

printf(\ } else

{smaller_than_zero(a,b);

printf(\ } } 7.3 main()

{int number;

scanf(\ if(prime(number)) printf(\ else

printf(\}

int prime(number) int number; {int flag=1,n;

for(n=2;n

7.4

#define N 3 int array[N][N]; convert(array) int array[3][3]; {int i,j,t;

for(i=0;i

{int i,j;

for(i=0;i

22

scanf(\ convert(array); for(i=0;i

for(j=0;j

printf(\ } } 7.5

main()

{char str[100]; scanf(\ inverse(str); printf(\}

inverse(str) char str[]; {char t; int i,j;

for(i=0,j=strlen(str);i

str[i]=str[j-1]; str[j-1]=t; } }

7.6

char concate(str1,str2,str) char str1[],str2[],str[]; {int i,j;

for(i=0;str1[i]!='\\0';i++) str[i]=str1[i];

for(j=0;str2[j]!='\\0';j++) str[i+j]=str2[j]; str[i+j]='\\0'; }

main()

{char s1[100],s2[100],s[100]; scanf(\ scanf(\ concate(s1,s2,s); printf(\}

23

7.7 main()

{char str[80],c[80]; void cpy(); gets(str); cpy(str,c); printf(\}

void cpy(s,c) char s[],c[]; {int i,j;

for(i=0,j=0;s[i]!='\\0';i++)

if(s[i]=='a'||s[i]=='A'||s[i]=='e'||s[i]=='E'||s[i]=='i'|| s[i]=='I'||s[i]=='o'||s[i]=='O'||s[i]=='u'||s[i]=='U') {c[j]=s[i];j++;} c[j]='\\0'; } 7.8 main()

{char str[80]; scanf(\ insert(str); } insert(str) char str[];

{int i;

for(i=strlen(str);i>0;i--) {str[i*2]=str[i]; str[i*2-1]=' '; }

printf(\} 7.9

int alph,digit,space,others; main()

{char text[80]; gets(text);

alph=0,digit=0,space=0,others=0;

count(text);

printf(\}

24

count(str)

char str[]; {int i;

for(i=0;str[i]!='\\0';i++)

if((str[i]>='a'&&str[i]<='z')||(str[i]>='A'&&str[i]<='Z')) alph++;

else if(str[i]>='0'&&str[i]<='9') digit++;

else if(strcmp(str[i],' ')==0) space++; else

others++; }

7.10

int alph(c)

char c;

{if((c>='a'&&c<='z')||(c>='A'&&c<='Z')) return(1); else return(0);

}

int longest(string) char string[];

{int len=0,i,length=0,flag=1,place,point; for(i=0;i<=strlen(string);i++) if(alph(string[i])) if(flag) {point=i; flag=0; } else len++; else

{flag=1;

if(len>length) {length=len; place=point; len=0; } } return(place); }

main()

25