if(p!
=i)
{t=a[p].s;a[p].s=a[i].s;a[i].s=t;
for(k=0;k<10;k++)
{h=a[p].num[k];
a[p].num[k]=a[i].num[k];
a[i].num[k]=h;
}
}
}
}
main()
9.
#include
#include
#include
voidfun(inta,intb,long*c)
{
inta_up,a_low,b_up,b_low;
a_up=a/10;
a_low=a%10;
b_up=b/10;
b_low=b%10;
*c=b_low*1000+a_up*100+b_up*10+a_low;
}
voidNONO()
10.#include
#include
#defineN16
typedefstruct
{charnum[10];
ints;
}STREC;
STRECfun(STREC*a,char*b)
{inti,f=0;
STRECp;
p=a[0];
for(i=0;iif(strcmp(a[i].num,b)==0){p=a[i];f=1;}
if(f==0)
{p.num[0]='\0';
p.s=-1;
}
returnp;
}
main()
11.#include
#defineN16
typedefstruct
{charnum[10];
ints;
}STREC;
intfun(STREC*a,STREC*b,intl,inth)
{inti,j=0,k,f=0;
for(i=0;iif((a[i].s>=l)&&(a[i].s<=h))
{for(k=0;k<10;k++)
b[j].num[k]=a[i].num[k];
b[j].s=a[i].s;
j++;
f++;
}
return(f);
}
main()
12.#include
#include
#defineN8
structslist
{doubles;
structslist*next;
};
typedefstructslistSTREC;
doublefun(STREC*h)
{STREC*p;
doubleaver=0;
p=h->next;
while(p!
=0)
{aver=aver+p->s;
p=p->next;
}
aver=aver/N;
returnaver;
}
STREC*creat(double*s)
13.#include
#include
#include
unsignedfun(unsignedw)
{
inti,j,sqr=1;
unsignedresult;
char*str,ch[5];
str=ch;
for(i=1;(i<6)&&(w>=1);i++)
{
str[i-1]='0'+w%10;
w/=10;
}
str[i-1]=0;
result=str[0]-'0';
for(j=1;j{
sqr*=10;
result+=(str[j]-'0')*sqr;
}
returnresult;
}
voidNONO()
14.#include
#include
#include
intfun(int*s,intt,int*k)
{
intmax_integer=0;
inti=0;
max_integer=s[0];
for(i=0;iif(max_integer
max_integer=s[i];
*k=i;
}
}
return*k;
}
voidNONO()
15.#include
#include
longfun(char*p)
{
longn=0;
intflag=0;
while(*p!
='\0'){
if(*p=='-')
flag=1;
elseif(*p=='+')
flag=0;
else
n=n*10+(*p-'0');
p++;
}
if(flag==1)n=-n;
returnn;
}
voidNONO()
16.#include
#include
#include
#defineM100
voidfun(intm,int*a,int*n)
{
inti,count=0;
for(i=1;i<=m;i++){
if(i%7==0||i%11==0){
a[count++]=i;
}
}
*n=count;
}
voidNONO()
17.#include
#include
#include
voidfun(inta[],intn,int*max,int*d)
{
inti,base,subscript;
base=a[0];/*假定第一个元素的值最大*/
subscript=0;/*subscript用于存放数组下标*/
for(i=1;iif(a[i]>base){/*将数组中的其他元素与变量base作比较,如果大于它则交换两者的值*/
subscript=i;
base=a[i];
}
}
*max=base;/*将最大值元素的值赋给*max*/
*d=subscript;/*将最大值元素的下标赋给*d*/
}
voidNONO()
18.#include
#include
#include
#include
voidfun(char*s,chart[])
{
inti,slenth,n=0;
slenth=strlen(s);
for(i=1;it[n++]=s[i];
t[n]='\0';
}
NONO()
19.#include
#include
doublefun(doublex[9])
{inti;
doubleavg=0.0,sum=0.0;
for(i=0;i<8;i++)
{avg=(x[i]+x[i+1])/2;
sum+=sqrt(avg);
}
returnsum;
}
NONO()
20.#include
doublefun(intn)
{inti;
doublesum=0.0;
if(n>1&&n<=100)
{for(i=1;i<=n;i++)
sum+=1.0/(2*i-1)-1.0/(2*i);
}
returnsum;
}
NONO()
21.#include
doublefun(intn)
{inti;
doublesum=0.0;
if(n>0&&n<=100)
{for(i=1;i<=n;i++)
if(i%5==0||i%9==0)
sum+=1.0/i;
}
returnsum;
}
NONO()
22.#include
#include
doublefun(doublex)
{
intn=1;/*循环计数*/
doublesn=1;/*累计数*/
doublexn=1,xn1=0;/*x的n值,以及x的n-1值;*/
while(fabs(xn-xn1)>=0.000001)/*绝对值是否合格*/
{
xn=xn*x*(0.5-n+1)/n;/*表达式分解以后xn=(xn-1)*x*(0.5-n+1)/n*/
n+=1;
sn+=xn;/*sn累加上xn*/
}
return(sn);
}
NONO()
23,#include
#include
doublefun(doublex[10])
{inti;
doubleavg=0.0;
doublesum=0.0;
doubleabs=0.0;
doublefc;
for(i=0;i<10;i++)
sum+=x[i];
avg=sum/10;
for(i=0;i<10;i++)
abs+=(x[i]-avg)*(x[i]-avg);
fc=sqrt(abs/10);
returnfc;
}
NONO()
24.#include
#include
doublefun(intn)
{
inti,j=0;
doubles=0;
for(i=3;i<=n;i++)
{for(j=2;j
if(i%j==0)break;
if(j==i)s=s+sqrt(i);
}
returns;
}
NONO()
25.#include
#include
doublefun(intn)
{inti;
doublefac=1.0;
doublesum=1.0;
if(n>1&&n<=100)
for(i=2;i<=n;i++)
{fac+=sqrt(i);
sum+=fac;
}
returnsum;
}
NONO()
26.#include
#include
#include
#include
#defineN81
voidfun(char*s)
{
inti,length;
chartmp;
length=strlen(s);
for(i=0;i{
tmp=s[i];
s[i]=s[length-i-1];
s[length-i-1]=tmp;
}
}
NONO()
27.#include
#include
#include
voidfun(intarray[3][3])
{inti,j;intb[3][3];
for(i=0;i<3;i++)
for(j=0;j<3;j++)
b[j][i]=array[i][j];
for(i=0;i<3;i++)
for(j=0;j<3;j++)
array[i][j]=b[i][j];
}
NONO()
28.#include
#include
#include
#defineMAX200
intfun(intlim,intaa[MAX])
{inti,j=0,k=0;
for(i=2;i<=lim;i++)
{for(j=2;j
if(i%j==0)break;
if(j==i)aa[k++]=i;
}
returnk;
}
NONO()
29.#include
#include
#include
#defineM4
#defineN5
intfun(inta[M][N])
{
inti,j,sum=0;
for(i=0;ifor(j=0;jif((i==0)||(i==M-1)||(j==0)||(j==N-1))
sum+=a[i][j];
returnsum;
}
NONO()
30.#include
#include
#include
#include
intfun(char*s,intnum)
{inti,j,h,t;
for(i=1;i{h=i;
for(j=i;jif(s[h]
if(h!
=i)
{t=s[h];s[h]=s[i];s[i]=t;}
}
}
NONO()
31.#include
#include
#include
#defineM3
#defineN4
voidfun(inttt[M][N],intpp[N])
{
inti,j,min
for(i=0;i<4;i++)
{
min=tt[0][i];
for(j=0;j<3;j++)
if(min>tt[j][i])
min=tt[j][i];
pp[i]=min;
}
}
NONO()
32.#include
#include
#include
#include
fun(char(*a)[81],intnum,char**max)
{inti;
*max=a[0];
for(i=1;i<=num;i++)
if(strlen(a[i])>strlen(*max))*max=a[i];
}
NONO()
33.#include
#include
#include
#include
intfun(char*str,char*substr)
{unsignedinti=0;
intj,k=0,add;
while(i{j=0;add=i;
while((str[add]==substr[j])&&(substr[j]!
='\0'))
{add++;j++;}
if(substr[j]=='\0')k++;
i++;
}
returnk;
}
NONO()
35.#include
#include
#include
voidfun(intm,int*k,intxx[])
{inti,j;*k=0;
for(i=2;i{for(j=2;j
if(i%j==0)break;
if(j
}
}
NONO()
36.#include
#include
#include
voidfun(charp1[],charp2[])
{char*point1,*point2;
point1=p1;
point2=p2;
while((*point1)!
='\0')point1++;
while(*point2!
='\0'){
*point1=*point2;
point1++;
point2++;
}
*point1='\0';
}
NONO()
37.#include
#include
#include
voidfun(inta[3][3],intb[3][3])
{inti,j;
for(i=0;i<3;i++)
for(j=0;j<3;j++)
b[i][j]=a[i][j]+a[j][i];
}
NONO()
38.#include
#include
#include
#include
intfun(intscore[],intm,intbelow[])
{inttotal=0;
intaverage=0;
int*p_below=