{
a[num][s1[j]-97]++; }
len=strlen(s2); num++;
for(j=0;j a[num][s2[j]-97]++; } for(p=2;p<=k;p++) { for(j=0;j<26;j++) { a[p][j]=a[p-1][j]+a[p-2][j]; } } for(j=0;j<26;j++) printf(\ printf(\ } return 0; } 1718: #include int a[100]; //下标为分数,值为标记; void main() { int no,n,s,i,cnt,key; while (scanf(\ { for (i=0;i<=100;i++) { a[i]=0; //恢复状态; } while (scanf(\ { if(n==0&&s==0) break; if (n == no) //当学号相等时标记-1,否则标记为1; { key=s; a[s]++; } else a[s]++; } cnt=0; for (i=100;i>=0;i--) { if (a[i]!=0) //从100往下找; { cnt+=a[i]; if (i==key) //找到,退出; { break; } } } printf(\ } } 1720: #include int x,y; while(scanf(\ { printf(\ } return 0; } 1799: #include int i,j,t,m,n; for(i=0;i<2001;i++) { a[i][0]=a[i][i]=1; for(j=1;j a[i][j]=(a[i-1][j-1]+a[i-1][j])07;// 杨辉三角打表 } scanf(\ while(t--) { scanf(\ printf(\ } } 1859: #include return 0; } 1862: #include stu[100010]; int cmp1(const void *a,const void *b) { struct student *c=(struct student *)a; struct student *d=(struct student *)b; return strcmp(c->num,d->num); } int cmp2(const void *a,const void *b) { struct student *c=(struct student *)a; struct student *d=(struct student *)b; if(strcmp(c->name,d->name)) return strcmp(c->name,d->name); else return strcmp(c->num,d->num); } int cmp3(const void *a,const void *b) { struct student *c=(struct student *)a; struct student *d=(struct student *)b; if(c->score!=d->score) return c->score-d->score; else return strcmp(c->num,d->num); } int main() { int i,m,n,k=1; while(scanf(\ { for(i=0;i 1877: #include #include 1898: #include int a,b,t,n; scanf(\ while(n--) { scanf(\ if(t%a==t%b) printf(\ else { if(t%a printf(\ else printf(\ } } return 0; } 1976: #include int a1,a2,a3,b1,b2,b3,i,n; while(scanf(\ { for(i=0;i