s*二t n+十 for(i=0;i<n/2;i++) (str[i]==str [n-l-i] return pi else 27. void fun(int m, int *a, int *n fg=0; int i, j: *n=0 break;] for(i=1;i<=;i++) return fg: h if(i%7=0//i%11=0 24. long fun char *p) [alj]=i [long s=0, t int i=0, j, in=strlen(p),k, s1: if(p[0]=) 28. void fun (int a[l, int n, int *max, int *d) lint i for(j=i; j<=n-1; j++) 事max=8 [=p[j0°; *d=0 s1=10 for(i=0; i<n; i++) for (k=j: k<n-1; k++) if(a[il>*max) t*=s1 *皿ax=a[i] if(p[0]=-) 29. void fun(char *ss) return-s lint i, n; else n=strlen(ss) return s: for(i=1;i<n;i+=2;) 25. char *fun(char *s, char *t) if(ss[订]≥a'&&s[i]<z) [char *p, *tl=t, *s1=s ss[i]=ss[i]-32;} int n=0, F0; 30. int fun(int a[]M) while(*s1) [int i,j, max max=a[o][o] s1++;} for(1=0;i<2;i+) while(*t1) for(j=0; j<; j++) mt+ if(ali][j]>max) t1++;} max=ali]Lj] if(n>=n) return max: I 31. void fun(char *s, char t[) else [int i, j, n; return p for(i=0: i<n;i++) 26. double fun(double eps (i%2=0&s[i]%2=0) double s [t[j]=s [j] float n, t, pi t=1;pi=0;n=1.0;s=1.0; t[j]=10;} hile((fabs(s))>=eps) 32. void fun (char *s, char t[]) mint i, j=0, n; t=n/(2*n+1) n=strlen(s){n++; p++;} for (i=0;i<n/2;i++) if (str[i]==str[n-1-i]); else {fg=0; break;} return fg;} 24. long fun(char *p) {long s=0,t; int i=0,j,in=strlen(p),k,s1; if(p[0]=='-') i++; for(j=i;j<=n-1;j++) {t=p[j]-'0'; s1=10; for (k=j;k<n-1;k++) t*=s1; s+=t; } if(p[0]=='-') return -s; else return s;} 25. char *fun(char *s,char *t) {char *p,*t1=t,*s1=s; int n=0,m=0; while(*s1) {n++; s1++;} while(*t1) {m++; t1++;} if(n>=m) p=s; else p=t; return p;} 26. double fun(double eps) {double s; float n,t,pi; t=1;pi=0;n=1.0;s=1.0; while((fabs(s))>=eps) {pi+=s; t=n/(2*n+1); s*=t; n++;} pi=pi*2; return pi;} 27.void fun(int m,int *a,int *n) {int i,j;*n=0; for(i=1;i<=m;i++) if(i%7==0//i%11==0) {a[j]=i; j++;} *n=j;} 28. void fun(int a[],int n, int *max,int *d) {int i; *max=a[0]; *d=0; for(i=0;i<n;i++) if(a[i]>*max) {*max=a[i]; *d=i;}} 29. void fun(char *ss) {int i,n; n=strlen(ss); for(i=1;i<n;i+=2;) if(ss[i]>='a'&&ss[i]<='z') ss[i]=ss[i]-32;} 30. int fun(int a[][M]) {int i,j,max; max=a[0][0]; for(i=0;i<2;i++) for(j=0;j<M;j++) if(a[i][j]>max) max=a[i][j]; return max;} 31. void fun(char *s,char t[]) {int i,j,n; n=strlen(s); for(i=0;i<n;i++) if(i%2==0&s[i]%2==0) {t[j]=s[j]; j++;} t[j]='\0';} 32. void fun(char *s,char t[]) {int i,j=0,n; n=strlen(s);