id int32 0 32.5k | code stringlengths 95 8.4k | label stringclasses 65
values |
|---|---|---|
700 | 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;
... | 2 |
701 | 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)
... | 2 |
702 | int main ()
{
int n,i,a[1000],m[1000];
struct {
char b[26];
}p[1000];
int j,k;
scanf("%d",&n);
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'};
int num[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};
for (i=0;i<n;i++)
... | 2 |
703 | 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++... | 2 |
704 |
struct book
{
int num;
char author[27];
}book[1000];
int main()
{
int n, i, a, max=0, alp[26]={0};
char *j;
scanf("%d", &n);
for(i=0;i<n;i++)
{
scanf("%d %s", &book[i].num, book[i].author);
int len=strlen(book[i].author);
for(j=book[i].author;j<(bo... | 2 |
705 | void main()
{
int b[1000],d[1000],e[30]={0};
int i,j,k,n,t=0,max;
char c[1000][10];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d %s",&b[i],c[i]);
d[i]=(int)strlen(c[i]);
}
for(i=0;i<n;i++)
for(j=0;j<d[i];j++)
for(k=0;k<26;k++)
if(c[i][j]==k+65)e[k]=e[k]+1;
max=e[0];
fo... | 2 |
706 | 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[... | 2 |
707 | 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;
}... | 2 |
708 |
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)... | 2 |
709 | 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]++;... | 2 |
710 |
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++)
... | 2 |
711 | int main()
{
int m, book[1002], i, cnt[26] = {0}, l, j, n = 0;
char name[1002][27], a, max ;
cin >> m;
for (i = 0; i < m; i++)
{
cin >> book[i];
cin >> name[i];
l = strlen(name[i]);
for (j = 0; j < l; j++)
{
a = name[i][j];
cnt[a - 'A']++;
}
}
for (i = 0; i < 26; i++)
{
i... | 2 |
712 | struct book
{int num;
char name[27];
struct book *next;
};
main()
{
struct book *p1,*p2,*head=NULL;
int i,j,n,m,k,a[26],max,first;
scanf("%d",&m);
for(i=0;i<m;i++)
{
p1=(struct book*)malloc(sizeof(struct book));
scanf("%d%s",&p1->num,p1->name);
if(i==0) head=p1;
el... | 2 |
713 |
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]++;
... | 2 |
714 | int main()
{
int m, b, book[1000][27] = {0}, writer[26] = {0}, max = 0;
char w;
cin >> m;
for(int i = 1; i <= m; i++)
{
cin >> b;
book[i][26] = b;
cin.get();
while((w = cin.get()) != '\n')
{
writer[w - 'A']++;
book[i][w - 'A'] = 1;
}
}
for(int i = 1; i < 26; i++)
if(writer[ma... | 2 |
715 | 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++)
{
... | 2 |
716 | 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-... | 2 |
717 | struct book
{
int num;
char w[26];
struct book *next;
};
int c[26],m,i,j=0,max;
struct book *creat(int m)
{
struct book *head,*p1,*p2;
p1=(struct book*)malloc(len);
scanf("%d%s",&p1->num,p1->w);
p1->next=NULL;
p2=p1;
head=p1;
for(i=1;i<m;i++)
{
p1=(struct book*)malloc(len);
... | 2 |
718 | 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... | 2 |
719 |
int main()
{
char mname[999][26], name;
int i, j, m, len, max = 0;
int num[999], count[26] = {0};
cin >> m;
for (i = 0; i < m; i++)
{
cin >> num[i] >> mname[i];
len = strlen(mname[i]);
for (j = 0; j < len; j++)
{
count[mname[i][j] - 'A']++;
}
}
for (i = 0; i < 26; i++)
{
if (c... | 2 |
720 | void main()
{
char book[1000][30];
int n,i,j,k,r,len[1000],a[26][1000]={0},b[26]={0},max,s,c[26];
scanf("%d",&n);
for(i=0;i<=n;i++)
{
gets(book[i]);
scanf("\n");
}
for(i=0;i<=n;i++)
for(j=0;book[i][j]!=' ';j++)
len[i]=j;
for(k=0;k<26;k++)
{
r=0;
for(i=0;i<=n;i++)
{
for(j=len... | 2 |
721 | 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]... | 2 |
722 |
int main()
{
int num[110],m,ni = 0,n = 0,maxn[30]={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,0,0,0,0};
char au[110][30],max[30];
cin >> m;
int i,j;
for (i = 0; i < m; i ++)
{
cin >> num[i];
cin >> au[i];
}
for (i = 0; i < m; i ++)
{
for (j = 0; au[i][j] != '\0';j++)
... | 2 |
723 | struct author
{
char name[26];
int num;
struct author *next;
};
void main()
{
int i,n,a[26],j,t;
struct author *head;
struct author *p1,*p2;
p1=p2=(struct author *)malloc(LEN);
head=NULL;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d %s",&p1->num,p1->name);
if(i==0) head=p1;
else p2=p1... | 2 |
724 |
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++)
... | 2 |
725 |
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++)... | 2 |
726 | 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);... | 2 |
727 |
struct book
{
int num;
char name[100];
struct book *next;
};
struct book *creat(int n)
{
int k=1;
struct book *head,*p1,*p2,*p;
p1=(struct book *)malloc(sizeof(struct book));
head=p1;p2=p1;p=p1;
scanf("%d %s",&p1->num,p1->name);
p1->next=NULL;
do
{
p1=(struct book *)malloc(sizeof(struct... | 2 |
728 | 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';
... | 2 |
729 | struct book
{
int num;
char writer[26];
}book[1000];
void main()
{
int n,i,j,e,max=0;
scanf("%d",&n);
char da,c;
int temp[27]={0};
for(i=0;i<n;i++)
{
scanf("%d%s",&book[i].num,book[i].writer);
}
for(i=0;i<n;i++)
{
for(da='A';da<='Z';da++)
{
for(j=0;j<26;j++)
{
if(book[i]... | 2 |
730 | 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)... | 2 |
731 |
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=... | 2 |
732 | int main()
{
struct books
{
int book;
char writer[20];
}bk[1000];
int n,i,j,m,max,k,maxw=0,flag=0,a[26]={0};
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d %s",&bk[i].book,bk[i].writer);
}
for(i=0;i<n;i++)
{
m=strlen(bk[i].writer);
for(j=0;j<m;j++)
{
k=bk[i].writer[j];
a[k-6... | 2 |
733 | 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);
... | 2 |
734 | //
// main.cpp
// ????
//
// Created by ???? on 13-12-25.
// Copyright (c) 2013? ????. All rights reserved.
//
int main()
{
struct author_book
{
int count;
int book[999];
} au[26];
for(int k=0;k<26;k++)
{
au[k].count=0;
}
... | 2 |
735 | struct book
{int num;
char a[27];
int y;
struct book *next;
};
void main()
{int n,i,j,k,m=0,num,max;
struct book *p1,*p2,*p,*head;
int c[26]={0};
scanf("%d",&n);
head=p1=p2=Z;
for(i=0;i<n;i++)
{p2->next=p1;
p2=p1;
scanf("%d%s",&p2->num,p2->a);
num=strlen(p2->a);
for(j=0;j<num;j++)
c[*(p2->a+j)-65]++... | 2 |
736 | 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]... | 2 |
737 |
struct record
{
int id;
};
struct YyxNode
{
struct record m_rec;
struct YyxNode *next;
};
struct YyxLink
{
int n;
struct YyxNode *head;
struct YyxNode *tail;
};
struct YyxLink *CreateNewLink()
{
struct YyxLink *newLn;
struct YyxNode *newNd;
if(((newLn=(struct YyxLink*)malloc(sizeof(s... | 2 |
738 |
char f(int y);
int main()
{
int m,i,j,number[1000],auther[26],total=0;
char name[1000][27];
scanf("%d",&m);
for(i=0;i<m;i++){
scanf("%d %s",&number[i],name[i]);
int n;
n=strlen(name[i]);
for(j=0;j<n;j++){
switch(name[i][j]){
case'A':auther[0]++;break;
case'B':auther[1]++;break;
... | 2 |
739 | char name[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 main()
{
int n,t,i,j;
int count[26],max=0;
for(i=0;i<26;i++) count[i]=0;
struct book
{
int num;
char man[26];
} book[999];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%... | 2 |
740 |
struct author
{
int number;
char name[26];
}
author[999];
struct single
{
char letter[1];
int number;
}
single[26];
int main(int argc, char* argv[])
{
int n, i, m, j, p, k, book[999];
for(i=0;i<26;i++)
{
single[i].letter[0]=65+i;
single[i].number=0;
}
scanf("%d",&n);
... | 2 |
741 | void main()
{
int n,i,j,l,max,p;
int a[1000];
scanf("%d",&n);
struct book
{
int m;
char c[27];
};
struct book b[1000];
for(i=0;i<n;i++)
{
scanf("%d",&b[i].m);
scanf("%s",b[i].c);
}
for(i=0;i<26;i++)
a[i]=0;
for(i=0;i<n;i++)
{
l=strlen(b[i].c);
for(j=0;j<l;j++)
a[b[i].... | 2 |
742 |
int main()
{
int m;
int book[1020];
scanf("%d",&m);
int i;
char c;
int a[27]={0};
int b[27][1000]={0};
for(i=1;i<=m;i++)
{
scanf("%d",&book[i]);
getchar();
for(;;)
{
scanf("%c",&c);
if(c=='\n') break;
a[c-64]+=1;
b[c-64][i]=1;
}
}
int max=0,p;
for(i=1;i<27;i++)
... | 2 |
743 |
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;
}
}
... | 2 |
744 |
void main()
{
struct book
{
int number;
char author[10];
};
struct book a[1000];
int i,n,j,count[26]={0},temp,max,index=0;
char c;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d %s",&a[i].number,&a[i].author);
for(i=0;i<n;i++)
for(j=0;a[i].author[j]!='\0';j++)
{ temp=(a[i].auth... | 2 |
745 | int main()
{
int x[26]={0};
char c;
struct books
{
int number;
char name[27];
};
struct books book[1000];
int n,i,j,t,max=0;
struct books *p;
scanf("%d",&n);
for(p=book;p<book+n;p++)
scanf("%d%s",&p->number,p->name);
for(p=book;p<book+n;p++)
for(j=0;j<26;j++)
for(i=65;i<=90;i++)
... | 2 |
746 |
struct bo{
char id[10];
char au[100];
};
int main(){
int n,i,j,max;
char maxa;
struct bo *book;
int auth[26];
memset(auth,0,sizeof(int)*26);
scanf("%d",&n);
book=(struct bo *)malloc(sizeof(struct bo)*n);
for(i=0;i<n;i++){
scanf("%s%s",book[i].id,book[i].au);
for(j=0;book[i].au[j];j++){
... | 2 |
747 | 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]++;
... | 2 |
748 |
void main()
{
int n,i,j,sh[100],a[26]={0},b[26][100];
int max,t,m;
char ch[100][40]={'\0'};
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d %s",&sh[i],ch[i]);
}
for(i=0;i<n;i++)
{
for(j=0;j<40;j++)
{
m=ch[i][j];
if(m>64 && m<91)
{a[m-65]++;b[m-65][a[m-65]]=sh[i];}
}}
max=0... | 2 |
749 |
struct node //??????
{
int num;
char name[26];
struct node *next;
};
int n=1,m;
struct zuozhe
{
char name;
int books[300];
int num;
}zuozhe[26];
struct node *getlinked()
{
struct node *head,*newnode,*thisnode;
// printf("Please input the number and data (-1 -1 to end):\n");
do
{
n... | 2 |
750 | int main()
{
int num,temp;
int author[27][500]={0,};
char str[1000];
cin>>num;
for(int i=1;i<=num;i++)
{
cin>>temp;
getchar();
cin>>str;
for(int j=0;j<strlen(str);j++)
{
author[str[j]-'A'+1][0]++;
author[str[j]-'A'+1][... | 2 |
751 | int main()
{
char a[1000][26], t;
int b[1000], num[26] = {0}, n, i, j, k, max, l[1000];
cin >> n;
max = 0;
for (i = 1; i <= n; i++)
{
cin >> b[i];
gets(a[i]);
l[i] = strlen(a[i]);
for (j = 1; j <= l[i]; j++)
num[a[i][j] - 'A']++;
}
for (i = 0; i <= 25; i++)
if (num[i] > max)
{... | 2 |
752 |
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};
... | 2 |
753 | 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']++;... | 2 |
754 | void main()
{
int len[1000];
int b[26];
int a[1000];
char str[1000][26];
int m,i,j,max,num;
char c;
int pos,temp;
scanf("%d",&m);
for(i=0;i<26;i++)
b[i]=0;
for(i=0;i<m;i++)
{
scanf("%d ",&a[i]);
scanf("%s",str[i]);
len[i]=strlen(str[i]);
for(j=0;j<len[i];j++)
{
t... | 2 |
755 | struct Book
{
int id;
char author[26];
int flag;
}book[1000];
int main()
{
int n, i, j, l, max, maxnum;
int num = 0;
int a[26] = {0};
scanf("%d", &n);
for(i = 0; i < n; i++)
{
scanf("%d %s", &book[i].id, book[i].author);
l = strlen(book[i].author);
for(j = 0; j < l; j++)
a[book[i].aut... | 2 |
756 | void main()
{
int n,i,j;
int max,p;
int mwj;
int shu[1000];
char zuo[1000][30];
int w[26];
for(i=0;i<26;i++)
w[i]=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d %s",&shu[i],zuo[i]);
for(j=0;j<strlen(zuo[i]);j++)
{
w[(zuo[i][j]-65)]=w[(zuo[i][j]-65)]+1;
}
... | 2 |
757 |
int main(){
int n,i,j,k,b[999],max=0,a[27],x;
char w,c[999][26],d[27];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d %s",&b[i],c[i]);
}
for(i=0;i<27;i++)
{a[i]=0;}
for(i=0;i<n;i++){
for(j=0;j<26;j++){
... | 2 |
758 | void main()
{
int n,i,j,l,a[100],b[26],s,max;
char c[100][50],m;
for(i=0;i<=25;i++)
b[i]=0;
scanf("%d",&n);
for(i=0;i<=n-1;i++)
{
scanf("%d%s",&a[i],c[i]);
l=strlen(c[i]);
for(j=0;j<=l-1;j++)
{s=(int)c[i][j]-65;
b[s]=b[s]+1;}}
max=b[0];
j=0;
for(i=0;i<=25;i++)
{... | 2 |
759 | 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... | 2 |
760 | int main()
{
int n,i,j;
cin >> n;
char number[1000][5]={' '};
char authors[1000][30]={' '};
int author[30]={0};
for (i=0;i<=n-1;i++)
{
cin >> number[i] >> authors[i];
int len1=strlen(authors[i]);
for (j=0;j<=len1-1;j++)
{
aut... | 2 |
761 | struct book
{
int number;
char author[26];
struct book *next;
};
int m,i;
struct book *creat(void)
{
struct book *head,*p1,*p2;
int i=1;
p1=p2=(struct book *)malloc(sizeof(struct book));
head=p1;
for(i=1;i<m;i++)
{
scanf("%d %s",&p1->number,p1->author);
p1=(struct book *)malloc(sizeof(st... | 2 |
762 |
int main()
{
struct
{
int m;
char s[26];
}p[999];
int i,j,len,n;
int a[26][1000]={0};
int w,t;
scanf("%d\n",&n);
for(i=0;i<n;i++)
{
scanf("%d %s",&p[i].m,p[i].s);
len=strlen(p[i].s);
for(j=0;j<len;j++)
{
t=(p[i].s)[j]-'A';
a[t][0]+=1;
w=a[t]... | 2 |
763 |
int main()
{
struct book
{
int No;
char author[27];
int yes;
struct book *next;
};
struct book*head,*p;
int m,i,*max;
int *count;
count=(int*)malloc(26*sizeof(int));
for(i=0;i<26;i++)
*(count+i)=0;
p=(struct book*)malloc(sizeof(struct book));
head=p;
scanf("%d",&m);
for(i=0;i... | 2 |
764 | int main()
{
struct tushu
{
int bianhao;
char zuozhe[26];
};
int i,j,n,q=0;
int count[26]={0};
scanf("%d",&n);
struct tushu *pp;
pp=(struct tushu *)malloc(sizeof(tushu)*n);
int *m;
m=(int *)malloc(sizeof(int)*n);
for(i=0;i<n;i++)
{
scanf("%d %s",&((pp+i)->bianhao),(pp+i)->zuozhe);
}
... | 2 |
765 |
int main()
{
struct bookst
{
int Num;
char name[26];
};
struct bookst *book;
int cnt[26], num, i, j, max=0, max_idx=0;
for(i=0;i<26;i++)
cnt[i]=0;
scanf("%d",&num);
book=(struct bookst *)malloc(num*sizeof(struct bookst));
for(i=0;i<num;i++)
{
scanf("%d%s",&book[i].Num,book[i].name);
... | 2 |
766 |
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].coun... | 2 |
767 |
void main()
{
int a[1000];
char s[1000][30],ch;
int b[30]={0};
int i,k;
int n;
int max=0;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d %s",&a[i],s[i]);
for(i=0;i<n;i++)
for(ch='A';ch<='Z';ch++)
if(strchr(s[i],ch)!=NULL)
b[ch-65]++;
for(i=0;i<=26;i++)
if(b[i]... | 2 |
768 |
int pp[26]={0};
struct st
{
char name[27];
int num;
struct st *next;
};
struct st *creat(int m)
{
struct st *head,*p1,*p2;
int i,j;
p1=(struct st *)malloc(sizeof(struct st));
scanf("%d %s",&p1->num,p1->name);
for (j=0;;j++)
{
if (isupper(p1->name[j])) pp[p1->name[j]-65]++;
else break... | 2 |
769 | void main()
{
struct book
{
char num[100],wri[26];
} bo[1000];
int i,j,k,l,n,m=0,a[26]={0},mw;
scanf("%d\n",&n);
for (i=0;i<n;i++)
{
scanf("%s %s",bo[i].num,bo[i].wri);
l=strlen(bo[i].wri);
for (j=0;j<l;j++) a[bo[i].wri[j]-65]++;
}
for (i=0;i<26;i++) if(a[i]>m) {m=a[i];mw=65+i;}
printf(... | 2 |
770 | int c[26];
char b[1000][100];
char out;
int main(int argc, char* argv[])
{
int n,i,j,tmp=0,tmp1=0,tmp2;
int a[1000];
out='A';
scanf ("%d",&n);
for (i=0;i<n;i++)
{
scanf ("%d %s",&a[i],b[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][... | 2 |
771 | struct book{
int num;
char writer[28];
}bo[1000];
int main()
{
int i,j,k,n,a,b;
int max=0;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d %s",&bo[i].num,bo[i].writer);
}
for(i='Z';i>='A';i--){
a=0;
for(k=0;k<n;k++){
for(j=0;j<27;j+... | 2 |
772 | 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++)
{
... | 2 |
773 |
struct
{
int num;
char au[27];
}book[999];
int main()
{
int m,a[26]={0},i,j,t,max=0;
scanf("%d",&m);
for(i=0;i<m;i++)
{
scanf("%d%s",&book[i].num,book[i].au);
int au_n=strlen(book[i].au);
for(j=0;j<au_n;j++)
{
if(book[i].au[j]<=90&&book[i].au[j]>=65)
{
int k=book[i].au[j... | 2 |
774 | int main()
{
int i,j,k,n,num[1000],len[1000],num1[1000][26]={0},sum[26]={0},max=0,m;
char writer[1000][26],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'};
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d%s",&num[i],writer[i]);
len[... | 2 |
775 | void main()
{
int m,t,b[1000],a[26]={0},max;
char str[1000][30];
int i,j;
scanf("%d",&m);
for(i=0;i<m;i++)
{
scanf("%d %s",&b[i],str[i]);
for(j=0;str[i][j]!='\0';j++)
{
t=str[i][j]-'A';
a[t]++;
}
}
t=0;
max=a[0];
for(i=0;i<26;i++)
{
if(max<a[i])
{
max=a[i];
t=i;
... | 2 |
776 | int n;
struct stu
{int num;
char name[27];
struct stu *next;
};
struct stu *creat()
{int i=0; struct stu *head, *p1,*p2;
head=p1=p2=(struct stu*)malloc(sizeof(struct stu));
scanf("%d %s", &p2->num,p2->name);
while(i<n-1)
{i++; p2=(struct stu*)malloc(sizeof(struct stu));
scanf("%d %s", &p2->num,p2->name);
... | 2 |
777 |
struct book
{
int id;
char c[27];
};
int main()
{
void number_of_books(int n,int *p,struct book book[1000]);
char max(int n,int *p,struct book book[1000]);
void name_of_book(int n,int *p,struct book book[1000],int m);
int *p;
char s[100],m;
struct book book[1000];
... | 2 |
778 | //????????????
//???2013.12.21
//****************************
int main()
{
int n=0,i=0,j=0,num[100],k=0,count[26]={0},max=0;
char nam[100][30]={NULL};
cin>>n;
for(i=0;i<n;i++)
{
cin>>num[i];
cin.get();
gets(nam[i]);
for(j=0;j<strlen(nam[i]);j++)
count[nam[i][j]-'A']++;
}
max=count[0];
... | 2 |
779 | struct book{
int num;
char writer[26];
struct book *next;
};
void main()
{
int n,i,j,a[26]={0},max,temp; /*a[i]???????0*/
char c;
struct book *p,*head,*tail;
scanf("%d",&n);
head=NULL;tail=NULL;
for(i=0;i<n;i++){
p=(struct book*)malloc(len);
scanf("%d %s",&p->num,p->writer);
... | 2 |
780 | 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=... | 2 |
781 | void main()
{
int n,a[1000],i,b[26]={0},m,j,max=0,k;
char str[1000][30];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d%s",&a[i],str[i]);
}
for(i=0;i<n;i++)
{
m=strlen(str[i]);
for(j=0;j<m;j++)
{
if(str[i][j]=='A')
b[0]++;
if(str[i][j]=='B')
b[1]++;
if(str[i][j]=='C')
... | 2 |
782 | int main()
{
int m,i,num[26]={0},index1;
scanf("%d",&m);
struct f
{
int index;
char writer[27];
};
struct f *p;
p=(struct f *)malloc(m*sizeof(struct f));//???????
char *p1;
for(i=0;i<m;i++)
{
scanf("%d %s",&(p+i)->index,(p+i)->writer);//????
}
for(i=0;i<m;i++)
{
p1=(p+i)->writer;
... | 2 |
783 | 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[... | 2 |
784 | struct chain
{
int num;
char name[27];
struct chain *next;
};
void main()
{
int a[26]={0},m,i,j,k,max=0,n;
struct chain *p1,*p2,*head;
scanf("%d",&m);
p2=head=(struct chain *)malloc(LEN);
for(k=0;k<27;k++)
head->name[k]=0;
scanf("%d%s",&head->num,&head->name);
for(k=0;k<strlen(head->name);k++... | 2 |
785 | int main()
{
struct writer
{
int num;
char name[20];
struct writer * next;
};
int i,j,k,l,m,z[26]={0},max,n;
struct writer *p1,*p2,*p,*head;
scanf("%d",&n);
head=p1=p2=(struct writer *)malloc(sizeof(struct writer));
scanf("%d %s",&p1->num,&p1->name);
for (i=0;i<n-1;i++)
{
p1=(struct wri... | 2 |
786 | void main()
{
struct
{
int NO;
char AUT[27];
}book[999];
int i,j,k,m,n,d,max;
int a[26]={0},b[26][999];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d ",&book[i].NO);
gets(book[i].AUT);
for(j=0;book[i].AUT[j]!='\0';j++)
{
d=book[i].AUT[j]-65;
b[d][a[d]]=book[i].NO;
a[d]=a[d]... | 2 |
787 | /*????????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=str... | 2 |
788 | 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-... | 2 |
789 | void main()
{
char w[999][26];
char m;
int a[999],c[26];
int i,j,n,t,max;
scanf("%d",&n);
for(i=0;i<=25;i++){
c[i]=0;
}
for(i=0;i<=n-1;i++){
scanf("%d",&a[i]);
scanf("%s",w[i]);
}
for(i=0;i<=n-1;i++){
for(j=0;w[i][j]!='\0';j++){
c[w[i][j]-65]+=1;
}
}
max=c[0];
m=65;
for(i... | 2 |
790 | 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 %... | 2 |
791 | void main()
{
int n,i,j,card[1000],num[26]={0},max=0,k=0;
char s[1000][27];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d %s",&card[i],s[i]);
for(i=0;i<n;i++)
for(j=0;s[i][j]!='\0';j++)
num[s[i][j]-'A']++;
for(i=0;i<26;i++)
if(num[i]>max)
{max=num[i];k=i;}
printf("%c\n%d\n",k+'A',max);
... | 2 |
792 | struct shu
{
char xh[100]; /*??*/
char zz[100];
struct shu * next;
};
int num[26]={0},m;
struct shu *creat(int n)
{
int i=0;
struct shu *p1,*p2,*head;
p1=p2=(struct shu *)malloc(sizeof(struct shu ));
head=0;
while(i<n)
{
i++;
if(i==1)
{
p1->next=0;
he... | 2 |
793 | 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++)
... | 2 |
794 | struct worker
{
int nm;
char name1[26];
struct worker *next;
};
struct zuozhe
{
char nam;
int counts;
int name[1000];
struct zuozhe *next;
};
struct worker *creat1(int n)
{
struct worker *head,*p1,*p2;
int i;
head=(struct worker *)malloc(sizeof(struct worker));
p1=p2=head;
for(i=0;i<n;i+... | 2 |
795 |
int main()
{
int n;
scanf("%d",&n);
if(n>0){
struct a
{
char y[30];
int x,l;
}a[1000];
struct b
{
char y;
int x;
}b[26];
int i,j,p;
char k;
for(i=0;i<n;i++)
{
scanf("%d %s",&a[i].x,&a[i].y);
a[i].l=strlen(a[i].y);
}
for(i=0;i<=25;i++)
{
b[i].y=i+65;
b[i].x=0;... | 2 |
796 | 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++)
{
... | 2 |
797 | 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(... | 2 |
798 | 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;
}... | 2 |
799 | int main()
{
int n;
cin>>n;
int a[26],max,num[n],i,j,s;
char maxname,name[n][10];
memset(a,0,sizeof(a));
for(i=0;i<n;i++)
{
cin>>num[i]>>name[i];
s=strlen(name[i]);
for(j=0;j<s;j++)
a[name[i][j]-'A']++;
}
max=a[0],maxname='A';
for(i=1;i<26;i++)
if(a[i]>max)
{
max=a[i],maxname... | 2 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.