1、一void fun(int a, int b, long *c)*c=(a/10)*1000+(b/10)*100+(a%10)*10+(b%10);二void fun(int a, int b, long *c)*c=(b/10)*1000+(a%10)*100+(b%10)*10+(a/10);三void fun(int a, int b, long *c)*c=(b%10)*1000+(a%10)*100+(b/10)*10+(a/10);四void fun(int a, int b, long *c)*c=(a%10)*1000+(b/10)*100+(a/10)*10+(b%10);
2、五float fun ( float *a , int n ) int i; float ave=0.0;for(i=0; i= a k = j ;ppi = ttki ; 十六unsigned fun ( unsigned w ) if(w10000) w %= 10000 ;else if(w1000) w %= 1000 ;else if(w100) w %= 100 ;else if(w10) w %=10 ;return w ;十七fun ( char *s ) char bN ; int i = 0, j ;memset(b, 0, N) ;for(j = strlen(s) -
3、1 ; j = 0 ; j-) bi+ = sj ;strcpy(s, b) ;十八int fun(char s,char c) char *p = s ; int i = 0 ;while(*p) if(*p != c) si+ = *p ;p+ ;si = 0 ;十九int fun(char *s,int num) char ch ; int i, j ;for(i = 1 ; i = a return x1;二十九int fun( int t)int f0 = 0, f1 = 1, f ;do f = f0 + f1 ; f0 = f1 ; f1 = f ; while(f ave =
4、a-ave + a-si ;a-ave /= N ;三十七double fun( STREC *a, STREC *b, int *n ) int i ; double ave = 0.0 ; *n = 0 ;for(i = 0 ; i next; double av=0.0; int n = 0 ;while(p!=NULL) av = av + p-s ; p=p-next; n+; av /= n ; return av ; 四十一int fun(int n) int s = 0, i ;for(i = 2 ; i =0.000001)xn=xn*x*(0.5-n+1)/n; n+=1;
5、sn+=xn; return(sn);四十四 int i;double avg=0.0, sum=0.0, abs=0.0, fc;for (i=0;i1 n+; t=t*n/(2.0*n+1); return (s*2.0);五十七void fun(int a, int n , int *max, int *d ) int i ;*max=a0;*d = 0 ; for(i = 1; i ai.s) j = i ; min = ai.s ; *s = aj ;六十三void fun ( int aN, int m ) int i, j;for(i = 0 ; i (i/2) aak+ = i
6、;六十九/* 以下完成查找最长串 */if(strlen(ai) maxlen) maxlen = strlen(ai) ;k = i ;七十void fun(char *str) char *p = str ;int i = 0 ;while(*p) if(*p != ) stri+ = *p ;p+ ;stri = 0 ;七十一void fun( char *ss ) char *p = ss ;int i = 0 ;while(*p) if(i % 2) return j;七十四void fun ( int x, int pp, int *n ) int i; *n=0;for(i=1;
7、 i t) b(*n)+ = ai ;return t ;八十七int i, j = 0, min=a0.s ;for(i = 0 ; i ai.s) j = 0 ; bj+ = ai ; min = ai.s ;else if(min = ai.s)bj+ = ai ;return j ;八十八*c = (b%10)*1000+(a/10)*100+(b/10)*10+a%10;八十九int i,j = 0 ;for(i = 0 ; i = l STREC *p;p=h-next;while(p) if(p-smax )max=p-s;p=p-next;return max;九十一int i, j = strlen(str) ;for(i = 0 ; i 10) bM - 1+ ; else bj+ ; 一百int k = 1 ;while(*s) if(*s = ) k+ ;s+ ;return k ;
