label
stringlengths
1
2
index
stringlengths
1
5
code
stringlengths
87
8.24k
2
700
struct zuozhe { int m; char q; char shu[1001][5]; }zuozhe[26],t; int main() { int n; cin>>n; int i; char xingming[30]; char bianhao[5]; char zimu[27]="ABCDEFGHIJKLMNOPQRSTUVWXYZ"; for(i=0;i<26;i++) ...
2
701
struct information { int num; char author[26]; }*a; void main() { int n,i,j,m,s[26]={0},max=0,p; scanf("%d",&n); a=(struct information *)malloc(sizeof(struct information)*n); for(i=0;i<n;i++) scanf("%d%s",&a[i].num,a[i].author); for(i=0;i<n;i++) { for(j=0;a[i].author[j]!='\0';j++) { m=a[i].author[j]-'A';...
2
702
struct book { char number[20]; char name[26]; }books[1000]; main() { int n,i,j;int count[26]={0};int temp,base,k=0;char author;int pd=0,N=0; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%s %s",&books[i].number,&books[i].name); } for(i=0;i<n;i...
2
703
int main() { int n,i,j; scanf("%d",&n); struct book{ short int a; char s[27]; }b[999]; short int q[26]={0}; short int w[26]={0},p,t,m; for(i=0;i<n;i++) { scanf("%d %s",&b[i].a,b[i].s); } for(i=0;i<n;i++) for(j=0;b[i].s[j]!='\0';j++) { p=(int)b[i].s[j]-65; q[p]++; w[p]++; } for(i=0;i<2...
2
704
void main() { int i,n,j,t,m,a[26]={0},book[999],max; char writer[999][26],maxwriter; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d %s",&book[i],writer[i]); m=strlen(writer[i]); for(j=0;j<m;j++) { t=writer[i][j]-'A'; a[t]++; } } max=0; maxwriter='A'; for(i=0;i<26;i++) { if(a[i]>max) { ...
2
705
struct aut { char name; int num; int id[1000]; }; struct aut author[26]; int main() { int m,i,j,ID,max=0,maxauthor,k[26]={0}; char c[27]; scanf("%d",&m); for(i=0;i<26;i++){ author[i].name='A'+i; author[i].num=0; } for(i=0;i<m;i++){ scanf("%d %s",&ID,c); for(j=0;c[j];j++){ author[c[j]-'A'].id[k[c[...
2
706
struct book { int num; char name[20]; }; void main() { struct book c[1000]; int i,j,n,k,max,l,d[26],a; int b[26]={0}; scanf("%d",&n); for(k=0;k<n;k++) { scanf("%d %s",&c[k].num,c[k].name); for(i=0;i<strlen(c[k].name);i++) { for(j=0;j<26;j++) { if('A'+j==c[k].name[i]) break; } b[j]=b[j]+1...
2
707
int alpha[26]={0}; struct library { int num; char authors[27]; }books[999]; void addauthor(char string[]) { int i=0; do { alpha[string[i]-'A']++; i++; } while(string[i]!='\0'); } void hewroteit(struct library book,int maxalpha) { int i; for(i=0;book.authors[i]!='\0';i++) { if(book.authors[i]-'A'==maxalpha)...
2
708
int num[1000]; char auth[1000][26]; int main() { int m,i,l; scanf("%d",&m); char c='A'; int k=0; int a[26]; for(i=0;i<26;i++) a[i]=0; for (i=0;i<m;i++) { scanf("%d",&num[i]); scanf("%s",auth[i]); int j=0; while(auth[i][j]!='\0') { a[auth[i][j]-64]++; j++; } } for(i=0;i<25;i++) { if (...
2
709
void main() { int s=0,n,i,j,b[26]={0},t,x,m,q; char a[1000][27]; scanf("%d\n",&n); for(i=0;i<n;i++) { gets(a[i]); } for(i=0;i<n;i++) { t=strlen(a[i]); for(j=4;j<t;j++) { x=a[i][j]; b[x-65]=b[x-65]+1; } } for(i=0;i<26;i++) { if(b[i]>s) {s=b[i];x=i;} } printf("%c\n",x+65); printf("...
2
710
main() { int n,i,a,t,d[26]={0},f=0,c,h,e=0; struct book { int N; char name[20]; }p[1000]; scanf("%d",&n); for(i=0;i<=n-1;i++) scanf("%d %s",&p[i].N,p[i].name); for(i=0;i<=n-1;i++) { a=strlen(p[i].name); for(t=0;t<=a-1;t++) { c=p[i].name[t]-'A'; d[c]++; } } for(i=0;i<=25;i++)...
2
711
struct student{ char name[27]; int anum; int num; struct student *next; }; int n; int i; char c; struct student *creat() { struct student *head; head=(struct student *)malloc(LEN); if(n==0) head=NULL; else { scanf("%d",&head->num); for(i=0;(c=getchar())!='\n';i++) { head->name[i]=c; } head->an...
2
712
int main() { int booknumber; int order[1000]; char author[1000][27]; char single_author[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'}; int author_booknumber[26]={0}; int i,j,k; int tmp; scanf("%d",&booknumber); for(i=0;i<booknumber;i++) { sc...
2
713
int main(){ struct book { char z[27]; int no; }; struct book a[1000]; int m, i, x, p, j ; scanf("%d", &m); for (i=0; i<m; i++){ scanf("%d%s", &a[i].no, a[i].z); } int memo[26]={0}; for (i=0; i<...
2
714
int main() { struct book { int No; char name[27]; }b[1000]; int i,j,m; scanf("%d",&m); printf("\n"); for(i=0;i<m;i++){ scanf("%d ",&b[i].No); scanf("%s",b[i].name); } int n,l,a[26]={0}; for(i=0;i<m;i++){ l=strlen(b[i].name); for(j=0;j<l;j+...
2
715
struct person{ int num; int book[1000]; }; struct person p[26]; int n,m,i,j,k; char str[30]; int main(){ memset(p,0,sizeof(p)); scanf("%d",&n); for(i=0;i<n;i++){ scanf("%d%s",&m,str); for(j=strlen(str)-1;j>=0;j--) if(str[j]>='A'&&str[j]<='Z'){ k=p[str[j]-'...
2
716
void main() { int *p; p=(int *)malloc(26*sizeof(int)); struct book { int num; char s[26]; }b[999]; int n,i,j,ss,max=0,r; char x; for(ss=0;ss<26;ss++) *(p+ss)=0; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d %s",&b[i].num,b[i].s); for(j=0;b[i].s[j]!='\0';j++) { *(p+((int)b[i].s[j]-...
2
717
int main(int argc, char* argv[]) { struct book{ int num; char author[27]; }B[1000]; char A; int m,i,j,a[26]={0},max; scanf("%d",&m); for(i=0;i<m;i++){ scanf("%d%s",&B[i].num,B[i].author); } for(i=0;i<m;i++){ for(j=0;;j++){ if(B[i].author[j]==0) break; else a[B[i].author[j]-65]++; } } ...
2
718
struct book { char writer[32]; int id; struct book *next; }; struct book *create(int m) { struct book *head=NULL,*p1,*p2; int i; p1=p2=(struct book*)malloc(Len); scanf("%d %s",&p1->id,p1->writer); p1->next=NULL; head=p1; p2=p1; for(i=1;i<m;i++) { p...
2
719
struct books { int num; char author[27]; }book[999]; void main() { int f(struct books *p,int n,char z); int i,n,j,x[26],k,max; char z; scanf("%d",&n); for(i=0;i<n;i++)scanf("%d%s",&book[i].num,book[i].author); for(z='A',i=0;z<='Z';z++,i++)x[i]=f(book,n,z); for(i=1,max=x[0],k=0;i<26;i++)if(x[i]>max){max=x[i]...
2
720
struct book {int num; char w[26]; }b[999]; void main() { int m,i,j,k,e; scanf("%d",&m); for(i=0;i<m;i++) scanf("%d %s",&b[i].num,b[i].w); 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'}; int c[26]={0}; for(j=0;j<26;j++) {for(i=0;i<m;i++)...
2
721
struct {int no; char wri[27]; } book[1000]; void main() { int n,i,j,k=0,a[26]={0}; scanf("%d",&n); for(i=0;i<n;i++) scanf("%d %s",&book[i].no,book[i].wri); for(i=0;i<n;i++) for(j=0;book[i].wri[j]!='\0';j++) a[book[i].wri[j]-'A']++; for(i=0;i<26;i++) if(a[i]>a[0]){a[0]=a[i];k=i;} printf("%c\n%d\n",'A'+...
2
722
struct book { int num; char writer[20]; struct book *next; }; int main() { int n,i,j,m,k,c[26],max;//c[26]???????????// char a[26];//a[26]??????// scanf("%d",&m); struct book *p1,*p2,*head; for(i=0;i<m;i++) { p1=(struct book*)malloc(Len); if(i==0) { head=p1; } else { p2->next=p1; } p2=p1;...
2
723
void main() { char s[400][400],t[400][400]; int n,m,i,j,k,l,p,y,z; char c; int a[30]; scanf("%d",&n); for(i=1;i<=n;i++) scanf("%s%s",t[i],s[i]); j=0; for(c=65;c<91;c++) { p=0; for(k=1;k<=n;k++) { l=strlen(s[k]); for(m=0;m<l;m++) { if(s[k][m]==c) p++; } } a[j]=p; j++; } for(...
2
724
int main(){ struct book{ int num; char name[26]; }; int n,i,j,a[26]={0},len[1000],k,max=0; struct book list[1000]; scanf("%d",&n); for(i=0;i<n;i++){ scanf("%d",&list[i].num); scanf("%s",list[i].name); len[i]=strlen(list[i].name); } for(i=0;i<26;i++...
2
725
struct book { int num; char w[100]; }book[100]; void main() { int i,j,k,l,m,n,p,b[26]={0}; scanf ("%d\n",&n); for (i=0;i<n;i++) { scanf ("%d %s",&book[i].num,book[i].w); } for (i=0;i<n;i++) { for (j=0;book[i].w[j]!='\0';j++) { if (book[i].w[j]=='A') b[0]++; else if (book[i].w[j]=='B') b[1]++...
2
726
int main() { int n,i,j,k; scanf("%d\n",&n); struct book { int num; char name[26]; }book[999]; for(i=0;i<n;i++) { scanf("%d %s\n",&book[i].num,book[i].name); } struct author { char l; int count; }au[26]; for(i=0;i<26;i++) { au[i].l=65+i; ...
2
727
struct book { int num; char *name; struct book *next; } main() { int n,i; scanf("%d",&n); struct book *p1,*p2,*head; p1=len; head=p1; for(i=0;i<n;i++) { p1->name=(char *)malloc(26*1); scanf("%d %s",&p1->num,p1->name); p2=len; p1->next=p2; p1=p2; } p1=p2=head; int *a; a=(int *)malloc(26*4); fo...
2
728
struct book { int num; char author[27]; }book[1000]; void main() { int m,i,j,k; char s[26]; int w[26]={0}; int len[1000]; int max,most; scanf("%d",&m); for(i=0;i<m;i++) { scanf("%d %s",&book[i].num,book[i].author); } for(i=0;i<26;i++) { s[i]='A'+i; } for(i=0;i<m;i++) { len[i]=strlen(book[i].autho...
2
729
int main() { int n;char name[1000][26];int num[1000]; int i,j;char 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(i=0;i<n;i++) { scanf("%d%s",&num[i],name[i]); } int a[26]={0};char k; for(i=0;i<n;i++) { for(j=0;(k=name[i]...
2
730
void main() { int n,m,i,j,k,t,max=0; int a[1000],b[26]={0}; char s[1000][30]; char c; scanf("%d",&n); for(i=0;i<n;i++) scanf("%d %s",&a[i],s[i]); for(i=0;i<n;i++) { m=strlen(s[i]); for(j=0;j<m;j++) { t=s[i][j]-65; b[t]++; } } for(i=0;i<26;i++) if(b[i]>=max) max=b[i]; for(i=0;i<26;i++) { if(b[i]==m...
2
731
struct book { int num; char name[27]; }; int main() { int n,i,j,l,sum[26],t=0,T=0;struct book a[1000];memset(sum,0,sizeof(sum));char A; cin >> n; for(i=0;i<n;i++) { cin >> a[i].num >> a[i].name; l=strlen(a[i].name); for(j=0;j<l;j++) { sum[a[i].name[j]-'A']++; } } for(i=0;i<26;i++) { if(sum[i]>t)...
2
732
struct book { int id; char str[27]; }bo[1000]; struct people { int name; int number; int book_number[1000]; }people[26]; int main ( ) { int n, i, j, k, m, max = 0; char a[27] = {'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','\0'}; cin >> n; for(i = 0;i ...
2
733
main(){ int i, sum[26]={0}, m, j, max=0, p; struct book{ int num; char au[27]; int l; }; struct book bk[1000]; scanf("%d", &m); for(i=0; i<m; i++){ scanf("%d %s", &bk[i].num, bk[i].au); bk[i].l=strlen(bk[i].au); for(j=0; j<bk[i].l; j++){ switch(bk[i].au[j]){ case 'A': sum[0]+=1; break; case ...
2
734
int main () { struct book { int num; char name[27]; }b[1000]; int m,i,j,a=0; int c[26]; scanf("%d",&m); for (i=0;i<m;i++) scanf("%d%s",&b[i].num,b[i].name); for (i=0;i<m;i++) { for (j=0;j<strlen(b[i].name);j++) c[*(b[i].name+j)-'A']++; ...
2
735
void function(int,int); int main() { char s[200][100]; int n[100],h[100],maxh[100]; int a; int i,j,k,p; int num,maxnum=0; char c; scanf("%d",&a); for(i=0;i<a;i++) { scanf("%d%s",&n[i],s[i]); } for(j='A';j<='Z';j++) { num=0; for(i=0;i<a;i++) { ...
2
736
struct Article { int number; char author[26]; }; int main() { struct Article book[1000]; int m, i; int j, k; int c; int max = 0; int writer[26] = {0}; scanf("%d",&m); for (i = 0; i < m; i++) { scanf("%d %s",&book[i].number,book[i].author); } for (i = 0; i < m; i++) { for (j = 0; j < 26; j++) { ...
2
737
void main() { struct ts { int sl; char zz[30]; int zzsl; struct ts *next; }; struct ts *p1,*p2,*head; int i,j,k,m,n,max,zzzdnum,num[100]={0}; char zzzd; scanf("%d",&n); p1=p2=head=(struct ts *)malloc(sizeof(struct ts)); scanf("%d %s",&p1->sl,p1->zz); // p1->zzsl=strlen(p1->zz);//????? for(i=1;i<n;i++)...
2
738
char name; int num,k=0,t=0; int nametimes[100]={0}; struct book { unsigned int No; char Name[26]; }*p; void operate() { int i; for(i=65;i<91;i++) if(nametimes[i]>t) { t=nametimes[i]; name=i; } } void print() { struct book *pi; int i; printf("%c\n%d\n",name,t); for(pi=p;pi<p+num;pi++) for(i=0;pi->...
2
739
void main() { struct book { int num; char a[100]; }; struct book b[1000]; int n,i,j,s,t=0,m,h; int c[1000]; char d[27]; scanf("%d",&n); for(i=0;i<n;i++) scanf("%d %s",&b[i].num,b[i].a); d[0]=b[0].a[0]; t=1; c[0]=0; for(i=0;i<n;i++) { for(j=0;b[i...
2
740
struct book { int num; char author[26]; struct book *next; }; struct book *creat() { int n; scanf("%d",&n); int i=1; struct book *head,*p1,*p2; p1=(struct book*)malloc(LEN); scanf("%d %s",&p1->num,p1->author); p1->next=NULL; if(i>=n) {free(p1);head=NULL;return head;} else {head=p1; p2=p1; wh...
2
741
void main() { int n,i,best=0,max=0,a[26]={0},num[100],l,j,k; char letter[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'}, writer[100][26]; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d %s",&num[i],&writer[i]); } for(i=0;i<n;i++) { l=strlen(wri...
2
742
int main() { int bookno[100]; char author[100][26]; int numOfauthor[26] = {0}; int nbook, max = 0, maxno; char maxauthor; cin >> nbook; int i, j; for ( i = 0; i < nbook; i ++) { cin >> bookno[i]; cin.get(); cin.getline(*(author + i), 26); } for ( i = 0; i < nbook; i ++) for ( j = 0; author[i][j] !...
2
743
int main() { int m; cin>>m; int book[1000]; char person[]="ABCDEFGHIJKLMNOPQRSTUVWXYZ"; char people[100][100]; int i,j; int l; int t[100]={0}; for(i=1;i<=m;i++) { cin>>book[i]; cin>>people[i]; l=strlen(people[i]); for(j=0;j<l;j++) { t[people[i][j]-'A']++; } } int max=0,tt; for(i=0;i<=2...
2
744
struct book { int num; char writer[26]; }; int m; int main() { int i; scanf("%d",&m); book *p; p=(struct book*)malloc(sizeof(struct book)*m); for(i=0;i<m;i++) { scanf("%d %s",&p[i].num,p[i].writer); } int j=0,u=0; int *a; a=(int *)malloc(sizeof(int)*150); for(i='A';i<='z';i++) ...
2
745
void main() { int a[1000],i,j,m,b[26],t=0,k; char c[1000][20]; scanf("%d",&m); for(i=0;i<m;i++) scanf("%d %s",&a[i],c[i]); for(i=0;i<m;i++) for(j=0;j<strlen(c[i]);j++) if('A'<c[i][j]<'Z') b[c[i][j]-65]++; for(i=0;i<26;i++) if(b[i]>t){t=b[i];k=i;} printf("%c\n",k+65); printf("%d\n",t); for(i=0...
2
746
int main() { char temp,s; int i,j,t[27][2000],m,n,a[27] = {0},num[2000],x; { cin >> n; for (i = 1; i <= n; i++ ) { cin >> num[i]; temp = cin.get(); while (temp == '\n' || temp == ' ' ) { temp = cin.get(); } ...
2
747
void main() { struct book { int num; char author[27]; struct book *next; }*head = 0,*p1,*p2; int total,i,j,sumbook[26]={0},len,max; scanf("%d",&total); for(i=0;i<total;i++) { p1=(struct book *)malloc(sizeof(struct book)); if(p1==0) { printf("Memory request failed!\n"); exit(-1); } scanf("%d...
2
748
struct a { int number; char author[26]; }b[100]; int main() { int L[26]={0}; int n=0; int max=0; int p=0; cin>>n; for(int i=0;i<n;i++) { cin>>b[i].number; cin>>b[i].author; for(int j=0;b[i].author[j]!='\0';j++) L[b[i].author[j]-'A']++; } for(int i=0;i<26;i++) if(max<L[i]) { p=i; max=L[i]; ...
2
749
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) { t++; ...
2
750
struct shu {int num; char author[26]; }; void main() { struct shu shu[999]; int n,i,j,k,m; scanf("%d",&n); for(i=0;i<n;i++) scanf("%d %s",&shu[i].num,shu[i].author); int a[26]={0}; for(i=0;i<n;i++) { for(j=0;j<26;j++) { if(shu[i].author[j]=='A') a[0]=a[0]+1; else if(shu[i].author[j]==...
2
751
int a[30]={0},b[30][1000]; struct stu { int num; char name[30]; struct stu *next; }; struct stu *creat(int n) { struct stu *p1,*p2,*head; int i=0; p1=p2=(struct stu *)malloc(sizeof(struct stu)); scanf("%d %s",&p1->num,p1->name); head=0; for(i=0;i<n;i++) { if(i==0) head=p1; else p2->next=p1; p2=p...
2
752
int main() { int m,i,j,a[1000],c[91]={0},k,n,p=0; char b[1000][26],q; scanf("%d", &m); for(i=1;i<=m;i++) { scanf("%d%s", &a[i], b[i]); n=strlen(b[i]); for(j=0;j<=n-1;j++) { k=b...
2
753
struct BOOK{ int id; int author[26]; }; int main(){ struct BOOK book[1000]; int countauthor[26]; int n,i,j,minusA,no,count,max=0,maxau; char input[30]; scanf("%d",&n); for(i=0;i<n;i++){ for(j=0;j<26;j++){ book[i].author[j]=0; } }// refresh data: each book-->all authors initiate with 0 for(i=0;i<n;i++){...
2
754
int main() { int a; scanf("%d",&a); char zuozhe[100][100]; int shuhao[100]; int zuo[200]; int shu[200][200]; int n=0,p,i,j; int m[200]; for(i=0;i<200;i++) { zuo[i]=0; m[i]=0; } for(i=0;i<a;i++) { scanf("%d %s",&shuhao[i],zuozhe[i]); } for(i=0;i<a;i++) { for(j=0;(zuozhe[i][j])!='\0';j+...
2
755
int main(int argc, char* argv[]) { struct { int a; char b[26]; }num[999]; int i,m,j,k; int s[26]; scanf ("%d",&m); for (i=0;i<m;i++) { scanf ("%d%s",&num[i].a,num[i].b); } for (k=0;k<26;k++) { s[k]=0; } for (i=0;i<m;i++) { for (j=0;num[i].b[j]!='\0';j++) { k=num[i].b[j]-'A'; s[k]++; ...
2
756
int main(){ int max,max1,t,k,x[28]={0},n,a,b,c,d,i,j; char cc,y[100][32],q; scanf("%d",&n); scanf("%c",&cc); for(i=1;i<=n;i++){ gets(y[i]); for(j=2;y[i][j];j++){ if(y[i][j]>='A'&&y[i][j]<='Z'){ x[y[i][j]+1-'A']++;} }} max=x[1]; max1=1; for(i=2;i<=26;i++){ if(x[i]>max){ max=x[i]; max1=i;}} ...
2
757
void main() { int n,a[1000]={0},c[27]={0},i,j,k,m,p,d[1000]={0}; char b[1000][30]={{0}}; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d %s",&a[i],b[i]); } for(i=0;i<n;i++) { for(j=0;j<26;j++) { for(k=1;k<=26;k++) { if(b[i][j]==64+k)c[k]=c[k]+1; } } } m=c[1]; p=1; for(i=1;i<27;i++) { ...
2
758
int main() { int m,i,j,max=0; int Q[26]={0}; struct { int num; char name[27]; }book[1000]; scanf("%d",&m); for(i=0;i<m;i++) scanf("%d %s",&book[i].num,book[i].name); for(i=0;i<m;i++) { for(j=0;j<strlen(book[i].name);j++) { switch(book[i].name[j]) { case 'A': Q[0]++; break; case ...
2
759
struct book{ char a[1000]; char b[26]; }book[1000]; int main() { int m,i,j,s,k,p,l; int t[26]={0}; char x; scanf("%d",&m); for(i=0;i<m;i++) scanf("%s %s",&book[i].a,book[i].b); for(i=0;i<m;i++) { s=strlen(book[i].b); for(j=0;j<s;j++) { x=book[i].b[j]; k=x; t[k-65]=t[k-65]+1; } } p=t[0]; ...
2
760
struct j { int bianhao; char zuozhe[100]; }; main() { int m,i,l,k,z,max=0; int shumu[26]; scanf("%d",&m); struct j * a; a=(struct j *)malloc(m*sizeof(j)); for(i=0;i<m;i++) { scanf("%d %s",&a[i].bianhao,a[i].zuozhe); } for(z=0;z<26;z++) { shumu[z]=0; for(i=0;i<m;i++) { char * p; p=a[i].zuozhe; l=...
2
761
//#define NULL 0 struct stu { int num; char c[26]; struct stu *next; }; struct stu* create(int m) { struct stu *p1,*p2,*xhead; p1=(struct stu *)malloc(LEN); scanf("%d %s",&p1->num,p1->c); p2=p1; xhead=p1; while(m-1) { m--; p1=(struct stu*)malloc(LEN); scanf("%d %s",&p1->num,p1->c); p2->next=p1; p2...
2
762
struct book { char num[500]; char s[50]; struct book *next; }; void main() { struct book *head; struct book *p1,*p2; int m,mi,i,j,k,max,found; int aut[26]={0}; scanf("%d",&m); p1=(struct book*)malloc(LEN); scanf("%s %s",p1->num,p1->s); for(i=0;i<strlen(p1->s);i++) aut[(p1->s)[i]-'A']++; p1->n...
2
763
void main() { int a[100],i,l,c[26]={0},k,max,n,j; char b[100][26],d[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],b[i]); for(i=0;i<n;i++) { l=strlen(b[i]); for(j=0;j<l;j++) { if(b[i][j]...
2
764
struct test { int num; int book[100]; }a[26]; int main() { int n,i,j,index,temp,max; char s[100]; char ch; scanf("%d",&n); for (i=0;i<26;i++) { a[i].num=0; } for (i=0;i<n;i++) { scanf("%d %s",&index,&s); for (j=0;s[j]!='\0';j++) { temp = (int)(s[j]-'A'); a[temp].book[a[temp].num]=index; a[temp]...
2
765
int main () { int m; scanf ("%d",&m); int a[1000]; char s[1000][26]; int i,j; for (i=0;i<m;i++) { scanf ("%d %s",&a[i],s[i]); } char x; int max=0; char maxx;int l; for (x='A';x<='Z';x++) { l=0; for (i=0;i<m;i++) { for (j=0;j<26;j++) { if (s[i][j]==x)break; } if (...
2
766
void main() { char name[30]={"ABCDEFGHIJKLMNOPQRSTUVWXYZ"},c[1000][100]; int n,a[1000],num[100]={0},i,j,k,max=0,t; scanf("%d",&n); for (i=0;i<n;i++) { scanf("%d ",&a[i]); scanf("%s",c[i]); } for (i=0;i<n;i++) { for (k=0;c[i][k]!='\0';k++) { for (j=0;name[j]!='\0';j++) { if (name[j]==c[i][k]) {...
2
767
struct { int num; char w[26]; }book[999],test[1]; int main(int argc, char* argv[]) { int m,i,j,n,s; char x,c; scanf ("%d",&m); for (i=0;i<m;i++) { scanf ("%d%s",&book[i].num,book[i].w); } x='A'; n=0; c='A'; while (1) { s=0; for (i=0;i<m;i++) { for (j=0;j<...
2
768
void main() { struct books { int num; char author[26]; }books[999]; int n,a[26]={0},max,i,j,u,lenth,temp; scanf ("%d",&n); for (i=0;i<n;i++) scanf("%d %s",&books[i].num,books[i].author); for (i=0;i<n;i++) { lenth=strlen(books[i].author); for (j=0;j<lenth;j++) { for (u=0;u<26;u++) { if (books[i].author[j]=='A'+u) a[u]++...
2
769
void main() { struct b { int num; char str[27]; }b[100]; int n,i,m,j,max,nmax; int a[26]={0}; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d %s",&b[i].num,b[i].str); m=strlen(b[i].str); for(j=0;j<m;j++) { a[b[i].str[j]-65]++; } } max=a[0]; nmax=0; for(i=0;i<26;i++) { if(a[i]>max) {max=a[i]...
2
770
struct book { int id; char peo[26]; }book1[999]; int main() { int n,i,j,m=0,num[26]={0},length,max=0,t; char author; scanf("%d",&n); for(i=0;i<n;i++){ scanf("%d%s",&book1[i].id,&book1[i].peo); } for(i=0;i<n;i++){ length=strlen(book1[i].peo); for(j=0;j<length;j++){ num[(int)(book1[i].peo[j]-'A')]++; }...
2
771
int main() { int i,j,num[1000],m,a[1000][26],k,sum[26],max=0,b; char writer[1000][26],letter[27]={'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(k=0;k<26;k++) { sum[k]=0; } for(i=0;i<m;i++) { for(j=0;j<26;j++) { a[i][j]=0; ...
2
772
struct x{ int num; char author[26]; int amount; }; void main(){ struct x y[999]; int i,j,m,max=0,max_=0; int k; int amount[91]={0}; scanf("%d",&m); for(i=0;i<m;i++){ scanf("%d %s",&y[i].num,y[i].author); y[i].amount=strlen(y[i].author); } for(i=0;i<m;i++){ for(j=0;j<y[i].amount;j++){ for(k='A';k<'Z'...
2
773
int main() { int n,d,i,j,l; struct a { char name[27]; int c; }m[1000]; struct b { int num,book[1000]; char t; }; struct b author[27]; for(i=1;i<=26;i++) { author[i].t=i+64; } scanf("%d",&n); for(i=1;i<=n;i++) { scanf("%d",&m[i].c); scanf("%s",m[i].name); } for(i=1;i<=n;i++...
2
774
int max(int array[26]) { int i,max=0; for(i=0;i<26;i++) if(array[i]>max)max=array[i]; for(i=0;i<26;i++) if(max==array[i])break; return i; } void main() { struct book { int num; char aut[26]; }; int a,i,j,m,k,t[26]={0}; struct book nbook[999]; scanf("%d",&m); for(i=0;i<m;i++) scanf("%d %s",&nbook[i]...
2
775
int main() { int num[27] = {0}; int n, i, j, temp; unsigned long len; char author[27], temp2, book[27][1000] = {'\0'}; char str[4]; cin >> n; for (i = 0; i < n; i++) { cin >> str; //?????? cin.get(); cin.getline(author, 27); len = strlen(author); ...
2
776
void main () { int n,a[1000],i,l,j,max,s[26]={0}; char c[1000][27],w; scanf ("%d",&n); for (i=0;i<n;i++) { scanf ("%d%s",&a[i],c[i]); l=strlen(c[i]); for (j=0;j<l;j++) { s[c[i][j]-65]++; } } max=s[0]; w='A'; for (i=1;i<26;i++) { if...
2
777
int main() { int n,i,j,l,x,maxnumber; scanf("%d",&n); int a[1000]; char k[1000][30]; int author[27]={0}; for(i=1;i<=n;i++) { scanf("%d %s",&a[i],k[i]); int m; m=strlen(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++) ...
2
778
void main() { int m; scanf("%d",&m); int i,j,k,x,t; struct book { int num; char w[26]; }b[1000]; for(i=0;i<m;i++) { scanf("%d",&b[i].num); scanf("%s",&b[i].w); } int c[26]; for(i=0;i<26;i++)c[i]=0; for(i=0;i<26;i++) { for(j=0;j<m;j++) { for(k=0...
2
779
struct book { int num; char aut[26]; }; int main() { int i,j,k,m,x,a=0; int count[26]={0}; char y; struct book all[1000]; scanf("%d",&m); for(i=0;i<m;i++){ scanf("%d%s",&all[i].num,&all[i].aut); } for(i=0;i<m;i++){ for(j=0;j<26;j++){ if(all[i].aut[j]>='A'&&all[i].aut[j]<='Z'){ x=(int)(all[i].aut[j...
2
780
main() { int amount_temp=0,amount_most=0; char most,temp; int i,j,k,s,p; int m; char jiancha[27]; struct xinxi { int bianhao; char zuozhe[27]; }; struct xinxi shuru[999]; scanf("%d",&m); for(p=0;p<m;p++) { scanf(...
2
781
int a[26]={0} ;int n;int max;int hao; struct chushu { int num; char s[30]; struct chushu *next; }; struct chushu *create() { int j=0,q,i=0,k=0; struct chushu *head,*p1,*p2; p1=(struct chushu *)malloc(len); scanf("%d %s",&p1->num,p1->s); for (i=0;p1->s[i]!='\0';i++) { ...
2
782
void main() { int t=0,m,i,j,n,k,a[999],c[26]={0}; char b[999][999]; scanf("%d\n",&m); for(i=0;i<m;i++) scanf("%d %s",&a[i],b[i]); for(i=0;i<m;i++) { k=strlen(b[i]); for(j=0;j<k;j++) c[b[i][j]-'A']++; } for(j=0;j<26;j++) { if(t<c[j]) t=c[j]; } for(i=0;i<26;i++) { if(c[i]==t) { printf...
2
783
struct book { int num; char aut[26]; }bo[999]; main() { int n,i,j,k,count[26],max; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d %s",&bo[i].num,&bo[i].aut); } for(i=0;i<26;i++) count[i]=0; for(i=0;i<n;i++) { for(j=0;j<26;j++) { if(bo[i].aut[j]-65>=0&&bo[i].aut[j]-65<26) ...
2
784
int main() { int m,i,j,k,a[1000],c[91],max=0; char b[1000][26],d; cin>>m; memset(c,0,sizeof(c)); for(i=0;i<m;i++) { cin>>a[i]>>b[i]; for(j=0;j<26;j++) if(b[i][j]>0) c[b[i][j]]++; } for(i=65;i<91;i++) if(c[i]>max) max=c[i]; for(i=65;i<91;i++) if(c[i]==max) { d=i; cout<<d<<endl<<max<<en...
2
785
struct info { int num; char author[26]; } a[1000]; int main() { int i,m,j,b[26]={0}; char out; scanf("%d\n",&m); for(i=0;i<m;i++) scanf("%d %s\n",&a[i].num,a[i].author); for(i=0;i<m;i++) for(j=0;j<26;j++) b[a[i].author[j]-'A']++; int max=b[0]; for(i=0;i<26;i++) max=max>b[i]?max:b[i]; for(i=0;i<2...
2
786
void main() { struct book { int x; char z[10]; }a[400]; int i,n,max=0,j,k,l,y[400],p;char u;scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d %s",&a[i].x,a[i].z);y[i]=strlen(a[i].z); } for(i=0;i<n-1;i++) { for(j=0;j<y[i];j++) { p=1; for(k=i+1;k<n;k++) { for(l=0;l<y[k];l++) if(a[i].z[j]==a[k].z[l])p++; } ...
2
787
int main() { int n,book[1000],cnt[60],max; char author[1000][26],p; int b[60][1000]; cin>>n; for(int i=0;i<60;i++) cnt[i]=0; for(int i=0;i<n;i++) { cin>>book[i]; cin.get(); cin.getline(author[i],26); } for(int i=0;i<n;i++) { for(int j=0;author[i][j]!='\0';j++) { int k=author[i][j]-'0'; ...
2
788
int main() { struct book { int m; char a[26]; }; int n,i,j,k,q=0;int b[26]={0},c[26]; scanf("%d",&n); struct book * p; p=(struct book *)malloc(n*sizeof(struct book)); for(i=0;i<n;i++) scanf("%d %s",&p[i].m,p[i].a); for(i=0;i<26;i++) for(j=0;j<n;j++) for(k=0;k<26;k++) if(p[j].a[k]=='A'+i) b[...
2
789
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); int count[26]={0},max,record; for (i=0;i<m;i++) { int k; k=strlen(a[i].auther); for (j=0;j<k;j++) { count[a[i].auth...
2
790
int main() { int n,i,j,k,t=0,c=0; int A[25]; char g[]="ABCDEFGHIJKLMNOPQRSTUVWXYZ"; struct point{ int a; char s[80]; }tope[1000]; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d %s",&tope[i].a,tope[i].s); } for(k=0;k<26;k++) { A[k]=0...
2
791
int main() { int n,amount[26],num[26][1000],num0,max=0; char a; memset(amount,0,sizeof(amount)); cin>>n; for(int i=0;i<n;i++) { cin>>num0; cin.get(); a=cin.get(); while(a!='\n') { num[a-65][amount[a-65]]=num0; amount[a-65]++; a=cin.get(); } } for(int i=0;i<26;i++) if(max<amount[i]) max...
2
792
void main() { struct book { int num; char name[26]; }; int m,i,j,max; int sum[26]={0}; scanf("%d",&m); struct book b[m]; for(i=0;i<m;i++) scanf("%d %s",&b[i].num,b[i].name); for(i=0;i<m;i++) { for(j=0;j<strlen(b[i].nam...
2
793
int main(int argc, char* argv[]) {char s[999][3][27]; int m,i,j,k,Nn[27],ctrl; /*11111*/ scanf("%d",&m); for(k=1;k<=m;k++){ scanf("%s",s[k][1]); scanf("%s",s[k][2]); } /*2222*/ for(i=1;i<=26;i++) Nn[i]=0; for(i=1;i<=m;i++){ for(j=0;s[i][2][j]!='\0';j++){ if(s[i][2][j]=='A')Nn[1]++; else if(s[i][...
2
794
int main() { int n,i,l,x,maxnumber; scanf("%d",&n); int a[1000]; char k[1000][30]; int author[27]={0}; for(i=1;i<=n;i++) { scanf("%d %s",&a[i],k[i]); int m; m=strlen(k[i]); for(l=0;l<30;l++) ...
2
795
struct book { int a; char b[30]; struct book *next; }; void main() { int i,k,m,max=0,t; char j,ch; struct book *head,*p1,*p2; scanf("%d",&m); p1=(struct book*)calloc(1,sizeof(struct book)); head=p1; for(i=0;i<m;i++) { scanf("%d %s",&(p1->a),p1->b); p2=p1; if(i==m-1) p2->next=NULL; else { p1=(...
2
796
struct books{ int num; char writer[26]; struct books *next; }; int m; struct books *creat() { struct books *head,*p1,*p2; int i; p2=p1=(struct books*)malloc(sizeof(struct books)); for (i=1;i<=m;i++){ if (i==1) head=p1; scanf("%d %s",&p1->num,p1->writer); p2=p1; if(i!=m){ p1=(struct books*)malloc(s...
2
797
struct book{ int num; char s[27]; }shu[1000]; int main(){ int n,i,l,j,max; char name; int letter[26]={0}; scanf("%d",&n); for(i=0;i<n;i++){ scanf("%d%s",&shu[i].num,&shu[i].s); l=strlen(shu[i].s); for(j=0;j<l;j++){ letter[(shu[i].s[j]-65)]++; } } for(max=letter[0],name=65,i=1;i<26;i++){ if(letter[...
2
798
int w[26]={0};//zimu 0 26 int p=0; void zimu(char a[]){ int m,i,j; char c; m=strlen(a); for(j=0;j<26;j++){ c='A'+j; for(i=0;i<m;i++){ if(a[i]==c) w[j]++; } }//for1 end } int max(int w[26]){ int i,max; max=w[0]; for(i=1;i<26;i++) if(w[i]>max){ max=w[i]; p=i; } return max; } void main...
2
799
struct author { int num; char name[26]; }; struct author ren[100]; int main() { int n,i,j=0,k=0,biao,maxzuozhe,p,geshu[26]={0},max=0,maxdeshu[999]; scanf("%d\n",&n); for(i=0;i<=n-1;i++) { scanf("%d",&ren[i].num); scanf("%s",ren[i].name); } for(i=0;i<=25;i++) { for(j=0;j<=n-1;...