j=i;
max=a[i].s;
}
*s=a[j];
13套:
inti,j;
for(i=0;ifor(j=0;j<=i;j++)
a[i][j]*=n;
14套:
inti,j;
for(i=0;ifor(j=0;j<=i;j++)
a[i][j]=0;
15套:
inti,j,min,k;
for(i=0;imin=tt[0][i];k=0;
for(j=1;jif(min>tt[j][i]){
min=tt[j][i];
k=j;
}
pp[i]=tt[k][i];
}
16套:
if(w>10000)w%=10000;
elseif(w>1000)w%=1000;
elseif(w>100)w%=100;
elseif(w>10)w%=10;
returnw;
17套:
charb[N];
inti=0,j;
memset(b,0,N);
for(j=strlen(s)-1;j>=0;j--)b[i++]=s[j];
strcpy(s,b);
18套:
char*p=s;
inti=0;
while(*p){
if(*p!
=c)s[i++]=*p;
p++;
}
s[i]=0;
19套:
charch;
inti,j;
for(i=1;i<6;i++)
for(j=i+1;j<6;j++){
if(*(s+i)<*(s+j)){
ch=*(s+j);
*(s+j)=*(s+i);
*(s+i)=ch;
}
}
20套:
intcnt=0;
char*p=str,*q;
while(*p){
q=strstr(p,substr);
if(q==NULL)break;
p=q+strlen(substr);
cnt++;
}
returncnt;
21套:
22套:
intcnt=0;
char*p=ss;
while(*p){
if(*p==c)cnt++;
p++;
}
returncnt;
23套
intc[3][3];
inti,j;
for(i=0;i<3;i++)
for(j=0;j<3;j++){
c[i][j]=a[j][i];/*矩阵的转置*/
b[i][j]=a[i][j]+c[i][j];
}
24套
inti;
*n=0;
for(i=7;i<1000;i++)
if(((i%7)==0||(i%11)==0)&&(i%77)!
=0)a[(*n)++]=i;
25套
char*p=tt;
inti;
for(i=0;i<26;i++)pp[i]=0;
while(*p){
if(*p>='a'&&*p<='z')pp[*p-'a']+=1;
p++;
}
26套
strncpy(b,a,n);
b[n]=0;
strcat(b,a+n+1);
27套
inti,j,t;
floats=0;
for(i=1;i<=n;i++){
t=0;
for(j=1;j<=i;j++)t+=j;
s=s+1./t;
}
returns;
28套
floatx0,x1=0.0;
do{
x0=x1;
x1=cos(x0);
}while(fabs(x0-x1)>0.000001);
returnx1;
29套
intf0=0,f1=1,f;
do{
f=f0+f1;
f0=f1;
f1=f;
}while(freturnf;
30套
doubles=0.0;
inti;
for(i=1;i<=m;i++)s+=log(1.0*i);
s=sqrt(s);
returns;