x0=x1 15. unsigned fun(unsigned w) if(*p!=c) unsigned t, s=0, s1=1, p=0 s[i]=*; while (fabs(x0 -)>=le-6):t=w i++;} return xl; F while(t>10) 11. int fun(int al]N) if(t/10) s[i]=0’;} lint i, j: p=t%10; 20. int fun(int lim, int aa [MAX]) for(i=0: i<N; i++) s=Stp*sl lint k=0, 1, j: for(j=0;孓i;j+) s1=s1*10 for(i=lim; il; i-) [i][j=0;} t=t/10;} Ifor(j=2; j<i; j++) 12. double fun(int w[][Nd) return s if(1%j==0) lint i, j, k0 16. float fun(float h) break: double s=0. 0 flong t: else for (j=0; j<N; j++) continue {s+=W[0][j; k++ t=(h+5)/10; 8吕 for (j=0; j<N; j++ s=(float)t/100.0 s+=N1[j; return k++: k++;} 17. void fun(char *s) 21. void fun(char *s, int num for (1=1; i<=N-2; i++) Ichar ch Ichar t: s+=[i][o int 1, m,n: int 1, J for (i=1; i<num2; i++) return s/=k;] m=n=strlen (s)-1 for (j=i+1; j<num-1: j++) 13. void fun(int tt[min], intwlpi NEi<(n+1)/2) if(sLi]<s[j]) [int i, j, min; Ich=s[i] [t=s [i] for(j=0; j<N; j++) s [i]=s [m s[i]=s[j] [min=tt[o][j] s[m]=ch s[门玩;} for (i=0; i<M; i++) 22. double fun (STREC *h) lif (tt[i]Lj]<min) i double max min=tt[i][j]: 1 18. void fun (int array[3][3])STREC *q=h =1n Int 1 max=h->s 14. int fun (int a[mind for (i=0: i<3; i++) lint i, j,s=0 temp=array[i]lj] for (j=0; j<N; j++) array[i][j]=array [j][i]: [s+=a[0][j; array [j][i]=temp; J s+≡aDM-1][j; 19. void fun (char s[, int c) for (i=1: i<M-2: i++) int i=0 [s+=a[i][0 s+≡a[i]IN-1];} return s: F while(*p) return max: lif(g->s>max 23. int fun (char *str) max=q->s [int i, n=0, fg=1 char *p=str while(q!=0) while(*p){x0=x1; x1=cos(x0); } while (fabs(x0-x1)>=1e-6); return x1;} 11. int fun(int a[][N]) {int i,j; for(i=0;i<N;i++) for(j=0;j<i;j++) a[i][j]=0;} 12.double fun (int w[][N]) {int i,j,k=0; double s=0.0; for (j=0;j<N;j++) {s+=w[0][j]; k++;} for (j=0;j<N;j++) {s+=w[N-1][j]; k++;} for (i=1;i<=N-2;i++) {s+=w[i][0]; k++;} return s/=k;} 13. void fun(int tt[M][N],int pp[N]) {int i,j,min; for (j=0;j<N;j++) {min=tt[0][j]; for (i=0;i<M;i++) {if (tt[i][j]<min) min=tt[i][j];} pp[j]=min;}} 14. int fun (int a[M][N]) {int i,j,s=0; for (j=0;j<N;j++) {s+=a[0][j]; s+=a[M-1][j];} for (i=1;i<=M-2;i++) {s+=a[i][0]; s+=a[i][N-1];} return s;} 15. unsigned fun(unsigned w) {unsigned t,s=0,s1=1,p=0; t=w; while(t>10) {if(t/10) p=t%10; s=s+p*s1; s1=s1*10; t=t/10; } return s;} 16. float fun (float h) {long t; float s; h=h*1000; t=(h+5)/10; s=(float)t/100.0; return s;} 17. void fun(char *s) {char ch; int i,m,n; i=0; m=n=strlen(s)-1; while(i<(n+1)/2) {ch=s[i]; s[i]=s[m]; s[m]=ch; i++; m--;}} 18. void fun(int array[3][3]) {int i,j,temp; for (i=0;i<3;i++) {temp=array[i][j]; array[i][j]=array[j][i]; array[j][i]=temp; }} 19. void fun(char s[],int c) {int i=0; char*p; p=s; while(*p) {if(*p!=c) {s[i]=*p; i++;} p++;} s[i]='\0';} 20. int fun(int lim,int aa[MAX]) {int k=0,i,j; for(i=lim;i>1;i--) {for(j=2;j<i;j++) if(i%j==0) break; else continue; if(j>=i) {aa[k]=i; k++;}} return k++;} 21.void fun(char *s,int num) {char t; int i,j; for (i=1;i<num-2;i++) for (j=i+1;j<num-1;j++) if(s[i]<s[j]) {t=s[i]; s[i]=s[j]; s[j]=t;}} 22. double fun (STREC *h) { double max; STREC *q=h; max=h->s; do {if(q->s>max) max=q->s; q=q->next; } while(q!=0); return max;} 23. int fun(char *str) {int i,n=0,fg=1; char *p=str; while (*p)