2021-07-21

void fun(char *s)
{ int k[26]={0},n,i,max=0; char ch;
while(*s)
{ if( isalpha(*s) ) {
/found/
ch=tolower(*s);
n=ch-‘a’;
/found/
k[n]+= l ;
}
s++;
/found/
if(max<k[n]) max= k[n] ;
}

/found/
float fun(int k)
{
int n; float s, w, p, q;
n=1;
s=1.0;
while(n<=k)
{
w=2.0n;
p=w-1.0;
q=w+1.0;
s=sw*w/p/q;
n++;
}
/found/
return s;
}

double fun(int n)
{
int i;
double s=0.0;
for(i=1;i<=n;i++)
s=s+1.0/(i*(i+1));
return s;
}