label
stringlengths
1
2
index
stringlengths
1
5
code
stringlengths
87
8.24k
2
800
int main() { int n,book[1000],i,j,countt[26]={0},len,max=-1, maxauthor; char peo[1000][27],sum[100000]="\0",ch; cin >> n; for(i=1;i<=n;i++) { cin >> book[i] >> peo[i]; strcat(sum,peo[i]); } len=strlen(sum); for(i=0;i<len;i++) countt[sum[i]-65]++; for(i=0;i<26;i++) if(countt[i]>max) { max=countt...
2
801
struct{ int location[1001]; int num; int sum; }ans[27]; int main() { int n,value=-1,order,m; char s[28]; cin>>n; for(int i=1;i<=26;i++) { ans[i].num=ans[i].sum=0; } for(int i=1;i<=n;i++) { cin>>m; cin>>s; for(int j=0;j<strlen(s);j++) { ans[s[j]-'A'+1].num++; ans[s[j]-'A'+1].sum++; ans[s[j]...
2
802
struct sa { int a; char b[100]; struct sa *next; }; int n,m,k[27]; struct sa *kao(void) { struct sa *head; struct sa *p1,*p2; n=0; head=NULL; p1=p2=(struct sa *)malloc(len); scanf("%d %s",&p1->a,p1->b); head=p1; for(;;) { n++; if(n==m+1) break; if(n==1) head=p1; else {...
2
803
void main() { struct book { int num; char auth[26]; int inf[26]; struct book *next; }; struct book *head,*p1,*p2,*t1,*t2; head=(struct book *)malloc(sizeof(struct book)); int m,i,k,l,j,max; int authnum[26]={0}; scanf("%d",&m); p1=head; p2=p1; for (i=0;i<(m-1);i++) { scanf("%d %s",&(p1->num),p1->a...
2
804
struct book{ int name; char writer[100]; struct book *next; }; int a[26]; struct book *creat(int n) { struct book *p1,*p2,*xhead; p1=(struct book*)malloc(len); scanf("%d %s",&p1->name,p1->writer); p2=p1; xhead=p1; while(n-1) { n--; p1=(struct book *)malloc(len); scanf("%d %s",&p1->name,p1->writer); ...
2
805
main() { int m,n,j,k,id[1001],a[26]={0}; char c[1001][26],b[26]={'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z'}; scanf("%d",&n); for(j=1;j<=n;j++) {scanf("%d %s",&id[j],&c[j]);} for(m=0;m<26;m++) { for(j=1;j<=n;j++) { ...
2
806
void main() { int i,j,k,n,m,sum=0,min,max,ID[1000]={0},a[26]={0}; char name[1000][26]={""}; scanf("%d",&n); for(i=0;i<n;i++) scanf("%d %s",&ID[i],&name[i]); for(i=0;i<n;i++) for(j=0;j<strlen(name[i]);j++) a[name[i][j]-'A']++; max=a[0]; k=0; for(i=0;i<26;i++) if(a[i]>max){max=a[i];k...
2
807
void main() { int num=0,n,a[26],name[1000],name2[1000],i,j,k,max=0,maxi=0; char wr[1000][27]; char q; scanf("%d",&n); for (i=0;i<26;i++) { a[i]=0; } for(i=0;i<n;i++) { scanf("%d%s",&(name[i]),wr[i]); for (j=0;j<26;j++) { for (k=0;k<26;k++) { if ...
2
808
int main () { int m; cin >> m; char writter[27]; int data[26][1000]; memset(data,0,sizeof(data)); int max = 0; char max_name; for (int i = 1; i <= m; i++){ int number; cin >> number >> writter; for (int j = 0; j < strlen(writter); j++){ data[writter[j...
2
809
struct book { int num; char name[26]; }book[1000]; int judge(char*a,int b); int main(int argc, char* argv[]) { char c; int n=0,i=0,j=0,rec[26]={0},k=0; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d%s",&book[i].num,book[i].name); }//???? for(i=0;i<26;i++)//??i?????? { for(j=0;j<n;j++)//??j????? { if(ju...
2
810
struct stu { int num; char c[26]; struct stu*next; }; struct stu*create(void) { struct stu *p1,*p2,*head; int m; scanf("%d",&m); p1=(struct stu*)malloc(LEN); scanf("%d %s",&p1->num,p1->c); p2=p1; head=p1; while(m-1) { m--; p1=(struct stu*)malloc(LEN); scanf("%d %s",&p1->num,p1->c); p2->next=p1;...
2
811
struct data { int no; char au[10]; }; void main() { struct data lib[1000]; char x; int n,i,j,num[26]={0},l[1000],k,max; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d",&lib[i].no); scanf("%s",lib[i].au); l[i]=strlen(lib[i].au); } for(i=0;i<n;i++) { for(j=0;j<l[i];j++) { num[lib[i].au[j]-65]=num[li...
2
812
struct book { int num; char au[30]; struct book *next; }; void main() { int m; scanf("%d",&m); struct book *p1,*p2,*head; p1=(struct book*)malloc(LEN); scanf("%d %s",&p1->num,p1->au); p2=p1; head=p1; int n=1; while(n<m) { p1=(struct book*)malloc(LEN); scanf("%d %s",&p1->num,p1->au); p2->next=p1; p2=p1; ...
2
813
struct tushu{ int bianhao; char writer[27]; }book[1000]; void jishu(struct tushu *p1,int a[26],int b); int max(int c[26]); void shu(struct tushu *p2,int d,int e); int main(){ int n,i,m; int zimu[26]; struct tushu *pointer; pointer=&book[0]; scanf("%d",&n); for(i=0;i<n;i++){ scanf("%d %s",&book[i].bianhao,&book...
2
814
struct book { int num; char wr[26]; struct book *next; }; void main() { int i,n,m=0,j,a,b,c; int s[100]={0}; scanf("%d",&n); struct book *head,*p1,*p2,*p; p1=p2=(struct book *)malloc(LEN); scanf("%d %s",&p1->num,p1->wr); head=NULL; while(m!=n-1) { m=m+1; if(m==1) head=p1; else p2->next=p1; p2=p1; ...
2
815
int main() { int m,i,j; scanf("%d",&m); struct Bookinfo { int number; char auther[27]; }; struct Bookinfo a[1000]; for (i=0;i<m;i++) scanf("%d %s",&a[i].number,a[i].auther); struct Author { int count; int number[1000]; }; struct Author b[26]; for(i=0;i<26;i++) b[i].count=0; int max,record; ...
2
816
int main() { int m,i,b[26],p,max,j,c; scanf ("%d",&m); struct point { int n; char s[26]; }a[999]; for (i=0;i<m;i++) { scanf ("%d %s",&a[i].n,a[i].s); } for (i=0;i<26;i++) { b[i]=0; } for (i=0;i<m;i++) { for (j=0;a[i].s[j]!='\0';j++) { if (a[i].s[j]=='A') b[0]++; else if (a[i].s[j]...
2
817
struct book { int id; char writer[30]; }book[1200]; int main() { int n,l,t,a[30]; char m; cin>>n; for(int i=0;i<30;i++) a[i]=0; for(int i=0;i<n;i++) { cin>>book[i].id>>book[i].writer; l=strlen(book[i].writer); for(int j=0;j<l;j++) { t=book[i].writer[j]-65; a[t]++; } } t=a[0];l=0; for(int i=0...
2
818
/*????????m?10 ? m ? 999??????????n?2 ? n ? 26? ????????????????m?????????1?999???????????'A'?'Z'?? ??????????????????????????????*/ void main() { int i,j,n,m,x[26]={0},y=0,z; char a[100][4],b[100][10],c; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%s %s",a[i],b[i]); } for(i=0;i<n;i++) { m=strlen(b[i]); fo...
2
819
struct s { long h;//?????????? char z[1000]; struct s *next; }; struct s *create(int n) { struct s *head,*p1,*p2; int i=0; p1=p2=(struct s *)malloc(len); scanf("%ld %s",&p1->h,p1->z);//??????????????????? head=0; while(i<n-1)//??????? { i++; if(i==1) head=p1; else p2->next=p1; p2=p1; p1=(struct s...
2
820
void main() { struct book { int n; char a[26]; }; struct book book[999]; int m,c[26]={0},k; char w[26]; scanf("%d",&m); int i,j,max=0,t; for(i=0;i<m;i++) scanf("%d %s",&book[i].n,book[i].a); for(i=0;i<26;i++) w[i]='A'+i; for(i=0;i<26;i++) for(j=0;j<m;j++) for(k=0;k<26;k++) { if(book[j].a[k]==w[i]) c[i...
2
821
int main() { char m = 0; int cnt[255], i, j, n; struct { int id; char au[32]; } bk[1000]; memset(cnt, 0, sizeof(cnt)); scanf("%d", &n); for (i = 0; i < n; i++) { scanf("%d%s", &bk[i].id, bk[i].au); for (j = 0; bk[i].au[j]; j++) if (++cnt[bk[i...
2
822
struct book { int id; char author[26]; }; int main() { struct book b[999]; int a[26]; int m,i,j,max,maxauthor; char c; scanf("%d",&m); for (i=0;i<m;i++) { scanf("%d %s",&b[i].id,b[i].author); } for (i=0;i<26;i++) { a[i]=0; } for (i=0;i<m;i++) { for (j=0;b[i].author[j]!='\0';j++) { c=b[i].auth...
2
823
struct book { int id; char writer[26]; int length; }zz[999]; int main() { int n,i,j,k; int letter[26]={0}; int letter_book[26][999]={0}; cin>>n; for ( i = 0 ; i < n; i ++ ) { cin>>zz[i].id; cin>>zz[i].writer; zz[i].length=strlen(zz[i].writer); } for ( j = 0 ; j < n ; j ++ ) { for ( k = 0 ; k < zz[j...
2
824
int n=1,m; struct zuozhe {int num; char ren[26]; struct zuozhe *next; }; struct zuozhe *ap() { struct zuozhe * head,*nw,*tn; do { nw=(struct zuozhe *)malloc(sizeof(struct zuozhe)); scanf("%d%s",&nw->num ,nw->ren ); if(n==1) { head=nw; tn=head; } else tn->next=nw; if(n<=m) { tn=nw; n++;...
2
825
//???? int main() { int a,s[26][1000],m,i,j,author,max=0;//a???? char b[1000][28];//??? for (i=0;i<26;i++) s[i][0]=0; cin>>m; for (i=0;i<m;i++) { cin>>a; cin>>b[a]; for (j=0;b[a][j]!='\0';j++) { s[b[a][j]-'A'][0]++;//??????+1 s[b[a][j]-'A'][s[b[a][j]-'A'][0]]=a;//?????? } } for (i=0;i<26;i++) ...
2
826
struct info { int num; char author[30]; struct info *next; }; struct info*create(int n) { struct info *p1,*p2,*head; int i; p1=(struct info*)malloc(sizeof(struct info)); scanf("%d%s",&p1->num,p1->author); p1->next=NULL; p2=p1; head=p1; i=1; while(i<n) { p1=(struct info*)malloc(sizeof(struct info)); scanf("%d%s"...
2
827
struct data{ int code; char author[20]; }; struct letter{ char let; int count; }; int main() { int n,i,j,k,t,max; struct data a[100]; struct letter l[26]; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d",&a[i].code); gets(a[i].author); } for(i=0;i<26;i++) { l[i].let=i+65; l[i].count=0; } for(i=0;...
2
828
void main() { int max(int b[26]); int n,a[100]={0},b[26]={0},i,j,m; char zuo[26]={"ABCDEFGHIJKLMNOPQRSTUVWXYZ"}; char shu[100][10]={0},c; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d %s",&a[i],shu[i]); } for(i=0;i<26;i++) { for(j=0;j<n;j++) { if(strchr(shu[j],zuo[i])) b[i]=b[i]+1; } } m=max(b); ...
2
829
struct book { int num; char author[26]; }; int main() { int n; scanf("%d\n",&n); int i; struct book book[1000]; for(i=0;i<n;i++) { scanf("%d %s",&book[i].num,book[i].author); } int b[26]={0}; for(i=0;i<n;i++) { int l; l=strlen(book[i].author); int j; for(j=0;j<l;j++) { b[book[i].author[j]-...
2
830
struct BOOK { int num; char author[26]; }; char maxbook(int a[]) { int i,j,bookmax=0; for(i=0;i<26;i++){ if(bookmax<a[i]){ bookmax=a[i]; j=i; } } printf("%c\n%d\n",'A'+j,bookmax); return 'A'+j; } int contain(char author[],char max) { char *c=author; while(*c){ if(*c==max) return 1; c++; } re...
2
831
int main() { int m ; cin >> m ; int p ; char a[m+1][27]; int len[m +1]; int b[m+1]; int c[26]; int i , j , k ,l ; for( i = 0 ;i <=25 ; i++ ) c[i] = 0 ; for( i = 1 ; i <= m ; i ++ ) { cin >> b[i]; cin >> a[i] ; len[i] = strlen(a[i]);...
2
832
struct a { int book; char author[26]; struct a *next; }; struct a *creat(int m) { int i=0; struct a *p,*head,*temp; head=NULL; do { p=(struct a *)malloc(sizeof(struct a)); if(p==NULL){ exit(1); } scanf("%d %s",&p->book,p->author); if(head==NULL){ head=p; temp=p;} else{ temp->next=p...
2
833
int main() { int b[26]={0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0}; int m,i,j,k,num[10000],max=0,t=0; char a[10000][26]; char c[26]={'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z'}; scanf("%d",&m); for(i=0;i<m;i++) { scanf("%d",&num[i]); scan...
2
834
struct student { char number[100]; char name[100]; struct student*next; }; int n; struct student*creat(void) { struct student *head; struct student *p1,*p2; int i=0; p1=p2=(struct student*)malloc(LEN); scanf("%s %s",&p1->number,&p1->name); head=NULL; do { i=i+1; if(i==1)head=p1;else p2->next=p1; p2=...
2
835
int main() { int m,i,j,k,q=0,t=0,u,max; int b[26]={0}; char c[]="ABCDEFGHIJKLMNOPQRSTUVWXYZ"; struct as{ int sh; char a[26]; }cla[1000]; scanf("%d",&m); for(i=0;i<m;i++){ scanf("%d %s",&cla[i].sh,cla[i].a); t=(int)strlen(cla[i].a); for(k=0;k<t;k++){ u=cla[i].a[k]-'A'; b[u]++; }...
2
836
struct book { int num; char author[26]; struct book *next; }; void main() { int m,i,j,l,max,maxi;int n[26]={0}; struct book *head,*p1,*p2;char *p; scanf("%d",&m); i=0; p1=p2=(struct book *)malloc(LEN); scanf("%d %s",&p1->num,p1->author); head=NULL; while(i<m) { i++; if(i==1) head=p1; else p2->ne...
2
837
struct su { int a; char b[26]; struct su *next; }; int main() { int n,c[26]={0},i,k,j,l,max,m; struct su *p,*head,*q; scanf("%d",&n); for(i=0;i<n;i++) { p=(struct su *)malloc(sizeof(struct su)); if(i==0) {head=p; q=p; scanf("%d %s",&p->a,p->b); k=strlen(p->b); for(j=0;j<k;j++) { ...
2
838
int main() { int n,i,j,k,max; char name[2000][30],alp[27]={"ABCDEFGHIJKLMNOPQRSTUVWXYZ"}; int No[2000],num[30]={0}; scanf("%d",&n); for(i=0;i<n;i++){ scanf("%d %s",&No[i],name[i]); } for(i=0;i<26;i++){ for(k=0;k<n;k++){ for(j=0;j<strlen(name[...
2
839
int main() {struct book{ int num; char s[26]; }b[1000]; struct author{ int n[1000]; int p; char c; }a[26],e; int i,j,k,m,q,max; char d; for(i=0;i<26;i++) a[i].p=0; for(i=0,d='A';i<26;i++,d++) {a[i].c=d;} scanf("%d",&m); for(i=0;i<m;i++) {scanf("%d%s",&b[i].num,b[i].s);} for(i=0;i<m;i++) {for(j=0;;j++) {if(b[i].s...
2
840
void main() { int n,i,j,k,a[1000],max=0,t,p[26]={0}; char c[1000][27],d,l[26]={'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z'}; scanf("%d",&n); for(i=0;i<n;i++) scanf("%d %s",&a[i],c[i]); for(i=0;i<n;i++) for(j=0;j<strlen(c[i]);j++) for(k=0;k<26;k++){...
2
841
int main() { int n,i,j,num[1000],l[1000],count[128],m,max; char edi[1000][26],au[128]; scanf("%d",&n); for(j=0;j<n;j++) { scanf("\n%d",&num[j]); gets(edi[j]); l[j]=strlen(edi[j]); } for(i=0;i<128;i++) count[i]=0; for(j=0;j<n;j++) { for(i=1;i<l[j];i++) { m=edi[j][i]; au[m]=edi[j][i]; count[...
2
842
struct book { int n; char name[26]; struct book *next; }; struct book *head; int m; struct book *creat() {struct book *p1,*p2; int i=0; p1=p2=(struct book*)malloc(LEN); scanf("%d %s",&p1->n,p1->name); head=NULL; while(i<m-1) {i=i+1; if(i==1) head=p1; else p2->next=p1; p2=p1; p1=(struct book*)malloc(LEN...
2
843
struct book { int name; char writer[26]; }; void main() { struct book data[999]; int m,i,j,max=0,b=0; int a[26]={0}; scanf("%d",&m); for(i=0;i<m;i++) scanf("%d %s",&data[i].name,data[i].writer); for(i=0;i<m;i++) for(j=0;j<strlen(data[i].writer);j++) a[data[i].writer[j]-'A']++; for(i=0;i<26;i++) ...
2
844
struct author { char name; int count; }aut[26]; int max(struct author a[26]) { int i,max; max=a[0].count; for(i=0;i<26;i++) if(a[i].count>max) max=a[i].count; return(max); } void main() { int m,h=0; scanf("%d",&m); int i,j,n,l[1000],book_name[1000]; char auth...
2
845
void main() { int j,n,i,book,max=0,pos,a[30][1000]={0}; char s[100]; scanf("%d",&n); for (i=0;i<n;i++) { scanf("%d%s",&book,&s); for (j=0;j<strlen(s);j++) { a[s[j]-'A'][0]++; a[s[j]-'A'][a[s[j]-'A'][0]]=book; } } for (i=0;i<26;i++) if (a[i][0]>max) { max=a[i][0]; pos=i; } printf...
2
846
struct book { int num; char name[27]; struct book *next; }; int m; struct book *head; struct book *setup() { int t=0; struct book *head,*p1,*p2; head=p1=p2=(struct book *)malloc(sizeof (struct book)); scanf("%d %s",&p1->num,p1->name); while(t<m-1) { t++...
2
847
int main () { int n,i,j,m,t,g,max; char q; int d[26]; struct { int a; char b[26]; }s[999]; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d%s",&s[i].a,s[i].b); } for(i=0;i<26;i++) { d[i]=0; } for(i=0;i<n;i++) { m=strlen(s[i].b); for(j=0;j<m;j++) { t=s[i].b[j]-'A'; d[t]++; } } max=0; ...
2
848
struct Student {char name[26]; int a; }; int main() { int n,i,k,l,m; char j,t; int b[26]={0}; scanf ("%d",&n); struct Student stu[999]; for (i=0;i<n;i++) { scanf ("%d %s",&stu[i].a,stu[i].name); } for (j='A',k=0;j<='Z';j++,k++) for (i=0;i<n;i++) for (l=0;l<26;l++) if (stu[i].name[l]==j) b[k]++...
2
849
int main() { char mo='A'; int a[ASC]={0}; int i,j,n; struct { int num; char wr[MAX_N+1]; }book[MAX_M]; scanf("%d",&n); for(i=0;i<n;i++) {scanf("%d%s",&book[i].num,book[i].wr); for(j=0;book[i].wr[j];j++) {if(++a[book[i].wr[j]]>a[mo]) mo=book[i].wr[j];} } printf("%c\n%d\n",mo,a[mo]); for(i=0;i<n;i++) if(strch...
2
850
void main() { int n,i,c[26]={0},d[26]={0},j,s,t,k; char b[26000],r,max; scanf("%d\n",&n); struct book { int num; char author[26]; }a[999]; for(i=0;i<n;i++) scanf("%d %s\n",&a[i].num,&a[i].author); strcpy(b,a[0].author); for(i=1;i<n;i++) strcat(b,a[i].author); s=strlen(b); for(r='A',j=0;r<='Z',j<26;r++...
2
851
void main() { int n,i,j,t[26]={0},k=0,max,h; scanf("%d",&n); struct book { int a; char b[26]; }book[100]={0,""}; for(i=0;i<n;i++) { scanf("%d%s",&book[i].a,book[i].b); } for(i=0;i<n;i++) { k=strlen(book[i].b); for(j=0;j<k;j++) { t[book[i].b[j]-65]++; } } max=0; for(i=0;i<26;i++) {...
2
852
int main() { int n; int i,j,k; int max,max2; int a[26]; struct book { int number; char author[26]; }stu1[1000]; struct author { int number[1000]; int ben; }stu2[26]; scanf("%d",&n); for(i=0;i<=n-1;i++) sca...
2
853
void main() { int n,i; scanf("%d",&n); int b[1000]; char s[1000][26]; for(i=0;i<n;i++) { scanf("%d%s",&b[i],&s[i]); } int a[26]={0}; char c[26]={'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z'}; for(i=0;i<n;i++) { int l,j; l=strlen(s[i]); for(j=...
2
854
int main() { int n; cin >> n; int number[n+1]; int writer[26] = {0}; char book[n+1][27]; for(int i = 1; i <= n; ++i) { cin >> number[i] >> book[i]; for(int t = 0; t < strlen(book[i]); ++t) { writer[book[i][t] -'A']++; } ...
2
855
int main(){ int n,i,j,max=0,b[1000],p[26]; char *bm[1000]; scanf("%d",&n); for(i=0;i<26;i++) p[i]=0; for(i=0;i<n;i++){ scanf("%d",&b[i]); bm[i]=(char *)malloc(26*sizeof(char)); scanf("%s",bm[i]); for(j=0;j<strlen(bm[i]);j++){ p[(int)(*(bm[i]+j)-'A')]++; } } for(i=0;i<26;i++){ if(p[i]>p[max]) max=i; } printf(...
2
856
int main() { int m,len[1000],sum[26]={0},max,i,j,i0; scanf("%d",&m); struct book{ int num; char wri[27]; }book[1000]; for(i=0;i<m;i++){ scanf("%d %s",&book[i].num,book[i].wri); len[i]=strlen(book[i].wri); } for(i=0;i<m;i++) for(j=0;j<len[i];j++) sum[book[i].wri[j]-65]++; max=sum[0]; i0=0; for(i=1...
2
857
struct author{ char num[4]; char str[27]; }; int main(int argc, char* argv[]) { int m,i,j,zimu[26]={0},x,max; char p; scanf("%d",&m); struct author *auth=(struct author *)malloc(sizeof(struct author)*m); for(i=0;i<m;i++){ scanf("%s %s",auth[i].num,auth[i].str); } for(i=0;i<m;i++){ for(j=0;j<26;j++){ x...
2
858
int m; struct book { int num; char name[26]; struct book *next; }; struct book *create(void) { struct book *head,*p1,*p2; int i; scanf("%d",&m); p1=(struct book *)malloc(LEN); scanf("%d %s",&p1->num,p1->name); head=NULL; for(i=1;i<m;i++) { if(i==1) head=p1; else p2->next=p1; p2=p1; p1=(struct book *)...
2
859
struct book{ int num; char author[26];}shu[999]; int main(int argc, char* argv[]) { int m,b,i,*p; char c; int writer[26]; char max(int *p); scanf("%d",&m); for(i=0;i<m;i++){ scanf("%d%s",&shu[i].num,shu[i].author);} for(c='A',writer[c-'A']=0;c<='Z';c++){ writer[c-'A']=0; for(i=0;i<m;i++){ for(b=0;shu...
2
860
void main() { int m,num[1000],i,k,l=0,a[26]={0}; char nam[1000][10],j; scanf("%d",&m); for(i=0;i<m;i++) scanf("%d%s",&num[i],nam[i]); for(j='A';j<='Z';j++) for(i=0;i<m;i++) if(strchr(nam[i],j)) a[j-65]++; for(i=0,k=a[0];i<26;i++) if(a[i]>k) { k=a[i]; l=i; } printf("%c\...
2
861
struct student { int num; char zz[20]; struct student *next; }; struct student *New(int n) { struct student *head=NULL; struct student *newp, *thisp; int i=0; do { newp=(struct student*)malloc(sizeof(struct student)); if (newp==NULL) { printf("request failed\n"); exit(-1); } scanf("%d %s",&n...
2
862
struct a{ int n; char s[26]; }b[1000]; int main() { int n,i,j,c[26]={0}; char t; scanf("%d",&n); for (i=0;i<n;i++) { int d,m; scanf("%d%s",&b[i].n,b[i].s); d=strlen(b[i].s); for(m=0;m<d;m++) c[b[i].s[m]-65]+=1; } for(i=0;i<26;i++) { for(j=i+1;j<26;j++) if(c[j]>c[i]) break; if(j==26...
2
863
int main() { int i,j,temp=26,n,p[27]={0}; struct { int a; char s[30]; }t[1000]; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d %s",&t[i].a,t[i].s); for(j=0;j<strlen(t[i].s);j++) { p[t[i].s[j]-'A']++; } } for(i=0;i<26;i++) { if(p[i]>p[temp]) temp=i; } printf("%c\n%d\n",temp+'A',p[temp]); fo...
2
864
struct book { int num; char name[27]; }b[1001]; void main() { int n,i,j,k,d,g[27],e=0,f=0,l; char m,h; scanf("%d",&n); for(i=0;i<n;i++) scanf("%d %s",&b[i].num,b[i].name); m='A'; for(k=0;k<26;k++) { d=0; for(i=0;i<n;i++) { for(j=0;j<26;j++) { if(b[i].name[j]==m) d++; if(b[i].na...
2
865
struct book { int ID; char author[30]; struct book *next; }; int n,max=0; char c; struct book *create() { struct book *head,*p1,*p2; p1=(struct book*)malloc(LEN); scanf("%d %s",&p1->ID,p1->author); head=p1; p2=p1; p1->next=NULL; int i=1; do { if(i==n)break; p1=(struct book*)malloc(LEN); scan...
2
866
int main() {struct book {int m; char au[26];}b[999]; int m,n[26],M=0,i,j; scanf("%d",&m); for(i=0;i<26;i++) n[i]=0; for(i=0;i<m;i++) scanf("%d %s",&b[i].m,b[i].au); for(i=0;i<m;i++) for(j=0;b[i].au[j]!='\0';j++) n[b[i].au[j]-65]++; for(i=1;i<26;i++) if(n[M]<n[i]) M=i; printf("%c\n%d",M+65,n[M]); for(i=0;i<m;i++) for(j=...
2
867
int main() { int n,i,j,d[1000]; char zuo[26]={'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z'}; scanf("%d",&n); char s[1000][26],len; int sum[26]={0},k; for(i=0;i<n;i++) { scanf("%d%s",&d[i],s[i]); len=strlen(s[i]); for(j=0;j<len;j++) { for(k=0;k...
2
868
struct book { int id; char aut[26]; }; int main() { int m,n,i,j,k; int a[27]={0}; struct book cal[1001]; scanf("%d",&m); for(i=0;i<m;i++) { scanf("%d%s",&cal[i].id,cal[i].aut); } for(j=65;j<91;j++) { for(i=0;i<m;i++) { for(k=0;k<27;k++) { if(cal[i].aut[k]==j) a[j-65]++; } } } int max=0,t; ...
2
869
struct book { int id; char s[26]; }a[100]; int main() { int m,i,n,j,k,max,maxnum; int aut1[26]={0},aut2[26][100]={0}; scanf("%d",&m); for(i=0;i<m;i++) { scanf("%d",&a[i].id); gets(a[i].s); n=strlen(a[i].s); for(j=0;j<n;j++) { k=a[i].s[j]-'A'; aut2[k][aut1[k]]=a[i].id; aut1[k]++; } ...
2
870
struct student { long num; char str[27]; struct student *next; }; int n; struct student *creat(int m) { struct student *head; struct student *p1,*p2; n=0; p1=p2=(struct student*)malloc(LEN); scanf("%ld %s",&p1->num,p1->str); head=0; while(p1->num!=0) { n=n+1; if(n==1)head=p1; else p2->next=p1; p2=p1;...
2
871
void main() { struct shu { int bian; char name[26]; }; struct shu a[1000]; int n,i,j,l[1000],b[26]={0},most,good,k; scanf("%d",&n); for(i=0;i<n;i++) scanf("%d%s",&a[i].bian,a[i].name); for(i=0;i<n;i++) l[i]=strlen(a[i].name); for(i=0;i<n;i++) for(j=0;j<l[i];j++) for(k=0;k<26;k++) if(a[i].na...
2
872
void main() { int a[999],m,i,j,c[26],max=0,d,k; scanf("%d\n",&m); for(k=0;k<26;k++) { c[k]=0; } struct books { int num; char name[26]; } books[999]; for(i=0;i<m;i++) { scanf("%d %s",&books[i].num,books[i].name); } for(i=0;i<m;i++) { for(j=0;j<strlen(books[i].name);j++) { c[books[i].name[j]-'A']++; } } for(k=0;k<26;k++)...
2
873
void main() { int m,t,len,a[26][MAX]={0},n[26]={0},max=0,num; int i,j; char s[27]; scanf("%d",&m); for(i=0;i<m;i++){ scanf("%d %s",&t,s); len=strlen(s); for(j=0;j<len;j++){ n[s[j]-65]++; a[s[j]-65][i]=t; } } for(j=0;j<26;j++){ if(n[j]>max){ max=n[j]; num=j; } } printf("%c\n%d\n",num...
2
874
int main() { int m,i,j,x,maxnumber; scanf("%d",&m); int booknum[1000]; char k[1000][30]; int author[27]={0}; for(i=1;i<=m;i++) { scanf("%d %s",&booknum[i],k[i]); for(j=0;k[i][j]!='\0';j++) { author[k[i][j]-'A'+1]++; } } int max=0; for(i=1;i<=26;i++) { if(author[...
2
875
struct book { int a; char b[30]; struct book *next; }; void main() { int m,i,j,k,mid,l=0; int d[26],e[26]; char c[27]="ABCDEFGHIJKLMNOPQRSTUVWXYZ"; struct book *head,*p1,*p2; scanf("%d",&m); head=p1=p2=(struct book *)malloc(LEN); for(i=0;i<m;i++) { scanf("%d %s",&p1->a,p1->b); p1=(struct book *)malloc(LE...
2
876
char zimu[28]="ABCDEFGJIJKLMNOPQRSTUVWXYZ"; char writer[10000][10000]; int times[26],id[1000],i,len[10000],book=0; int n,j,k,tmax,max=0; int main() { scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d%s",&id[i],&writer[i]); len[i]=strlen(writer[i]); } for(i=0;i<26;i++) { times[i]=0; } for(i=0;i<n;i++) { ...
2
877
struct book { char name[20]; int num; struct book *next; }; struct book *creat(int m) { int i; struct book *head,*p1,*p2; p1=(struct book *)malloc(len); scanf("%d",&p1->num); scanf("%s",p1->name); p1->next=null; head=p1; p2=p1; for(i=1;i<m;i++) { p1=(struct book *)malloc(len);...
2
878
void main() { char a[1000][100]; int b[1000],c[27],s[1000],max,i,j,k; int n; scanf("%d",&n); for (i=0;i<n;i++) { scanf("%d %s",&b[i],a[i]); s[i]=strlen(a[i]); } for (j=0;j<26;j++) { c[j]=0; for (i=0;i<n;i++) { for (k=0;k<s[i];k++) { if (a[i][k]==65+j) c[j]=c[j]+1; } } } max=0; ...
2
879
struct inf { int num; char wri[27]; struct inf *next; }; void main() { int n,i,time[26]={0}; //for(i=0;i<26;i++) // printf("%d",time[i]); char *pn; struct inf *head,*p1,*p0,*p; scanf("%d",&n); p1 = head = (struct inf*)malloc(sizeof(struct inf)); for (i=0;i<n;i++) { p0 = (struct inf*)malloc(sizeof(stru...
2
880
void main() { int m,i,j,temp,max; char a[1000][10],b[1000][20],w; int c[26]; scanf("%d",&m); for(i=0;i<26;i++) c[i]=0; for(i=0;i<m;i++) { scanf("%s %s",a[i],b[i]); } for(i=0;i<m;i++) { for(j=0;j<strlen(b[i]);j++) { if(b[i][j]=='A') c[0]++; if(b[i][j]=='B') c[1]++; if(b[i][j]=='C') c[...
2
881
struct student { int num; char name[20]; struct student* next; }; struct student*creat(int n) { struct student*p1,*p2,*head; int i; p1=p2=(struct student*)malloc(len); head=NULL; i=0; while(i<n) { scanf("%d %s",&p1->num, p1->name); i=i+1; if(i==1) head=p1; else p2->next=p1; p2=p1; p1...
2
882
struct book { int mark; char name[26]; }; int main() { int m,h,i,j,k,max,length; int t[26]; char a; scanf("%d",&m); struct book book[1000]; for(i=0;i<m;i++) { scanf("%d%s",&book[i].mark,book[i].name); } for(i=0;i<26;i++) { a='A'+i; t[i]=0; for(j=0;j<m;j++) { length=strlen(book[i].na...
2
883
struct { char z[30]; int n; }s[1000]; struct { int name; int nb,b[1000],k; }r[93]; int main() { int m,i,j,l,q; for(i=65;i<=90;i++) { r[i].name=i; r[i].k=1; } scanf("%d",&m); for(i=1;i<=m;i++) { scanf("%d %s",&s[i].n,s[i].z); l=strlen(s[i].z); for(j=0;j<l;j++) { q=s[i].z[j]; r[q...
2
884
int main(int argc, char* argv[]) { int n; scanf("%d",&n); struct{ int a; char s[26]; }zuozhe[1000]; int i, k; for(i=0;i<n;i++){ scanf("%d %s",&zuozhe[i].a, zuozhe[i].s); } int c[26]={0}, d; for(i=0;i<n;i++){ d=strlen(zuozhe[i].s); for(k=0;k<d;k++){ c[zuozhe[i].s[k]-65]++; } } int f; for(i=1;...
2
885
int main() { int n; int i, j; int book_number[26]; int max = 0; int max_n; int author_len; struct data { int number; char author[27]; }input[1000]; scanf("%d", &n); for(j = 0; j <= 25; j++) book_number[j] = 0; for(i = ...
2
886
struct author { int num; char aut[27]; }a[999]; void main() { void search(struct author b[],int n,char marker); int m ,i,times[30]={0}; int length=0,j; int max=0,flag=9; char chac; scanf("%d",&m); // printf("%d",m); for(i=0;i<m;i++) { scanf("%d %s",&a[i].num,&a[i].aut); // printf("%d %s",a[i].num,a[i].aut...
2
887
struct book { int num; char name[20]; struct book *next; }; int i,j,n,t,number[100],m; struct book *creat(void) { struct book *p1,*p2,*head; p1=p2=(struct book *)malloc(LEN); scanf("%d %s",&p1->num,p1->name); head=NULL; for(i=1;i<m;i++) { if(i==1) head=p1; else p2->next=p1; p2=p1; p1=(struct b...
2
888
int main() { int m,n=0,book[1000],num[26]={0}; char name[1000][10]; cin>>m; for(int i=1;i<=m;i++) { cin>>book[i]>>name[i]; } for(char z='A';z<='Z';z++) { for(int i=1;i<=m;i++) { for(int j=0;j<10;j++) if(name[i][j]==z)num[z-'A']++; } } int max=0,k=0; for(int i=0;i<26;i++) { if(max<num[i]){max=...
2
889
struct { int no; char wr[26]; }book[999]; struct { char name; int num; int book[999]; }a[26]; int main() { int n,m,t,k,d; int all=0; for (t=0;t<26;t++) { a[t].name='A'+t; a[t].num=0; } scanf("%d",&m); for (t=0;t<m;t++) { scanf("%d %s",&book[t].no,book[t].wr); } for (t=0;t<m;t++) { k=strlen(...
2
890
struct book { int num; char name[27]; struct book *next; }; struct book *creat(int n) { struct book *head,*p1,*p2; int m=0; head=p1=p2=NULL; p1=p2=(struct book *)malloc(sizeof(struct book)); scanf("%d %s",&p1->num,p1->name); while(1) { m+=1; if(m>=n)break; if(m==1)head=p1; else p2->next=p1; p2=p1; ...
2
891
int trans(char k) { int i; char a[26]={'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z'}; for(i=0;i<26;i++) { if(k==a[i]) return i; } } int main() { struct books { int n; char w[27]; }*m; int num,i,j; scanf("%d",&num); m=(struct books*)malloc(si...
2
892
int main() { int n,a[999],i,k[27]={0},j,t,m; char b[999][27]; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d %s",&a[i],b[i]); for(j=0;b[i][j];j++) k[b[i][j]-65]++; } t=k[0];m=0; for(j=0;j<26;j++) { if(k[j]>t) {t=k[j];m=j;} } printf("%c\n%d\n",m+6...
2
893
void main() { struct book{ int num; char str[30]; }bk[1000]={0}; int i,j,m,n,sum[100]={0},number[1000]={0},result,max=0; char temp='A'; scanf("%d",&m); for(i=0;i<m;i++) scanf("%d %s",&bk[i].num,&bk[i].str); for(i=65;i<=90;i++){ for(j=0;j<m;j++){ for(n=0;n<26;n++) if(bk[j].str[n]==i) sum[i]++;...
2
894
int main() { struct fy{ int x; char y[26]; int s[26]; struct fy *z; }sl[1000],*p; int n,i,j,b[26]={0}; char a[100]; p=&sl[0]; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d %s",&sl[i].x,sl[i].y); for(j=0;j<strlen(sl[i].y);j++) { sl[i].s[sl[i].y[j]-'A']=1; b[sl[i].y[j]-'A']++; } sl[i].z=&sl...
2
895
int main() { int maxc=0,i,j,n,a[1000],c; char maxp,b[1000][27],p; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d%s",&a[i],b[i]); } for (p='A';p<='Z';p++) { c=0; for(i=0;i<n;i++) { for(j=0;;j++) { if(b[i][j]=='\0') b...
2
896
struct book { int no; char author[26]; }ji[1000]; main() { int n,i,j,len,a[26][1000],e,b[26]={0},max=0; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d%s",&ji[i].no,ji[i].author); len=strlen(ji[i].author); for(j=0;j<len;j++) { e=ji[i].author[j]; e=e-65; a[e][b[e]]=ji[i].no; b[e]=b[e]+1; } } ...
2
897
int main() {int m, i, j, b[999], n[26], t[2]={0}, x=0; char a[999][26], au; scanf("%d",&m); for(i=0;i<m;i++) {scanf("%d%s",&b[i],a[i]);} for(i=0;i<m;i++) { for(j=0;j<(int)strlen(a[i]);j++) {n[(int)a[i][j]-65]++;} } for(i=0;i<26;i++) { if(t[0]<n[i]) {t[0]=n[i],t[1]=i;} } au=t[1]+65; printf("%c\n%d\n",au,t[0]); for(...
2
898
struct A { char num[1000]; char B[27]; }; void main() { int n,i,a,k,t; int sb[27]={0}; int sb2[27]={0}; char x; scanf("%d",&n); struct A book[999]={0}; for (i=0;i<n;i++) { scanf("%s%s",book[i].num,book[i].B); } for(i=0;i<n;i++) { for(k=0; ;k++) { a=book[i].B[k]; if (book[i].B[k]<='Z'&&book[i]...
2
899
struct book { int num; char auth[26]; struct book *next; }; struct book *creat(int m) { int i=0; struct book *head,*p1,*p2; if(i==0) { p1=(struct book*)malloc(sizeof(struct book)); scanf("%d %s",&p1->num,p1->auth); head=p1; p2=p1; p1->next=NULL; i++; } while(i<m) { p1=(struct book*)malloc(sizeof...