label
stringlengths 1
2
| index
stringlengths 1
5
| code
stringlengths 87
8.24k
|
|---|---|---|
2 | 500 |
struct wr
{ char w;
int k;
int num[1000];
struct wr* next;
};
struct wr * creat(void)
{
struct wr *head,*p1,*p2,a;
char i;
head=p2=(struct wr *)malloc(sizeof(struct wr));
head->w='A';
head->k=0;
for(i='B';i<='Z';i++)
{
p1=(struct wr *)malloc(sizeof(struct wr));
p1->w=i;
p1->k=0;
p2->next=p1;
p2=p1;
}
p2->next=NULL;
return head;
}
void add(char a,int b,struct wr * head)
{
struct wr *p;
for(p=head;p!=NULL;p=p->next)
if(a==p->w)
{(p->k)++;
*(p->num+p->k-1)=b;
}
}
void max(struct wr * head)
{
struct wr *p1,t;
for(p1=head->next;p1!=NULL;p1=p1->next)
if(p1->k>head->k)
*head=*p1;
}
void main()
{
struct wr *head,*t;
int n,*no,i;
char *ws,*p;
ws=(char *)malloc(sizeof(char)*27);
head=creat();
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&no);
gets(ws);
for(p=ws;*p!='\0';p++)
add(*p,no,head);
}
max(head);
printf("%c\n",head->w);
printf("%d\n",head->k);
for(i=0;i<head->k;i++)
printf("%d\n",*(head->num+i));
} |
2 | 501 | struct score
{
char id[10];
char name[26];
}book[1000];
int main()
{
int i,j,k,n,num,max=0;
char maxname;
scanf("%d",&num);
for(i=0;i<num;i++){
scanf("%s",book[i].id);
scanf("%s",book[i].name);
}
for(i=0;i<26;i++){
n=0;
for(j=0;j<num;j++){
for(k=0;k<26;k++){
if(book[j].name[k]==('A'+i))n+=1;
}
}
if(n>max){
maxname='A'+i;
max=n;
}
}
printf("%c\n%d\n",maxname,max);
for(j=0;j<num;j++){
for(k=0;k<26;k++){
if(book[j].name[k]==maxname)printf("%s\n",book[j].id);;
}
}
return 0;
}
|
2 | 502 |
int main()
{
int n, i,l,j,t,k[30][99],a[30],o,q,max=0,maxman;
for(i=0;i<30;i++)
a[i]=0;
char s[40];
scanf("%d", &n);
for(j=0; j<n; j++)
{
scanf("%d %s",&o,s);
l=strlen(s);
for(i=0; i<l; i++)
{
q = s[i]-'A';
a[q]++;
t=a[q];
k[q][t]=o;
}
}
for(i='A'-'A';i<='Z'-'A';i++)
{
if(a[i]>max)
{
// printf("%d,%d\n",a[i],i);
max = a[i];
maxman = i;
}
}
printf("%c\n%d\n",maxman+'A',max);
for(i=1;i<=max;i++)
printf("%d\n",k[maxman][i]);
return 0;
}
|
2 | 503 | 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='A'+i;
}
cout<<maxname<<endl<<max<<endl;
for(i=0;i<n;i++)
{
s=strlen(name[i]);
for(j=0;j<s;j++)
if(name[i][j]==maxname)
cout<<num[i]<<endl;
}
return 0;
} |
2 | 504 |
int pro(char pr)
{
return toupper(pr) - 'A';
}
void put_names(int name[26][100], int books[26], int booknum);
int max(int books[26]);
main()
{
int n, i, name[26][100], books[26] = {0}, max_ptr;
int booknum;
scanf("%d", &n);
for(i = 1;i <= n;i ++)
{
scanf("%d", &booknum);
put_names(name, books, booknum);
}
max_ptr = max(books);
printf("%c\n", max_ptr + 'A');
printf("%d\n", books[max_ptr]);
for(i = 1;i <= books[max_ptr];i ++)
{
printf("%d\n", name[max_ptr][i]);
}
}
void put_names(int name[26][100], int books[26], int booknum)
{
char ch;
int ptr;
int counter = 0;
while(1)
{
ch = getchar();
if(ch != ' ') break;
}
while(1)
{
ptr = pro(ch);
books[ptr] ++;
//printf("|%c, %d|---", ch, books[ptr]);
name[ptr][books[ptr]] = booknum;
ch = getchar();
if(ch == '\n') break;
}
//printf("[%d]\n", counter);
}
int max(int books[26])
{
int i;
int ptr;
ptr = books[0];
for(i = 0;i <= 25;i ++)
{
if(books[i] > books[ptr]) ptr = i;
}
return ptr;
}
|
2 | 505 | int main()
{
char writer[1000][30];
char abc[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 m,n,mark[1000], num[26]={0}, sum=0, i, j;
scanf("%d", &m);
for(i=0;i<m;i++)
{
scanf("%d", &mark[i]);
scanf("%s", writer[i]);
}
for(i=0;i<m;i++)
{
for(j=0;j<strlen(writer[i]);j++)
{
if(writer[i][j]=='A')
num[0]++;
else if(writer[i][j]=='B')
num[1]++;
else if(writer[i][j]=='C')
num[2]++;
else if(writer[i][j]=='D')
num[3]++;
else if(writer[i][j]=='E')
num[4]++;
else if(writer[i][j]=='F')
num[5]++;
else if(writer[i][j]=='G')
num[6]++;
else if(writer[i][j]=='H')
num[7]++;
else if(writer[i][j]=='I')
num[8]++;
else if(writer[i][j]=='J')
num[9]++;
else if(writer[i][j]=='K')
num[10]++;
else if(writer[i][j]=='L')
num[11]++;
else if(writer[i][j]=='M')
num[12]++;
else if(writer[i][j]=='N')
num[13]++;
else if(writer[i][j]=='O')
num[14]++;
else if(writer[i][j]=='P')
num[15]++;
else if(writer[i][j]=='Q')
num[16]++;
else if(writer[i][j]=='R')
num[17]++;
else if(writer[i][j]=='S')
num[18]++;
else if(writer[i][j]=='T')
num[19]++;
else if(writer[i][j]=='U')
num[20]++;
else if(writer[i][j]=='V')
num[21]++;
else if(writer[i][j]=='W')
num[22]++;
else if(writer[i][j]=='X')
num[23]++;
else if(writer[i][j]=='Y')
num[24]++;
else if(writer[i][j]=='Z')
num[25]++;
}
}
for(i=0;i<26;i++)
{
if(num[i]>=sum)
{
sum=num[i];
n=i;
}
}
printf("%c\n",abc[n]);
printf("%d\n", num[n]);
for(i=0;i<m;i++)
{
for(j=0;j<strlen(writer[i]);j++)
{
if(writer[i][j]==abc[n])
{
printf("%d\n",mark[i]);
break;
}
}
}
scanf("%d",&m);
return 0;
} |
2 | 506 |
struct book
{
int num;
char name[25];
}book[999];
void main()
{
int m,i,j,k,b,c,max=0,a[25]={0},q[25][999]={0},p=0;
scanf("%d",&m);
for (i=0;i<m;i++)
{
scanf("%d %s",&book[i].num,book[i].name);
b=strlen(book[i].name);
for(j=0;j<b;j++)
{
for(k=0;k<26;k++)
{
if (book[i].name[j]==k+65)
{
a[k]=a[k]+1;
q[k][i]=book[i].num;
}
}
}
}
for (i=0;i<25;i++)
{
if(a[i]>max)
{
max=a[i];
c=i;
}
}
printf("%c\n%d\n",c+65,max);
for (i=0;i<m;i++)
{
if(q[c][i]>0)
printf("%d\n",q[c][i]);
}
}
|
2 | 507 | //????????????
//???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];
for(i=0;i<26;i++)
{
if(max<count[i])
{ max=count[i];k=i; }
else
continue;
}
j=0;
cout<<(char)(k+'A')<<endl;
cout<<max<<endl;
for(i=0;i<n;i++)
for(j=0;;j++)
{
if(nam[i][j]==k+'A')
{ cout<<num[i]<<endl;break; }
if(nam[i][j]==NULL)
break;
}
return 0;
} |
2 | 508 |
void main()
{
int i,j,m,a[26][999],num[26]={0},t,max;
char zz[27];
scanf("%d",&m);
for(i=0;i<m;i++)
{
scanf("%d%s",&t,zz);
for(j=0;j<strlen(zz);j++)
{
a[(int)(zz[j]-'A')][num[(int)(zz[j]-'A')]]=t;
num[(int)(zz[j]-'A')]++;
}
}
max=0;
for(i=0;i<26;i++)
{
if(num[i]>num[max])
max=i;
}
printf("%c\n%d\n",max+'A',num[max]);
for(i=0;i<num[max];i++)
printf("%d\n",a[max][i]);
} |
2 | 509 | //****************************************
//*??????? **
//*?????? 1100012763 **
//*???2011.11.14 **
//****************************************
int main()
{
int n , number , i , j , k , t , len , max;
int map[26][1000] = {0};
char name[27];
cin >> n;
for (i = 0; i <= 25; i++)
map[i][0] = 0;
for (i = 1; i <= n; i++)
{
cin >> number >> name;
len = strlen(name);
for (j = 0; j <= len - 1; j++)
{
k = name[j] - 'A';
map[k][0]++;
t = map[k][0];
map[k][t] = number;
}
}
max = 0;
for (i = 0; i <= 25; i++)
{
if (map[i][0] > max)
{
max = map[i][0];
k = i;
}
}
cout << (char)(65 + k) << endl;
cout << map[k][0];
for (i = 1; i <= map[k][0]; i++)
cout << endl << map[k][i];
return 0;
} |
2 | 510 | struct book
{
int code;
char writer[10];
};
void main()
{
int n,i,j,t=0,d,ww[27]={0};
char max,w[27];
struct book list[999];
scanf("%d",&n);
for(i=0;i<26;i++)w[i]=i+65;
for(i=0;i<n;i++)
scanf("%d %s",&list[i].code,list[i].writer);
for(i=0;i<n;i++)
for(j=0;list[i].writer[j]!='\0';j++)
{
for(d=0;d<26;d++)
if(list[i].writer[j]==w[d])ww[d]++;
}
max=ww[0];
for(i=0;i<26;i++)
if(ww[i]>max)
{
max=ww[i];
t=i;
}
printf("%c\n%d\n",w[t],ww[t]);
for(i=0;i<n;i++)
for(j=0;list[i].writer[j]!='\0';j++)
{
if(list[i].writer[j]==w[t])printf("%d\n",list[i].code);
}
} |
2 | 511 | struct worker
{
int name;
char au[20];
struct worker *next;
};
struct help
{
char author;
int max;
};
struct worker*creat(int m)
{
struct worker*p1,*p2,*p;
int i;
p1=p2=(struct worker *)malloc(sizeof(struct worker));
scanf("%d %s",&p1->name,p1->au);
p=p1;
for(i=0;i<m-1;i++)
{
p1=(struct worker *)malloc(sizeof(struct worker));
scanf("%d %s",&p1->name,p1->au);
p2->next=p1;
p2=p1;
}
p2->next=NULL;
return p;
}
void print(struct worker *p)
{
struct worker *p1;
p1=p;
while(p1!=NULL)
{
printf("%d %s\n",p1->name,p1->au);
p1=p1->next;
}
}
void most(struct worker *p)
{
struct worker *p1,*p2;
int a[30]={0},i,max;
char author;
struct help t;
p1=p;
p2=p;
while(p1!=NULL)
{
for(i=0;*(p1->au+i)!='\0';i++)
{
a[*(p1->au+i)-65]=a[*(p1->au+i)-65]+1;
}
p1=p1->next;
}
for(i=0,max=0;i<26;i++)
{
if(a[i]>max) max=a[i];
}
for(i=0;i<26;i++)
{
if(a[i]==max) author=i+65;
}
printf("%c\n%d\n",author,max);
p1=p;
while(p1!=NULL)
{
for(i=0;*(p1->au+i)!='\0';i++)
{
if(*(p1->au+i)==author) printf("%d\n",p1->name);
}
p1=p1->next;
}
}
void main()
{
struct worker *p1,*p;
struct help t;
int m;
char c;
scanf("%d",&m);
p=creat(m);
p1=p;
//print(p1);
most(p1);
}
|
2 | 512 |
struct
{
char name[20];
int num;
}book[1000];
int main()
{
int n,i,j,max=0,m=0;
scanf("%d",&n);
int c[26]={0};
for(i=0;i<n;i++)
{
scanf("%d %s",&book[i].num,book[i].name);
}
for(i=0;i<n;i++)
{
for(j=0;j<26;j++)
{
strchr(book[i].name,'A'+j)?c[j]++:0;
}
}
for(j=0;j<26;j++)
{
if(c[j]>max)
{
max=c[j];
m=j;
}
}
printf("%c\n%d\n",'A'+m,c[m]);
for(i=0;i<n;i++)
{
strchr(book[i].name,'A'+m)?printf("%d\n",book[i].num):0;
}
return 0;
}
|
2 | 513 | void main()
{
struct book
{
int x;
char z[10];
struct book *next;
}*p1,*p2,*p,*head,*t;
int i,n,max=0,j,k,l,y[400],q;char u;scanf("%d",&n);
p1=p2=head=(struct book *)malloc(sizeof(struct book));
for(i=0;i<n;i++)
{
scanf("%d %s",&p1->x,p1->z);y[i]=strlen(p1->z);
p1=(struct book *)malloc(sizeof(struct book));p2->next=p1;p2=p1;
}
p=head;
for(i=0;i<n-1;i++)
{
for(j=0;j<y[i];j++)
{
q=1;t=p->next;
for(k=i+1;k<n;k++)
{
for(l=0;l<y[k];l++)
if(p->z[j]==t->z[l])q++;
t=t->next;
}
if(q>max){max=q;u=p->z[j];}
}
p=p->next;
}
printf("%c\n%d\n",u,max);
p=head;
for(i=0;i<n;i++)
{
for(j=0;j<y[i];j++)
if(u==p->z[j]){printf("%d\n",p->x);break;}
p=p->next;
}
}
|
2 | 514 | struct book
{
int num;
char name[26];
};
struct name
{
char na;
int n;
};
void main()
{
int n,i,j,k,s,max=0;
struct book a[1000];
struct name b[26];
scanf("%d",&n);
for(i=0;i<=n-1;i++)
{
scanf("%d%s",&a[i].num,a[i].name);
}
for(i=0;i<=25;i++)
{
b[i].na='A'+i;
for(j=0,s=0;j<=n-1;j++)
{
for(k=0;k<=strlen(a[j].name)-1;k++)
{
if(b[i].na==a[j].name[k])
{
s++;
break;
}
}
}
b[i].n=s;
}
for(i=0;i<=25;i++)
{
if(b[i].n>max)
{
max=b[i].n;
}
}
for(i=0;i<=25;i++)
{
if(b[i].n==max)
{
printf("%c\n%d\n",b[i].na,b[i].n);
for(j=0;j<=n-1;j++)
{
for(k=0;k<=strlen(a[j].name)-1;k++)
{
if(b[i].na==a[j].name[k])
{
printf("%d\n",a[j].num);
break;
}
}
}
}
}
}
|
2 | 515 | struct book
{
int num;
char edit[26];
struct book *next;
};
int m;
struct book *head,*p1,*p2;
struct book *creat(void)
{
p1=(struct book*)malloc(len);
scanf("%d %s",&p1->num,p1->edit);
head=p1;
p2=p1;
m=m-1;
do
{
p1=(struct book*)malloc(len);
scanf("%d %s",&p1->num,p1->edit);
p1->next=NULL;
p2->next=p1;
p2=p1;
m=m-1;
}while(m);
return(head);
}
void main()
{
int max=0,i=0,j,k[26]={0};
struct book *head,*p;
scanf("%d",&m);
head=creat();
for(p=head;p!=NULL;)
{
for(i=0;p->edit[i]!=0;i++)
k[(p->edit[i])-65]+=1;
p=p->next;
}
for(i=0;i<26;i++)
if(k[i]>max) {max=k[i];j=i;}
printf("%c\n%d\n",j+65,max);
for(p=head;p!=NULL;)
{
for(i=0;p->edit[i]!=0;i++)
if(p->edit[i]==j+65) printf("%d\n",p->num);
p=p->next;
}
}
|
2 | 516 | struct book
{
int id;
char p[26];
};
void main()
{
int n,i,j,k,a[150]={0},flag,max=0;
struct book t,*s,o[1000],y[1000];
scanf("%d",&n);
s=(struct book *)malloc(n*sizeof(struct book));
for(i=0;i<n;i++)
{ scanf("%d %s",&s[i].id,s[i].p);
for (j=0;s[i].p[j]!='\0';j++)
a[s[i].p[j]]++;
}
for(i='A';i<='Z';i++)
if (max<a[i]) {max=a[i];j=i;}
printf("%c\n",j);
printf("%d\n",max);
for(i=0;i<n;i++)
{
flag=0;
for(k=0;s[i].p[k]!='\0';k++)
if (s[i].p[k]==j)flag=1;
if(flag==1) printf("%d\n",s[i].id);
}
} |
2 | 517 |
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<m;i++)
{
scanf("%d%s",&p->No,p->author);
if(i==m-1) p->next=NULL;
else p->next=(struct book*)malloc(sizeof(struct book));
p=p->next;
}
p=head;
while(p!=NULL)
{
char *point;
point=p->author;
while(*point!='\0')
{
(*(count+((*point)-65)))++;
point++;
}
p=p->next;
}
max=count;
for(i=0;i<26;i++)
if(*(count+i)>*max) max=count+i;
printf("%c\n",max-count+65);
printf("%d\n",*max);
p=head;
while(p!=NULL)
{
char *point;
point=p->author;
while(*point!='\0')
{
if(*point==max-count+65) printf("%d\n",p->No);
point++;
}
p=p->next;
}
return 0;
} |
2 | 518 | int main()
{
int n,i,a[2000],max=0,t,b[30]={0},j,m;
char str[1000][30];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d %s",&a[i],str[i]);
for(j=0;j<strlen(str[i]);j++){
m=str[i][j]-64;
b[m]++;
}
}
for(i=1;i<26;i++)if(b[i]>max){
max=b[i];
t=i;
}
printf("%c\n%d\n",t+64,max);
for(i=0;i<n;i++){
for(j=0;j<strlen(str[i]);j++)
if(str[i][j]==t+64)printf("%d\n",a[i]);
}
return 0;
}
|
2 | 519 | void main()
{
char s[100][30]={"\0"},c;
int i,j,k,m,n,a[26]={0},b[100]={0},t=-1;
scanf("%d",&m);
for(i=0;i<m;i++)
{
scanf("%d %s",&b[i],s[i]);
for(c='A';c<='Z';c++)
{
if(strchr(s[i],c)) a[c-65]++;
}
}
j=a[0];
k=0;
for(i=1;i<26;i++)
{
if(a[i]>j)
{
j=a[i];
k=i;
}
}
printf("%c\n%d\n",k+65,a[k]);
for(i=0;i<m;i++)
if(strchr(s[i],k+65)) printf("%d\n",b[i]);
}
|
2 | 520 | int main()
{ char p=0;
int m,i,j,max[1000];
struct book{
int num;
char s[27];
} book[1000];
memset(max,0,sizeof(max));
scanf("%d",&m);
for(i=0;i<m;i++)
{scanf("%d%s",&book[i].num,book[i].s);}
for(i=0;i<m;i++)
{for(j=0;book[i].s[j];j++)
{ if(++max[book[i].s[j]]>max[p])
p=book[i].s[j];
}}
printf("%c\n%d\n",p,max[p]);
for(i=0;i<m;i++)
{if(strchr(book[i].s,p))
printf("%d\n",book[i].num);}
return 0;
} |
2 | 521 | 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;
else p2->next=p1;
p2=p1;
}
p2->next=NULL;
p1=head;
for(i=0;i<26;i++)
a[i]=0;
for(i=0;i<m;i++)
{
n=strlen(p1->name);
for(j=0;j<n;j++)
{k=p1->name[j]-'A';a[k]++;
}
p1=p1->next;
}
max=a[0];
first=0;
for(k=1;k<26;k++)
{if(a[k]>max) {max=a[k];
first=k;}
}
printf("%c\n",'A'+first);
printf("%d\n",max);
p1=head;
for(i=0;i<m;i++)
{
n=strlen(p1->name);
for(j=0;j<n;j++)
{
if(p1->name[j]=='A'+first) {printf("%d\n",p1->num);
break;}
}
p1=p1->next;
}
}
|
2 | 522 | struct book
{
int num;
char au[32];
int sta[27];
}b[1020];
int main()
{
int i,j,k,m,n;
char c;
scanf("%d",&m);
for(i=0;i<m;i++)
{
scanf("%d %s",&b[i].num,b[i].au);
}
for(i=0;i<m;i++)
{
//scanf("%d %s",&b[i].num,&b[i].au);
for(j=0;;j++)
{
c=b[i].au[j];
if(c=='\0')
{
break;
}
else
{
b[i].sta[c-64]++;
}
}
}
int sum[27]={0};
for(i=0;i<m;i++)
{
for(j=1;j<27;j++)
{
sum[j]+=b[i].sta[j];
}
}
int max=0;
for(i=1;i<27;i++)
{
if(sum[i]>max)
{
max=sum[i];
k=i;
}
}
printf("%c\n",k+64);
n=0;
for(i=0;i<m;i++)
{
if(b[i].sta[k]!=0)
{
n++;
}
}
printf("%d\n",n);
n=0;
for(i=0;i<m;i++)
{
if(b[i].sta[k]!=0)
{
n++;
if(n==1)
{
printf("%d",b[i].num);
}
else
{
printf("\n%d",b[i].num);
}
}
}
return 0;
} |
2 | 523 | struct tushu
{
int num;
char name[20];
struct tushu *next;
};
struct tushu *creat(int m)
{
struct tushu *head,*p1,*p2;
p1=p2=(struct tushu *)malloc(LEN);
scanf("%d%s",&p1->num,p1->name);
head=p1;
int i;
for(i=2;i<=m;i++)
{
p1=(struct tushu *)malloc(LEN);
scanf("%d%s",&p1->num,p1->name);
p2->next=p1;
p2=p1;
}
p2->next=NULL;
return(head);
}
int main()
{
int m,num[26]={0},i,max;
scanf("%d",&m);
struct tushu *head,*p1;
head=creat(m);
char *x;
for(i=0;i<26;i++)
{
p1=head;
x=p1->name;
while(p1!=NULL)
{
while(*x!='\0')
{
if(*x==(i+65))
num[i]=num[i]+1;
x=x+1;
}
p1=p1->next;
x=p1->name;
}
}
max=0;
for(i=1;i<26;i++)
{
if(num[max]<num[i])
max=i;
}
printf("%c\n",max+65);
printf("%d\n",num[max]);
p1=head;
x=p1->name;
while(p1!=NULL)
{
while(*x!='\0')
{
if(*x==(max+65))
{
printf("%d\n",p1->num);
break;
}
x=x+1;
}
p1=p1->next;
x=p1->name;
}
return 0;
} |
2 | 524 |
struct book{
int co;
char A[26];
};
int main(){
int m,i,k,max;
int count[26];
int *cc;
scanf("%d",&m);
struct book *bk=(struct book*)malloc(sizeof(struct book)*m);/*??????*/
struct book *p;
p=bk;
for(i=0;i<m;i++,p++){
scanf("%d %s",&(p->co),p->A);
}
cc=count;/*?? */
memset(count,0,sizeof(count));/*????*/
for(i=0;i<26;i++,cc++){
p=bk;
for (k=0;k<m;k++,p++)
{
if (strchr(p->A,'A'+i))
{
(*cc)++;
}
}/*??*/
}
max=0;
for (i=0;i<26;i++)
{
if (count[i]>count[max])
{
max=i;
}
}
printf("%c\n%d\n",'A'+max,count[max]);
p=bk;
for (i=0;i<m;i++,p++)
{
if (strchr(p->A,'A'+max))
{
printf("%d\n",p->co);
}
}
free(bk);
return 0;
} |
2 | 525 | int main()
{
int a[999];char r[999][26];int b[125]={0};int n,i,j,maxi,s;
scanf("%d",&n);
for(i=0;i<=n-1;i++)
{
scanf("%d",&a[i]);
scanf("%s",r[i]);
s=strlen(r[i])-1;
for(j=0;j<=s;j++)
{
b[r[i][j]]=b[r[i][j]]+1;
}
}
maxi=65;
for(i=66;i<=90;i++)
{
if(b[i]>b[maxi]) maxi=i;
}
printf("%c\n",maxi);
printf("%d\n",b[maxi]);
for(i=0;i<=n-1;i++)
{
s=strlen(r[i])-1;
for(j=0;j<=s;j++)
{
if(r[i][j]==maxi)
{
printf("%d\n",a[i]);
break;
}
}
}
return 0;
}
|
2 | 526 |
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);
for(i=0;i<n;i++)
{
scanf("%d %s",&author[i].number,&author[i].name);
}
for(i=0;i<n;i++)
{
for(j=0;j<26;j++)
{
for(k=0;k<26;k++)
{
if(single[k].letter[0]==author[i].name[j])
single[k].number++;
}
}
}
m=0;
p=single[0].number;
for(i=1;i<26;i++)
{
if(p<single[i].number)
{
p=single[i].number;
m=i;
}
}
k=0;
for(i=0;i<n;i++)
{
for(j=0;j<26;j++)
{
if(author[i].name[j]==single[m].letter[0])
{
book[k]=author[i].number;
k++;
}
}
}
printf("%c\n",single[m].letter[0]);
printf("%d\n",k);
for(i=0;i<k;i++)
{
printf("%d\n",book[i]);
}
return 0;
}
|
2 | 527 | int main(int argc, char* argv[])
{
int s[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};
struct book{
int a;
char name[27];
};
struct book list[999];
char c;
int n,i,j,b,maxnum=0,max;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d%s",&list[i].a,list[i].name);
for(j=0;list[i].name[j]!='\0';j++){
c=list[i].name[j];
b=c-'A';
s[b]++;
}
}
for(i=0;i<26;i++){
if(s[i]>maxnum){
maxnum=s[i];
max=i;
}
}
printf("%c\n%d\n",'A'+max,maxnum);
for(i=0;i<n;i++){
for(j=0;list[i].name[j]!='\0';j++){
if(list[i].name[j]-'A'==max){
printf("%d\n",list[i].a);
}
}
}
return 0;
}
|
2 | 528 |
int main()
{
int book[1000], m, i, j, k, length, max = 0, name[500] = {0};
char writer[1000][26], name1;
cin >> m;
for (i = 0; i < m; i++)
cin >> book[i] >> writer[i];
for (k = 'A'; k <= 'Z'; k++)
{
for (i = 0; i < m; i++)
{
length = strlen(writer[i]);
for (j = 0; j < length; j++)
if (writer[i][j] == k)
name[k]++;
}
if (name[k] > max)
{
max = name[k];
name1 = k;
}
}
cout << name1 << endl;
cout << max << endl;
for (i = 0; i <= m; i++)
{
length = strlen(writer[i]);
for (j = 0; j <= length; j++)
if (writer[i][j] == name1)
cout << book[i] << endl;
}
return 0;
}
|
2 | 529 | int main()
{
int record[26][1000];
memset(record,0,sizeof(record));
char name[10];
int m,temp;
cin>>m;
for (int i=0;i<m;i++)
{
cin>>temp;
cin.get();
cin.getline(name,10);
for (int i=0;i<strlen(name);i++)
{
record[name[i]-65][record[name[i]-65][0]+1]=temp;
record[name[i]-65][0]++;
}
}
int flag=0;
for (int i=0;i<25;i++)
{
if (record[i][0]>record[flag][0])
{
flag=i;
}
}
cout<<(char)(flag+65)<<endl<<record[flag][0]<<endl;
for (int i=1;i<=record[flag][0];i++)
{
cout<<record[flag][i]<<endl;
}
return 0;
} |
2 | 530 | struct book
{
char num[4];
char author[27];
}book[100];
int main()
{
int n,i,k,sz[26],t,m,e;
scanf("%d",&n);
m=0;
for(i=0;i<26;i++){
sz[i]=0;
}
for(i=0;i<n;i++){
scanf("%s%s",book[i].num,book[i].author);
t=strlen(book[i].author);
for(k=0;k<t;k++){
sz[book[i].author[k]-'A']++;
}
}for(i=0;i<26;i++){
if(sz[i]>m){
m=sz[i];
e=i;
}
}printf("%c\n%d\n",e+'A',m);
for(i=0;i<n;i++){
t=strlen(book[i].author);
for(k=0;k<t;k++){
if(book[i].author[k]==e+'A'){
printf("%s\n",book[i].num);
}
}
}return 0;
} |
2 | 531 | main()
{
int n;
scanf("%d",&n);
struct
{
int num;
char a[25];
}book [999];
int i,j;
for(i=0;i<=n-1;i++)
{
scanf("%d %s",&book[i].num,book[i].a);
}
int s[26]={0};
for(i=0;i<=n-1;i++)
{
int len=strlen(book[i].a);
for(j=0;j<len;j++)
{
s[book[i].a[j]-'A']++;
}
}
int max=0;
char name;
for(i=0;i<=25;i++)
{
if(s[i]>max)
{
max=s[i];
name='A'+i;
}
}
printf("%c\n",name);
printf("%d\n",max);
for(i=0;i<=n-1;i++)
{
int len=strlen(book[i].a);
for(j=0;j<len;j++)
{
if(book[i].a[j]==name)
printf("%d\n",book[i].num);
}
}
}
|
2 | 532 | struct book{
int num1;
char au[27];
}bk[1000];
struct author{
char name;
int a;
int num2[1000];
}aur[27];
int main()
{
int n,i,j;
struct author max;
max.a=0;
for(j=0;j<26;j++){
aur[j].name=65+j;
aur[j].a=0;
}
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d %s",&bk[i].num1,bk[i].au);
}
//??????,?????
for(i=0;i<n;i++){
for(j=0;bk[i].au[j]!='\0';j++){
aur[bk[i].au[j]-65].num2[aur[bk[i].au[j]-65].a]=bk[i].num1;
aur[bk[i].au[j]-65].a++;
}
}
//??????????
for(i=0;i<26;i++){
if(aur[i].a>max.a)max=aur[i];
}
printf("%c\n%d\n",max.name,max.a);
for(i=0;i<max.a;i++){
printf("%d\n",max.num2[i]);
}
return 0;
}
|
2 | 533 | struct book
{
int num;
char name[26];
struct book *next;
};
struct book *creat(int n)
{
int i;
struct book *head;
struct book *p1,*p2;
p1=p2=(struct book *)malloc(LEN);
scanf("%d %s",&p1->num,p1->name);
head=NULL;
for(i=0;i<n-1;i++)
{
if(i==0)head=p1;
p1=(struct book*)malloc(sizeof(struct book));
scanf("%d %s",&p1->num,p1->name);
p2->next=p1;
p2=p1;
}
p2->next=NULL;
return (head);
}
void main()
{
int i,n,a[26]={0},max=0,j,k=0;
char t;
struct book *p,*p1;
scanf("%d",&n);
p=creat(n);
p1=p;
for(j=0;j<n;j++)
{
for(i=0;*(p->name+i)!='\0';i++)
a[*(p->name+i)-65]=a[*(p->name+i)-65]+1;
p=p->next;
}
for(i=0;i<26;i++)
{
if(a[i]>max){max=a[i];k=i;}
}
printf("%c\n%d\n",(k+65),max);
t=(char)(k+65);
while(p1!=NULL)
{
for(i=0;*(p1->name+i)!='\0';i++)
{
if(*(p1->name+i)==t)
{
printf("%d\n",p1->num);
break;
}
}
p1=p1->next;
}
}
|
2 | 534 | struct book
{
int num;
char str[26];
}bk[1000];
void main()
{
int m,i,j,k,s,n=0;
char a[26]={'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','R','S','T','U','V','W','X','Y','Z'};
int b[26]={0};
scanf("%d",&m);
for(i=0;i<m;i++)
scanf("%d %s",&bk[i].num,bk[i].str);
for(i=0;i<m;i++)
for(j=0;j<strlen(bk[i].str);j++)
for(k=0;k<26;k++)
if(a[k]==bk[i].str[j])
b[k]++;
for(i=0;i<26;i++)
if(b[i]>n)
{
n=b[i];
s=i;
}
printf("%c\n%d\n",a[s],b[s]);
for(i=0;i<m;i++)
for(j=0;j<strlen(bk[i].str);j++)
if(bk[i].str[j]==a[s])
printf("%d\n",bk[i].num);
}
|
2 | 535 | int main()
{
int m,shu[1000],num[26],length[1000];
char author[1000][26],maxauthor;
cin>>m;
memset(num,0,sizeof(num));
for(int i=0;i<m;i++)
{
cin>>shu[i]>>author[i];
length[i]=strlen(author[i]);
for(int j=0;j<length[i];j++)//??????????
num[author[i][j]-'A']+=1;
}
int maxnum=0;
for(int i=0;i<26;i++)
{
if(maxnum<num[i])
maxnum=num[i];//???????????
}
for(int i=0;i<26;i++)
{
if(num[i]==maxnum)//???????????
{
maxauthor=(char)('A'+i);
cout<<maxauthor<<endl;
cout<<maxnum<<endl;
break;
}
}
for(int i=0;i<m;i++)
{
for(int j=0;j<length[i];j++)
{
if(author[i][j]==maxauthor)//????????
cout<<shu[i]<<endl;
}
}
return 0;
}
|
2 | 536 |
struct book
{
int number;
char name[26];
int num[26];
};
void mostbook(struct book *p)
{
int i,j,k;
k=strlen(p->name);
for(j=0;j<26;j++) //???num???
{
p->num[j]=0;
}
for(i=0;i<k;i++)
(p->num[(p->name[i]-'A')])++;
}
void main()
{
int i,j,m;
int max=0;
int maxi=0;
int s[26]={0};
//printf("???????:\n");
scanf("%d",&m);
struct book *p;
p=(struct book *)malloc(m*sizeof(struct book));
for(i=0;i<m;i++)
{
// printf("????????\n");
scanf("%d",&(p+i)->number);
scanf("%s",&(p+i)->name);
mostbook(p+i);
for(j=0;j<26;j++)
s[j]+=((p+i)->num[j]);
}
for(i=0;i<26;i++)
{
if(s[i]>=max)
{
max=s[i];
maxi=i;
}
}
//printf("????????\n");
printf("%c\n",(maxi+'A'));
//printf("?????\n");
printf("%d\n",max);
//printf("?????\n");
for(i=0;i<m;i++)
{
int k,j;
k=strlen((p+i)->name); //??i?book??
for(j=0;j<k;j++)
{
if((p+i)->name[j]==(maxi+'A')) //??i?book??
{
printf("%d\n",(p+i)->number);
continue; //????????????????continue
}
}
}
}
|
2 | 537 | 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++){
if(bo[k].writer[j]==i){
a++;
}
}
}
if(a>max){
max=a;
b=i;
}
}
printf("%c\n%d\n",b,max);
for(j=0;j<n;j++){
for(i=0;i<28;i++){
if(bo[j].writer[i]==b){
printf("%d\n",bo[j].num);
}
}
}
return 0;
} |
2 | 538 |
struct Books
{
int num;
char author[26];
}a[1000];
int main()
{
int n;
int i,j;
int x;
int max=0;
char letter='A';
int b[26]={0};
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d %s",&a[i].num,a[i].author);
}//??a[];
for(i=0;i<n;i++)
{
for(j=0;;j++)
{
if(a[i].author[j]>=65 && a[i].author[j]<=90)
{
x=a[i].author[j];//x:65-90
b[x-65]++;
}else{
break;
}
}
}//?????
// for(i=0;i<26;i++)
// {
// printf("%d\n",b[i]);
// }
for(i=0;i<26;i++)
{
if(b[i]>max)
{
max=b[i];
letter=i+65;
}
}
printf("%c\n%d\n",letter,max);
for(i=0;i<n;i++)
{
for(j=0;j<26;j++)
{
if(a[i].author[j]==letter)
{
printf("%d\n",a[i].num);
}
}
}
return 0;
} |
2 | 539 | void main()
{
int n,i,j,max=0;
scanf("%d",&n);
int num[1000];
int sum[26];
for(i=0;i<26;i++){
sum[i]=0;
}
char a[1000][27];
for(i=0;i<n;i++){
scanf("%d %s",&num[i],a[i]);
}
for(i=0;i<n;i++){
for(j=0;a[i][j]!='\0';j++){
sum[a[i][j]-'A']=sum[a[i][j]-'A']+1;
}
}
for(i=1;i<26;i++){
if(sum[i]>sum[max]){
max=i;
}
}
printf("%c\n",max+'A');
printf("%d\n",sum[max]);
for(i=0;i<n;i++){
for(j=0;a[i][j]!='\0';j++){
if(a[i][j]==max+'A'){
printf("%d\n",num[i]);
break;
}
}
}
}
|
2 | 540 | int main(){
int n,i,j,k,z;
char max;
int sum[999]={0};
struct student{
int a;
char b[26];
int c[26];
}x[999];
scanf("%d\n",&n);
for(i=0;i<n;i++){
scanf("%d ",&x[i].a);
for(j=0;;j++){
scanf("%c",&x[i].b[j]);
if(x[i].b[j]=='\n')
break;
x[i].c[x[i].b[j]-65]++;}
}
for(k=0;k<26;k++){
for(i=0;i<999;i++){
sum[k]=sum[k]+x[i].c[k];
}
}
z=sum[0];
max=65;
for(k=1;k<26;k++){
if(sum[k]>z){
max=k+65;
z=sum[k];
}
}
printf("%c\n",max);
printf("%d\n",z);
for(i=0;i<n;i++){
if(x[i].c[max-65]>0){
printf("%d\n",x[i].a);
}
}
scanf("%d",i);
return 0;}
|
2 | 541 | int main()
{
int i,j,n,x[1000],a[26],b,c,num=0;
char s[1000][26];
for(i=0;i<25;i++)
a[i]=0;
cin>>n;
for(i=0;i<n;i++)
{
cin>>x[i]>>s[i];
for(j=0;s[i][j]!='\0';j++)
a[(int)s[i][j]-65]++;
}
b=a[0];
c=0;
for(i=1;i<26;i++)
if(b<a[i])
{
b=a[i];
c=i;
}
cout<<(char)(c+65)<<endl;
for(i=0;i<n;i++)
for(j=0;s[i][j]!='\0';j++)
if(s[i][j]==(char)c+65)
num++;
cout<<num<<endl;
for(i=0;i<n;i++)
for(j=0;s[i][j]!='\0';j++)
if(s[i][j]==(char)c+65)
{
cout<<x[i]<<endl;
break;
}
return 0;
} |
2 | 542 |
int cishu[26];
struct shu
{
int num;
char name[26];
struct shu *next;
};
struct shu *app(int n)
{
int i,len,j;
struct shu *newnode ,*p, *head;
for(i=1;i<=n;i++)
{
newnode=(struct shu *)malloc(sizeof(struct shu));
scanf("%d %s", &newnode->num , newnode->name );
len=strlen(newnode->name );
for(j=0;j<len;j++)
{
cishu[newnode->name[j]-'A']++;
}
if(i==1)
{
head=newnode;
}
else
{
p->next =newnode;
}
p=newnode;
}
p->next =0;
return head;
}
int max(void)
{
int m=0, i ,x;
for(i=0;i<26;i++)
{
if(cishu[i]>m)
{m=cishu[i];
x=i;}
}
return x;
}
int cunzai(char a[],int kk)
{
int l,i;
l=strlen(a);
for(i=0;i<l;i++)
{
if(a[i]==kk+'A')
return 1;
}
return 0;
}
int main()
{
int n,kk;
struct shu *head, *p;
scanf("%d",&n);
head=app(n);
kk=max();
printf("%c\n%d\n", 'A'+kk, cishu[kk]);
for(p=head;p!=0;p=p->next )
{
if(cunzai(p->name ,kk))
{printf("%d\n",p->num );}
}
return 0;
}
|
2 | 543 |
struct chs{
char zz[27];
int num;
}cs[],*p;
int main(){
int n;
scanf("%d",&n);
struct chs *cs=(struct chs *)malloc(sizeof(struct chs)*n);
for(p=cs;p<cs+n;p++){
scanf("%d%s",&(p->num),p->zz);
}
int l,a,zm[26],*z;
for(z=zm;z<zm+26;z++){
*z=0;
}
char *q;
for(p=cs;p<cs+n;p++){
l=strlen(p->zz);
for(q=p->zz;*q!='\0';q++){
a=(int)(*q);
(*(zm+a-65))++;
}
}
int max=0;
for(z=zm;z<zm+26;z++){
if(*z>*(zm+max)){
max=z-zm;
}
}
printf("%c\n%d\n",(char)(max+65),*(zm+max));
for(p=cs;p<cs+n;p++){
l=strlen(p->zz);
for(q=p->zz;*q!='\0';q++){
a=(int)(*q);
if((a-65)==max){
printf("%d\n",p->num);
}
}
}
free(cs);
return 0;
}
|
2 | 544 |
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;
}
for(i=0;i<n;i++)
{
for(j=0;j<a[i].l;j++)
{
for(k=65;k<=90;k++)
{
if(a[i].y[j]==k)b[k-65].x=b[k-65].x+1;
}
}
}
int max=b[0].x;
for(i=0;i<=25;i++)
{
if(b[i].x>max)max=b[i].x;
}
for(i=0;i<=25;i++)
{
if(b[i].x==max)
{
printf("%c\n",b[i].y);
printf("%d\n",b[i].x);
for(j=0;j<n;j++)
{
for(p=0;p<a[j].l;p++)
{
if(a[j].y[p]==b[i].y)
{printf("%d\n",a[j].x);break;}
}
}
break;
}
}
}
return 0;
} |
2 | 545 | int main(){
int n[26]={0};
char z[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'};
char nn[26][100][20];
int m,i,j,r;
char a[100][100];
scanf("%d",&m);
for(j=0;j<m;j++){
scanf("%s",a[j]);
char b[20];
scanf("%s",b);
int w=strlen(b);
for(i=0;i<w;i++){
for(r=0;r<26;r++){
if(b[i]==z[r]){
n[r]++;
strcpy(nn[r][n[r]],a[j]);
}
}
}
}
int c=0;
for(r=1;r<26;r++){
if(n[r]>n[c])
c=r;
}
printf("%c\n%d\n",z[c],n[c]);
for(i=1;i<=n[c];i++){
printf("%s\n",nn[c][i]);
}
}
|
2 | 546 | int main()
{
int n;
cin>>n;
int book[1000];
char author[1000][10];
int i,j;
for(i=0;i<n;i++){
cin>>book[i]>>author[i];
}
int num[26]={0};
for(i=0;i<n;i++){
int length;
length=strlen(author[i]);
for(j=0;j<length;j++){
num[author[i][j]-'A']++;
}
}
int max=0;
char maxi;
for(i=0;i<26;i++){
if(num[i]>max){
max=num[i];
maxi='A'+i;
}
}
cout<<maxi<<endl;
int sum=0;
for(i=0;i<n;i++){
int length;
length=strlen(author[i]);
for(j=0;j<length;j++){
if(author[i][j]==maxi){
sum++;
}
}
}
cout<<sum<<endl;
for(i=0;i<n;i++){
int length;
length=strlen(author[i]);
for(j=0;j<length;j++){
if(author[i][j]==maxi){
cout<<book[i]<<endl;
}
}
}
return 0;
} |
2 | 547 | int main()
{
int m,i,j,k=0;
struct
{int n;
char s[26];
}book[999];
scanf("%d",&m);
for(i=0;i<m;i++)
scanf("%d %s",&book[i].n,&book[i].s);
int a[26]={0};
for(i=0;i<m;i++)
for(j=0;book[i].s[j]!='\0';j++)
a[(int)(book[i].s[j]-'A')]++;
for(i=1;i<26;i++)
if(a[k]<a[i])
k=i;
printf("%c\n%d\n",k+'A',a[k]);
for(i=0;i<m;i++)
for(j=0;book[i].s[j]!='\0';j++)
if(book[i].s[j]==k+'A')
{
printf("%d\n",book[i].n);
break;
}
} |
2 | 548 |
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++)
{
if (au[i][j] == 'A') maxn[0] ++;
if (au[i][j] == 'B') maxn[1] ++;
if (au[i][j] == 'C') maxn[2] ++;
if (au[i][j] == 'D') maxn[3] ++;
if (au[i][j] == 'E') maxn[4] ++;
if (au[i][j] == 'F') maxn[5] ++;
if (au[i][j] == 'G') maxn[6] ++;
if (au[i][j] == 'H') maxn[7] ++;
if (au[i][j] == 'I') maxn[8] ++;
if (au[i][j] == 'J') maxn[9] ++;
if (au[i][j] == 'K') maxn[10] ++;
if (au[i][j] == 'L') maxn[11] ++;
if (au[i][j] == 'M') maxn[12] ++;
if (au[i][j] == 'N') maxn[13] ++;
if (au[i][j] == 'O') maxn[14] ++;
if (au[i][j] == 'P') maxn[15] ++;
if (au[i][j] == 'Q') maxn[16] ++;
if (au[i][j] == 'R') maxn[17] ++;
if (au[i][j] == 'S') maxn[18] ++;
if (au[i][j] == 'T') maxn[19] ++;
if (au[i][j] == 'U') maxn[20] ++;
if (au[i][j] == 'V') maxn[21] ++;
if (au[i][j] == 'W') maxn[22] ++;
if (au[i][j] == 'X') maxn[23] ++;
if (au[i][j] == 'Y') maxn[24] ++;
if (au[i][j] == 'Z') maxn[25] ++;
}
}
for (i = 0; i < 26; i ++)
{
if (maxn[i] > n) {n = maxn[i];ni = i;}
}
cout << (char)(ni+65) << endl;
cout << n << endl;
for (i = 0 ; i < m; i ++)
{
for ( j = 0;au[i][j] != '\0';j ++)
{
if (au[i][j] == 65+ni) cout << num[i] << endl;
}
}
return 0;
} |
2 | 549 | struct book
{
char num[4];
char author[26];
}book[999];
int main()
{
int n;
scanf ("%d", &n);
int i,j;
int a;
char c;
int max=0;
for (i=0;i<=n-1;i++)
{
scanf ("%s %s", &book[i].num, book[i].author);
}
int s[26];
for (i=0;i<=25;i++)
{
s[i]=0;
}
for (i=0;i<=n-1;i++)
{
for (j=0;j<=25;j++)
{
if (0<=(book[i].author[j]-'A')&&(book[i].author[j]-'A')<=25)
{
a=book[i].author[j]-'A';
s[a]=s[a]+1;
}
}
}
for (i=0;i<=25;i++)
{
if (max<s[i])
{
max=s[i];
}
}
for (i=0;i<=25;i++)
{
if (max==s[i])
{
c='A'+i;
}
}
printf ("%c\n", c);
printf ("%d\n", max);
for (i=0;i<=n-1;i++)
{
for (j=0;j<=25;j++)
{
if (book[i].author[j]==c)
{
printf ("%s\n", book[i].num);
}
}
}
return 0;
}
|
2 | 550 | void main()
{
int i,j,k,n,max;
int a[1000],b[26];
char name[1000][26];
scanf("%d",&n);
for(i=0;i<26;i++)
b[i]=0;
for(i=0;i<n;i++){
scanf("%d%s",&a[i],name[i]);
for(j=0;j<strlen(name[i]);j++)
b[name[i][j]-'A']++;
}
max=0;
for(k=1;k<26;k++)
if(b[k]>b[max])
max=k;
printf("%c\n%d\n",max+'A',b[max]);
for(i=0;i<n;i++)
for(j=0;j<strlen(name[i]);j++)
if(name[i][j]==max+'A'){
printf("%d\n",a[i]);
break;
}
} |
2 | 551 |
struct book
{
int number;
char writer[26];
struct book *next;
}
main()
{
int n,i,j,num[26]={0},nu[26],a,b;
struct book *head,*p1,*p2;
scanf("%d",&n);
p1=p2=(struct book *)malloc(LEN);
for(i=0;i<n;i++)
{
scanf("%d%s",&p1->number,&p1->writer);
for(j=0;j<strlen(p1->writer);j++)
{
++num[p1->writer[j]-65];
}
if(i==0)
head=p1;
else
p2->next=p1;
p2=p1;
p1=(struct book *)malloc(LEN);
}
p2->next=NULL;
for(i=0;i<26;i++)
{
nu[i]=i;
}
for(i=0;i<25;i++)
{
for(j=0;j<25-i;j++)
{
if(num[j]<num[j+1])
{
a=nu[j];
nu[j]=nu[j+1];
nu[j+1]=a;
b=num[j];
num[j]=num[j+1];
num[j+1]=b;
}
}
}
printf("%c\n%d\n",nu[0]+65,num[0]);
for(i=0;i<n;i++)
{
for(j=0;j<strlen(head->writer);j++)
{
if(head->writer[j]==(char)nu[0]+65)
{
printf("%d\n",head->number);
break;
}
}
head=head->next;
}
} |
2 | 552 |
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++){
auth[book[i].au[j]-'A']++;
}
}
max=0;
for(i=0;i<26;i++)
{
if(max<auth[i]) {
max=auth[i];
maxa=i+'A';
}
}
printf("%c\n",maxa);
printf("%d\n",max);
for(i=0;i<n;i++){
if(strchr(book[i].au,maxa))
printf("%s\n",book[i].id);
}
return 0;
} |
2 | 553 | 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]+1;
}
}
max=0;
for(i=0;i<26;i++)
{
if(a[i]>max)
{
max=a[i];
k=i;
}
}
printf("%c\n%d\n",k+65,max);
for(i=0;i<a[k]-1;i++)
{
printf("%d\n",b[k][i]);
}
printf("%d",b[k][a[k]-1]);
} |
2 | 554 | //********************************
//*???? ??(13.8) ????
//********************************
int main()
{
int n,i,nu,au,M,m;
int num[26] = {0};
int no[26][999];
char aut;
cin >> n;
for(i = 0; i < n; i++)
{
cin >> nu;
cin.get();
aut = cin.get();
while (aut != 10)
{
au = (int)(aut - 'A');
no[au][num[au]] = nu;
num[au]++;
aut = cin.get();
}
}
M = 0;
for(i = 0; i < 26; i++)
{
if(M < num[i])
{
M = num[i];
m = i;
}
}
cout << (char)(m + 'A') << endl;
cout << M << endl;
for(i = 0; i < M; i++)
cout << no[m][i] << endl;
cin.get();
cin.get(); //????
return 0;
}
|
2 | 555 | int main()
{
struct Book{
int id;
char zz[26];
}book[1000];
int n,i,j,max=0,index;
int sum[26]={0};
char author;
scanf("%d",&n);
for (i=0;i<n;i++){
scanf("%d%s",&book[i].id,&book[i].zz);
}
for (i=0;i<n;i++){
for (j=0;book[i].zz[j]!='\0';j++){
sum[book[i].zz[j]-'A']++;
}
}
for (i=0;i<26;i++){
if (sum[i]>max){
max=sum[i];
author='A'+i;
}
}
printf("%c\n%d\n",author,max);
for (i=0;i<n;i++){
for (j=0;book[i].zz[j]!='\0';j++){
if (book[i].zz[j]==author){
printf("%d\n",book[i].id);
break;
}
}
}
return 0;
} |
2 | 556 | int main()
{
int n,a[1000],c[26]={0},max1=0,temp;
char m[1000][26],max2;
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>a[i-1];
getchar();
cin.getline(m[i-1],26);
}
for(int i=0;i<n;i++)
for(int j=0;j<26;j++)
{
c[m[i][j]-'A']++;
}
//cout<<c[1]<<endl;
for(int s=0;s<26;s++)
{
//cout<<c[s]<<" "<<max1<<endl;
if(max1<=c[s])
{
max1=c[s];
temp=s+'A';
max2=temp;
}
}
cout<<max2<<endl;
cout<<max1<<endl;
for(int i=0;i<n;i++)
for(int j=0;j<26;j++)
if(m[i][j]==max2)
{
cout<<a[i]<<endl;
break;
}
return 0;
}
|
2 | 557 | int main()
{
int a[100][100],b[27],max= 0;
int i , j , n , k , t ,len = 0;
char str[100][27];
scanf("%d",&n);
memset( a, 0 ,sizeof(a) );
memset( b ,0 ,sizeof(b) );
for( i = 1;i <= n;i++ )
{
scanf( "%d",&a[i][1]);
scanf("%s",str[i]);
len = strlen (str[i]);
for( j = 0;j < len;j++ )
{
k = str[i][j]-'A';
b[k]++;
a[i][k+65] = 1;
}
}
for( i = 0;i <= 25 ;i++ )
{
if( b[i] >max )
{
max= b[i];
t = i;
}
}
printf("%c\n%d\n",t+'A',max);
for( i = 1;i <= n;i++ )
{
if( a[i][t+'A']==1 )
printf("%d\n",a[i][1]);
}
}
|
2 | 558 |
int main()
{
char ma='A';
int cnt[ASCII]={0};
int i,j,n;
struct {
int id;
char au[MAX_N+1];
}bk[MAX_M];
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].au[j]]>cnt[ma])
{
ma=bk[i].au[j];
}
}
}
printf("%c\n%d\n",ma,cnt[ma]);
for(i=0;i<n;i++)
{ if(strchr(bk[i].au,ma))
{
printf("%d\n",bk[i].id);
}
}
return 0;
}
|
2 | 559 |
struct book{
int num;
char writer[27];
};
void main()
{
struct book *p,*head;
int n,i,j,max,maxi;
int l[26]={0},lnum[999];
void count(int *l,struct book *p,int lnum);
int read(struct book *p);
scanf("%d",&n);
head=p=(struct book *)calloc(n,sizeof(struct book));
for(i=0;i<n;i++,p++)
{
lnum[i]=read(p);
}
p=head;
for(i=0;i<n;i++)
{
count(l,p,lnum[i]);
p++;
}
max=l[0]; maxi=0;
for(i=1;i<26;i++)
{
if(max<l[i])
{
max=l[i];
maxi=i;
}
}
printf("%c\n",65+maxi);
printf("%d\n",max);
p=head;
for(i=0;i<n;i++)
{
for(j=0;j<lnum[i];j++)
{
if(p->writer[j]==65+maxi)
{
printf("%d\n",p->num);
break;
}
}
p++;
}
}
int read(struct book *p)
{
int i=0;
char d;
scanf("%d",&p->num);
d=getchar();
d=getchar();
do{
p->writer[i]=d;
i++;
}while((d=getchar())!='\n');
return(i);
}
void count(int *l,struct book *p,int lnum)
{
int i;
for(i=0;i<lnum;i++)
{
switch(p->writer[i])
{
case'A':l[0]++; break; case'B':l[1]++; break;
case'C':l[2]++; break; case'D':l[3]++; break;
case'E':l[4]++; break; case'F':l[5]++; break;
case'G':l[6]++; break; case'H':l[7]++; break;
case'I':l[8]++; break; case'J':l[9]++; break;
case'K':l[10]++; break; case'L':l[11]++; break;
case'M':l[12]++; break; case'N':l[13]++; break;
case'O':l[14]++; break; case'P':l[15]++; break;
case'Q':l[16]++; break; case'R':l[17]++; break;
case'S':l[18]++; break; case'T':l[19]++; break;
case'U':l[20]++; break; case'V':l[21]++; break;
case'W':l[22]++; break; case'X':l[23]++; break;
case'Y':l[24]++; break; case'Z':l[25]++; break;
}
}
} |
2 | 560 | struct book
{
int mun;
char name[26];
}a[999];
int main()
{
int n,i,j,l,q=0;
char k;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d %s",&a[i].mun,a[i].name);
}
int w[26]={0};
for(i=0;i<n;i++)
{
l=strlen(a[i].name);
for(j=0;j<l;j++)
{
k=a[i].name[j];
w[k-65]++;
/*for(k='A';k<='Z';k++)
{
if(a[i].name[j]==k)
{
q=k-65;
w[q]++;
}
}*/
}
}
int max;
max=w[0];
int flag=0;
for(i=0;i<26;i++)
{
if(w[i]>max)
{max=w[i];flag=i;}
}
printf("%c\n",flag+65);
printf("%d\n",w[flag]);
for(i=0;i<n;i++)
{
l=strlen(a[i].name);
for(j=0;j<l;j++)
{
if(a[i].name[j]==(flag+65))
printf("%d\n",a[i].mun);
}
}
return 0;
}
|
2 | 561 | 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;
if(i!=(n-1)) p1=p2->next=(struct author*)malloc(LEN);
else {p2->next=NULL;}
}
for(i=0;i<26;i++)
{
a[i]=0;
}
p1=head;
for(p1=head;p1!=NULL;p1=p1->next)
{
for(j=0;j<strlen(p1->name);j++)
{
a[p1->name[j]-'A']++;
}
}
t=0;
for(i=0;i<26;i++)
{
if(a[i]>a[t]) t=i;
}
printf("%c\n%d\n",t+'A',a[t]);
for(p1=head;p1!=NULL;p1=p1->next)
{
for(j=0;j<strlen(p1->name);j++)
{
if(p1->name[j]==t+'A') printf("%d\n",p1->num);continue;
}
}
}
|
2 | 562 | 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++)
{ if(b[i]>max)
{max=b[i];
j=i;}}
m=j+65;
printf("%c\n",m);
printf("%d\n",max);
for(i=0;i<=n-1;i++)
{ l=strlen(c[i]);
for(j=0;j<=l-1;j++)
if(c[i][j]==m)
printf("%d\n",a[i]);
}
}
|
2 | 563 | 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);
if(head==NULL) /*???????????=??????????????????*/
head=tail=p;
else{
tail->next=p;
tail=p;
}
}
for(c='A';c<='Z';c++){
for(i=0,p=head;i<n;i++,p=p->next)
{
for(j=0;p->writer[j]!='\0';j++)
if(p->writer[j]==c)
a[c-'A']++; /*????break,??????*/
} /*??a[26]????????????????????????????????????????????????????????????*/
}
max=a[0];
for(i=0;i<26;i++)
if(a[i]>max)
max=a[i];
for(i=0;i<26;i++)
if(a[i]==max)
break;
c=i+'A';
printf("%c\n",c);
printf("%d\n",a[i]);
for(i=0,p=head;i<n;i++,p=p->next)
{
for(j=0;p->writer[j]!='\0';j++)
if(p->writer[j]==c){
printf("%d\n",p->num);break;
}
}
} |
2 | 564 | struct book
{
int num;
char zhuzhe[26];
int let;
};
struct book shu[1000];
int judge(char a,char b)
{
if(a==b)return(1);
else return(0);
}
void main()
{
int n,i,j,y,zhi,num;
char writer1[26]={0};
char writer2[26]={0};
for(i=0;i<26;i++)
writer2[i]=i+65;
scanf("%d",&n);
for(i=0;i<n;i++)
{scanf("%d",&shu[i].num);
gets(shu[i].zhuzhe);
}
for(i=0;i<n;i++)
for(j=0;shu[i].zhuzhe[j]!='\0';j++)
for(y=0;y<26;y++)
if(writer2[y]==shu[i].zhuzhe[j])writer1[y]=writer1[y]+1;
zhi=0;
num=0;
for(i=0;i<26;i++)
if(writer1[i]>zhi){zhi=writer1[i];num=i;}
for(i=0;i<n;i++)
for(j=0;shu[i].zhuzhe[j]!='\0';j++)
if(judge(shu[i].zhuzhe[j],writer2[num])==1)shu[i].let=1;
printf("%c\n",writer2[num]);
printf("%d\n",writer1[num]);
for(i=0;i<n-1;i++)
if(shu[i].let==1)printf("%d\n",shu[i].num);
if(shu[n-1].let==1)printf("%d",shu[n-1].num);
}
|
2 | 565 | int N;
int A[2013],Ans[1222];
char W[2013][28];
double Max(double X,double Y)
{
return X > Y ? X : Y;
}
int main()
{
cin >> N;
for (int I = 1; I <= N; I ++)
cin >> A[I] >> W[I];
for (int I = 1; I <= N; I ++)
{
int L = strlen(W[I]);
for (int J = 0; J < L; J ++) Ans[W[I][J]] ++;
}
int Max = 0,T;
for (int I = 65; I <= 'Z'; I ++)
if (Ans[I] > Max)
{
Max = Ans[I];
T = I;
}
printf("%c\n%d\n",T,Max);
for (int I = 1; I <= N; I ++)
{
int L = strlen(W[I]);
for (int J = 0; J < L; J ++)
if (W[I][J] == T) cout << A[I] << endl;
}
} |
2 | 566 | int main ()
{
int m, i, j, num[999], store[26][999] = {0} , cal[26] = {0}, max = 0, maxnum;
char au[999][26];
cin >> m;
for(i = 0; i <= m - 1; i++)
{
cin >> num[i];
cin.get();
cin.getline(au[i], 26);
for (j = 0; ;j++)
{
if(au[i][j] == '\0')
break;
else
{
store[au[i][j] - 'A'][cal[au[i][j] - 'A']] = num[i];
cal[au[i][j] - 'A']++;
}
}
}
for(i = 0; i <= 25; i++)
{
if (cal[i] > max)
{
max = cal[i];
maxnum = i;
}
}
char t = 'A' + maxnum;
cout << t << endl << max << endl;
for(i = 0; i < max ; i++)
{
cout << store[maxnum][i] << endl;
}
return 0;
}
|
2 | 567 | void main()
{
int n,i,j,k;
int at[26]={0};
char c;
scanf("%d",&n);
struct st
{
int id;
char s[27];
}a[999],*p;
for(p=a;p<a+n;p++)scanf("%d %s",&p->id,p->s);
for(i=0;i<n;i++)
{
for(j=0;;j++)
{
c=a[i].s[j];
if(c!='\0')at[c-65]++;
else break;
}
}
int max=0;
for(i=0;i<26;i++)
{
if(at[i]>max)
{
max=at[i];
j=i;
}
}
char x;
x=j+65;
printf("%c\n%d\n",x,max);
for(i=0;i<n;i++)
{
for(j=0;;j++)
{
c=a[i].s[j];
if(c==x)printf("%d\n",a[i].id);
if(c=='\0')break;
}
}
} |
2 | 568 |
struct book{
int num;
char author[27];
};
int main()
{
int n,m,i,j;
int author_num[26]={0};
scanf("%d",&n);
struct book shu[999];
for(i=0;i<n;i++){
scanf("%d%s",&shu[i].num,shu[i].author);
}
for(i=0;i<n;i++){
for(j=0;j<26;j++){
m=shu[i].author[j]-'A';
author_num[m]++;
}
}
int max=author_num[0],author='A';
for(i=1;i<26;i++){
if(author_num[i]>max){
max=author_num[i];
author=i+'A';
}
}
printf("%c\n%d\n",author,max);
for(i=0;i<n;i++){
for(j=0;j<26;j++){
if(shu[i].author[j]==author){
printf("%d\n",shu[i].num);
}
}
}
return 0;
}
|
2 | 569 | //
// 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;
}
int m;
cin>>m;
for(int i=1;i<=m;i++)
{
int num;
char a[26];
cin>>num;
cin.get();
cin.getline(a,26);
for(int k=0;k<strlen(a);k++)
{
int author_r=(int)(a[k]-'A');//?????
au[author_r].book[ au[author_r].count ]=num;
au[author_r].count++;
}
}
//find the max
int max=0;
int the_one=0;
for(int i=0;i<26;i++)
{
//cout<<au[i].count<<endl;
if(au[i].count>max)
{
max=au[i].count;
the_one=i;
}
}
//cout author
char maxau='A'+the_one;
cout<<maxau<<endl;
cout<<au[the_one].count<<endl;
//cout his books
for(int i=0;i<au[the_one].count;i++)
{
cout<<au[the_one].book[i]<<endl;
}
return 0;
} |
2 | 570 | struct inf
{
int num;
char name[26];
struct inf *next;
};
int m;
struct inf *creat(void)
{
struct inf *head,*p1,*p2;
int n;
p1=p2=(struct inf *)malloc(LEN);
scanf("%d %s",&p1->num,p1->name);
head=NULL;
n=0;
while(1)
{
n++;
if(n==1)
head=p1;
else
p2->next=p1;
p2=p1;
if(n==m)
break;
else
{
p1=(struct inf *)malloc(LEN);
scanf("%d %s",&p1->num,p1->name);
}
}
p2->next=NULL;
return(head);
}
void count(struct inf *head,int o)
{
struct inf *q1;
int *q2,*q3,*q4;
char *t1;
q1=head;
q2=(int *)malloc(26*LEM);
for(q3=q2;q3<q2+26;q3++)
*q3=0;
while(q1!=NULL)
{
for(t1=q1->name;*t1!='\0';t1++)
*(q2+(*t1-'A'))=*(q2+(*t1-'A'))+1;
q1=q1->next;
}
q4=q2;
for(q3=q2;q3<q2+26;q3++)
if(*q4<*q3)
q4=q3;
printf("%c\n%d\n",q4-q2+'A',*q4);
q1=head;
while(q1!=NULL)
{
for(t1=q1->name;*t1!='\0';t1++)
if(*t1==(q4-q2+'A'))
printf("%d\n",q1->num);
q1=q1->next;
}
}
void main()
{
struct inf *head,*s;
scanf("%d",&m);
head=creat();
s=head;
count(head,m);
/* while(s!=NULL)
{
printf("%d %s\n",s->num,s->name);
s=s->next;
}*/
}
|
2 | 571 | 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)
{
max = num[i];
t = i + 'A';
}
cout << t << endl;
cout << max << endl;
for (i = 1; i <= n; i++)
for (j = 1; j <= l[i]; j++)
if (a[i][j] == t)
cout << b[i] << endl;
return 0;
} |
2 | 572 | void main()
{
int a,m,i,max=0,n,count[26]={0};
char b;
struct book
{
int id;
char author[26];
}book[1024];
char *p=&book[0].author[0];
char *q;
scanf("%d",&m);
for(i=0;i<m;i++)
{
scanf("%d %s",&book[i].id,book[i].author);
}
/*
for(i=0;i<m;i++)
{
printf("%d %s\n",book[i].id,book[i].author);
}
*/
for(i=0;i<m;i++)
for(p=book[i].author;*p!='\0';p++)
{
a=*p;
count[a-65]++;
}
for(i=0;i<26;i++)
{
if(max<count[i])
{
max=count[i];
b='A'+i;
}
}
printf("%c\n%d\n",b,max);
for(i=0;i<m;i++)
{
for(q=book[i].author;*q!='\0';q++)
{
if(*q==b) printf("%d\n",book[i].id);
}
}
} |
2 | 573 |
int n,i,p,j,t,q;
int SAVER[1500];
char R[1500][50];
int RR[50];
int main()
{
cin>>n;
t=0;
for (i=1;i<=n;i++)
{
cin>>SAVER[i];
cin.get();
cin>>R[i];
j=0;
while (R[i][j]!='\0')
{
RR[R[i][j]-'A']++;
j++;
}
}
for (i='A';i<='Z';i++)
if (RR[i-'A']>t)
{
t=RR[i-'A'];
q=i;
}
cout<<(char)q<<endl<<t<<endl;
for (i=1;i<=n;i++)
{
j=0;
while (R[i][j]!='\0')
{
if (R[i][j]==q) cout<<SAVER[i]<<endl;
j++;
}
}
return 0;
}
|
2 | 574 | int main()
{
int num,i,j;
char a='A';
int count[27]={0};
int *p=&count[1];
scanf("%d",&num);
struct book
{
char order[4];
char author[26];
}book[1000];
for(i=0;i<num;i++)
{
scanf("%s",book[i].order);
scanf("%s",book[i].author);
}
for(i=0;i<num;i++)
{
int m=strlen(book[i].author);
for(j=0;j<m;j++)
{
if(book[i].author[j]=='A')count[1]++;
if(book[i].author[j]=='B')count[2]++;
if(book[i].author[j]=='C')count[3]++;
if(book[i].author[j]=='D')count[4]++;
if(book[i].author[j]=='E')count[5]++;
if(book[i].author[j]=='F')count[6]++;
if(book[i].author[j]=='G')count[7]++;
if(book[i].author[j]=='H')count[8]++;
if(book[i].author[j]=='I')count[9]++;
if(book[i].author[j]=='J')count[10]++;
if(book[i].author[j]=='K')count[11]++;
if(book[i].author[j]=='L')count[12]++;
if(book[i].author[j]=='M')count[13]++;
if(book[i].author[j]=='N')count[14]++;
if(book[i].author[j]=='O')count[15]++;
if(book[i].author[j]=='P')count[16]++;
if(book[i].author[j]=='Q')count[17]++;
if(book[i].author[j]=='R')count[18]++;
if(book[i].author[j]=='S')count[19]++;
if(book[i].author[j]=='T')count[20]++;
if(book[i].author[j]=='U')count[21]++;
if(book[i].author[j]=='V')count[22]++;
if(book[i].author[j]=='W')count[23]++;
if(book[i].author[j]=='X')count[24]++;
if(book[i].author[j]=='Y')count[25]++;
if(book[i].author[j]=='Z')count[26]++;
}
}
for(i=1;i<27;i++)
{
if(count[i]>*p)
{
p=&count[i];
a=i+64;
}
}
printf("%c\n%d\n",a,*p);
for(i=0;i<num;i++)
{
for(j=0;j<strlen(book[i].author);j++)
{
if(book[i].author[j]==a)
printf("%s\n",book[i].order);
}
}
return 0;
}
|
2 | 575 | struct book
{
char writer[26];
int num;
struct book *next;
};
struct book *creat()
{
struct book *head,*p1,*p2;
int i,m;
scanf("%d",&m);
p1=p2=(struct book *)malloc(sizeof(struct book));
head=NULL;
for(i=0;i<m;i++)
{
if(i==0) head=p1;
else p2->next=p1;
p2=p1;
p1=(struct book *)malloc(sizeof(struct book));
scanf("%d %s",&p1->num,p1->writer);
p1->next=NULL;
}
p2->next=p1;
return(head);
}
void main()
{
int n,a[26][1000]={0},b[26]={0},i,max,k;
struct book *head,*p;
char *q;
head=creat();
for(p=head->next;p;p=p->next)
{
n=strlen(p->writer);
for(i=0,q=p->writer;i<n;i++,q++)
{
a[*q-65][b[*q-65]]=p->num;
b[*q-65]++;
}
}
max=b[0];
k=0;
for(i=0;i<26;i++)
{
if(b[i]>max)
{
max=b[i];
k=i;
}
}
printf("%c\n%d\n",k+65,max);
for(i=0;i<max;i++)
printf("%d\n",a[k][i]);
} |
2 | 576 | /*????????m?10 ? m ? 999??????????n?2 ? n ? 26?????????????????m?????????1?999??
?????????'A'?'Z'????????????????????????????????
??????????m???m??????????????????????????
???????????????????????????????????????????*/
int main()
{
int m;
cin>>m;
char str[1000][26];
int a[1000],count[26]={0};
int t=0;
int shu=0;
for (int i=0;i<m;i++)
{
t=0;
cin>>a[i];
cin>>str[i];
t=strlen(str[i]);
for (int j=0;j<t;j++)
{
shu=str[i][j]-'A';
count[shu]++;
}
}
int max=count[0];
int hao=0;
for (int k=1;k<26;k++)
{
if (count[k]>max)
{
max=count[k];
hao=k;
}
}
char c=hao+'A';
cout<<c<<endl;
cout<<max<<endl;
for (int l=0;l<m;l++)
{
for (int o=0;str[l][o]!='\0';o++)
{
if (str[l][o]==c)
{
cout<<a[l]<<endl;
break;
}
}
}
return 0;
}
|
2 | 577 | int main()
{
int m,i,j,k,max=-1;
int c[26];
char prname;
struct list
{
int num;
char writer[27];
int len;
}book[999];
scanf("%d",&m);
for(i=0;i<m;i++)
{
scanf("%d",&book[i].num);
gets(book[i].writer);
book[i].len=strlen(book[i].writer);
}
for(i=0;i<26;i++)
c[i]=0;
for(i=0;i<m;i++)
{
for(j=0;j<book[i].len;j++)
{
switch(book[i].writer[j])
{
case 'A':c[0]++;break;
case 'B':c[1]++;break;
case 'C':c[2]++;break;
case 'D':c[3]++;break;
case 'E':c[4]++;break;
case 'F':c[5]++;break;
case 'G':c[6]++;break;
case 'H':c[7]++;break;
case 'I':c[8]++;break;
case 'J':c[9]++;break;
case 'K':c[10]++;break;
case 'L':c[11]++;break;
case 'M':c[12]++;break;
case 'N':c[13]++;break;
case 'O':c[14]++;break;
case 'P':c[15]++;break;
case 'Q':c[16]++;break;
case 'R':c[17]++;break;
case 'S':c[18]++;break;
case 'T':c[19]++;break;
case 'U':c[20]++;break;
case 'V':c[21]++;break;
case 'W':c[22]++;break;
case 'X':c[23]++;break;
case 'Y':c[24]++;break;
case 'Z':c[25]++;break;
}
}
}
for(i=0;i<26;i++)
{
if(c[i]>max)
max=c[i];
else
continue;
}
for(i=0;i<26;i++)
{
if(c[i]!=max)
continue;
else
{
prname=i+65;
printf("%c\n",prname);
printf("%d\n",max);
for(j=0;j<m;j++)
{
for(k=0;k<book[j].len;k++)
{
if(book[j].writer[k]!=prname)
continue;
else
{
printf("%d\n",book[j].num);
break;
}
}
}
break;
}
}
return 0;
} |
2 | 578 | 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++)
{
author[authors[i][j]-'A']++;
}
}
int k,kmax=0;
int max=author[0];
for (k=1;k<=25;k++)
{
if (author[k]>max)
{
max=author[k];
kmax=k;
}
}
char writer=kmax+'A';
cout << writer << endl;
cout << max << endl;
for (i=0;i<=n-1;i++)
{
for (j=0;j<=25;j++)
{
if (authors[i][j]-'A'==kmax)
{
cout << number[i] << endl;
break;
}
}
}
return 0;
} |
2 | 579 | struct stu
{
int n;
char name[27];
struct stu *next;
};
void main()
{
int m;
scanf("%d",&m);
struct stu *head,*p1,*p2,*p3;
head=p1=(struct stu*)malloc(LEN);
scanf("%d %s",&p1->n,p1->name);
int i=0;
for(;i<m-1;i++)
{
p2=(struct stu*)malloc(LEN);
scanf("%d %s",&p2->n,p2->name);
p1->next=p2;
p1=p2;
}
p2->next=NULL;
int sum[26];
for(i=0;i<26;i++) sum[i]=0;
for(p1=head;p1!=NULL;p1=p1->next)
{
char *p=p1->name;
while(*p!='\0')
{
int a=*p;
sum[a-65]=sum[a-65]+1;
p=p+1;
}
}
int max=sum[0];
char j='A';
for(i=0;i<26;i++)
{
if(sum[i]>max)
{
max=sum[i];
j=i+65;
}
}
printf("%c\n%d\n",j,max);
for(p1=head;p1!=NULL;p1=p1->next)
{
char *p=p1->name;
for(;*p!='\0';p++)
if(*p==j)
{printf("%d\n",p1->n);break;}
}
}
|
2 | 580 |
int main(int argc, char* argv[])
{
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].au[j]] > cnt[m])
m = bk[i].au[j];
}
printf("%c\n%d\n", m, cnt[m]);
for (i = 0; i < n; i++)
if (strchr(bk[i].au, m))
printf("%d\n", bk[i].id);
return 0;
}
|
2 | 581 |
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
{
newnode=(struct node *)malloc(sizeof(struct node)); //??????????
if(newnode==NULL) //malloc???
{
printf("malloc failed");
exit(-1);
}
scanf("%d%s",&newnode->num,&newnode->name);
newnode->next=NULL;
if(n==1) //???????????thisnode?head????newnode
{
thisnode=newnode;
head=newnode;
}
else //?????????????
{
thisnode->next=newnode;
}
if(n<=m)
{
thisnode=newnode; //????
n++; //????
}
}while(n<=m);
return head;
}
void tongji(struct node *p,int n)
{
int i,j;
for(i=1;i<=n;i++)
{
for(j=0;j<strlen(p->name);j++)
{
zuozhe[(p->name)[j]-'A'].books[zuozhe[(p->name)[j]-'A'].num]=p->num;
zuozhe[(p->name)[j]-'A'].num++;
}
p=p->next;
}
}
void bubble(struct zuozhe array[],int n)
{
int i=0,pass;
struct zuozhe temp;
for(pass=1;pass<=n;pass++)
{
for(i=0;i<n-pass;i++)
{
if(array[i].num<array[i+1].num)
{
temp=array[i];
array[i]=array[i+1];
array[i+1]=temp;
}
}
}
return;
}
void main()
{
struct node *p;
int i;
scanf("%d",&m);
p=getlinked();
for(i=0;i<26;i++)
{
zuozhe[i].name='A'+i;
zuozhe[i].num=0;
}
tongji(p,m);
bubble(zuozhe,26);
printf("%c\n%d\n",zuozhe[0].name,zuozhe[0].num);
for(i=0;i<zuozhe[0].num;i++)
{
printf("%d\n",zuozhe[0].books[i]);
}
} |
2 | 582 | struct a
{
int number;
char authors[26];
struct a*next;
};
int n,max=0;
int main()
{
struct a*create(void);
char sum(struct a*);
void pr(char x,struct a*head);
struct a*head;
char x;
scanf("%d",&n);
head=create();
x=sum(head);
pr(x,head);
}
struct a*create(void)
{
struct a*head,*p1,*p2;
int i;
p1=len;head=p1;p2=p1;
for(i=0;i<n;i++)
{
scanf("%d %s",&p1->number,p1->authors);
if(i!=n-1)
{p1=len;p2->next=p1;p2=p2->next;}
else p1->next=null;
}
return head;
}
char sum(struct a*head)
{
struct a*p;
p=head;
int a[26]={0},i,j;
char zd;
for(i=0;i<n;i++)
{
for(j=0;*(p->authors+j)!='\0';j++)
a[*(p->authors+j)-65]++;
p=p->next;
}
for(i=0;i<26;i++)
if(a[i]>max){max=a[i];zd=i;}
printf("%c\n%d",zd+65,a[zd]);
return(zd+65);
}
void pr(char x,struct a*head)
{
int i,j,num;
struct a*p;
p=head;
for(i=0;i<n;i++)
{
num=0;
for(j=0;*(p->authors+j)!='\0';j++)
if(*(p->authors+j)==x)num=1;
if(num)printf("\n%d",p->number);
p=p->next;
}
} |
2 | 583 |
main()
{
struct h
{
char name[27];
int mun;
struct h *next;
} *p,*q,*head;
int k,j,i,l,n,a[26][1001],b;
scanf("%d",&n);
p=len;
q=head=p;
for(i=0;i<26;i++)
for(j=0;j<1000;j++)
a[i][j]=0;
for(i=0;i<n;i++)
{
scanf("%d %s",&p->mun,p->name);
l=strlen(p->name);
for(j=0;j<l;j++)
{
b=(p->name)[j]-65;/*????????*/
k=a[b][0]+=1;/*???????????? */
a[b][k]=p->mun;/*???p->mun????????*/
}
q=len;
p->next=q;
p=q;
}
p=head;
int max=a[0][0];
j=0;
for(i=0;i<26;i++)
{
if(max<a[i][0]){max=a[i][0];j=i;}
}
printf("%c\n%d\n",j+65,max);
i=1;
while(a[j][i])
{
printf("%d\n",a[j][i]);
i++;
}
}
|
2 | 584 | int main()
{
struct book
{
int num;
char writer[26];
}book[999];
int m,i,n,j,max;
char a[26],c[26];
scanf("%d",&m);
for(i=0;i<m;i++)
{
scanf("%d %s",&book[i].num,&book[i].writer);
}
for(i=0;i<26;i++)
{
a[i]=i+65;
c[i]=0;
}
for(i=0;i<26;i++)
{
for(j=0;j<m;j++)
{
for(n=0;n<26;n++)
{
if(a[i]==book[j].writer[n])
{
c[i]++;
}
}
}
}
max=0;
for(i=0;i<26;i++)
{
if(c[i]>c[max])
{
max=i;
}
}
printf("%c\n%d\n",a[max],c[max]);
for(i=0;i<m;i++)
{
for(j=0;j<26;j++)
{
if(book[i].writer[j]==a[max])
{
printf("%d\n",book[i].num);
}
}
}
return 0;
} |
2 | 585 | void main()
{
int n,i,j,k=0,name[26]={0},max,a[1000],t=0;
char word[1000][30];
scanf("%d",&n);
for(i=-1;i<n;i++)
{
gets(word[i]);
}
for(j=0;j<26;j++)
{
for(i=0;i<n;i++)
{
while(word[i][k]!='\0')
{
if(word[i][k]=='A'+j)
{
name[j]=name[j]+1;
}
k=k+1;
}
k=0;
}
}
k=0;
max=name[0];
j=0;
for(i=1;i<26;i++)
{
if(name[i]>max)
{
max=name[i];
j=i;}
}
for(i=0;i<n;i++)
{
while(word[i][k]!='\0')
{
if(word[i][k]=='A'+j)
{
a[t]=i;
t=t+1;
k=0;
break;
}
k=k+1;
}
k=0;
}
printf("%c\n%d\n",'A'+j,max);
k=0;
for(i=0;i<t;i++)
{
while(word[a[i]][k]!=' ')
{
printf("%c",word[a[i]][k]);
k=k+1;
}
printf("\n");
k=0;
}
} |
2 | 586 | int main()
{
int n;
scanf("%d",&n);
struct writer{
int sum;
char c;
}lit[26]={0,'A',0,'B',0,'C',0,'D',0,'E',0,'F',0,'G',0,'H',0,'I',0,'J',0,'K',0,'L',0,'M',0,'N',0,'O',0,'P',0,'Q',0,'R',0,'S',0,'T',0,'U',0,'V',0,'W',0,'X',0,'Y',0,'Z'};
struct book{
int id;
char name[26];
}data[1000];
int i,j,k;
for(i=0;i<n;i++)
{
scanf("%d%s",&data[i].id,&data[i].name);
for(j=0;data[i].name[j]!='\0';j++)
{
for(k=0;k<26;k++)
{
if(data[i].name[j]==lit[k].c)
lit[k].sum++;
}
}
}
for(i=1;i<26;i++)
{
if(lit[i].sum<lit[i-1].sum)
{
struct writer tmp;
tmp=lit[i-1];
lit[i-1]=lit[i];
lit[i]=tmp;
}
}
printf("%c\n%d\n",lit[25].c,lit[25].sum);
for(i=0;i<n;i++)
{
for(j=0;data[i].name[j]!='\0';j++)
{
if(data[i].name[j]==lit[25].c)
printf("%d\n",data[i].id);
}
}
return 0;
}
|
2 | 587 | 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++)
{
p1=(struct ts *)malloc(sizeof(struct ts));
scanf("%d %s",&p1->sl,p1->zz);
// p1->zzsl=strlen(p1->zz);
p2->next=p1;
p2=p1;
}
p1->next=0;//??NULL???????
for(i='A';i<='Z';i++)
{
p1=head;
for(k=0;k<n;k++)
{
for(j=0;p1->zz[j]!='\0';j++)
{
if(p1->zz[j]==i)num[i]++;
}
p1=p1->next;
}
}
max=0;
for(i='A';i<='Z';i++)
{
max=max>num[i]?max:num[i];//?????????
}
for(i='A';i<='Z';i++)
{
if(num[i]==max)zzzd=i;//????????
}
printf("%c\n%d\n",zzzd,max);
p1=head;
//zzdnum=0;
for(i=0;i<n;i++)
{
for(j=0;p1->zz[j]!='\0';j++)
{
if(p1->zz[j]==zzzd)//?????????
{
printf("%d\n",p1->sl);
}
}
p1=p1->next;
}
}
|
2 | 588 |
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];
int n,i;
p=(int *)calloc(257,sizeof(int));
scanf("%d\n",&n);
for(i=0;i<n;i++)
{
scanf("%d %s",&book[i].id,&book[i].c);
}
number_of_books(n,p,book);
m=max(n,p,book);
printf("%c\n%d\n",m,(*(p+m)));
name_of_book(n,p,book,m);
return 0;
}
void number_of_books(int n,int *p,struct book book[1000])
{
int i,j;
for(i=65;i<91;i++)
{
(*(p+i))=0;
}
for(i=0;i<n;i++)
{
for(j=0;book[i].c[j]!='\0';j++)
{
(*(p+book[i].c[j]))++;
}
}
}
char max(int n,int *p,struct book book[1000])
{
int i,k=0;
char m;
for(i=65;i<91;i++)
{
if((*(p+i))>k)
{
k=(*(p+i));
m=i;
}
}
return (m);
}
void name_of_book(int n,int *p,struct book book[1000],int m)
{
int i,j;
for(i=0;i<n;i++)
{
for(j=0;book[i].c[j]!='\0';j++)
{
if((book[i].c[j])==m)
{
printf("%d\n",book[i].id);
break;
}
}
}
} |
2 | 589 | struct book
{
int num;
char writer[27];
struct book *next;
}*head;
int times[26];
void create(int m)
{
struct book *p1,*p2;
int i;
for (i=0;i<=m-1;i++)
{
p1=(struct book *)malloc(sizeof(struct book));
scanf("%d",&p1->num);
scanf("%s",p1->writer);
if (!i) head=p1;
else p2->next=p1;
p2=p1;
}
p2->next=NULL;
}
int count()
{
int max,l,i;
char temp[27];
struct book *p1;
for (i=0;i<=25;i++) times[i]=0;
p1=head;
while (p1!=NULL)
{
l=strlen(p1->writer);
strcpy(temp,p1->writer);
for (i=0;i<=l-1;i++)
times[temp[i]-65]++;
p1=p1->next;
}
max=0;
for (i=0;i<=25;i++)
if (times[i]>times[max]) max=i;
return(max);
}
void print(int max)
{
struct book *p1;
int abc[999],total,l,i;
char temp[27];
total=0;
printf("%c\n",max+65);
p1=head;
while (p1!=NULL)
{
strcpy(temp,p1->writer);
l=strlen(temp);
for (i=0;i<=l-1;i++)
if (max+65==temp[i]) break;
if (i<l)
{
abc[total]=p1->num;
total++;
}
p1=p1->next;
}
printf("%d\n",total);
for (i=0;i<=total-1;i++)
{
printf("%d\n",abc[i]);
}
}
void main()
{
int max,m;
scanf("%d",&m);
create(m);
max=count();
print(max);
} |
2 | 590 |
struct book
{
int id;
char author[27];
struct book *next;
};
struct book *creat()
{
int n , i;
scanf("%d",&n);
struct book *p1,*head,*p0;
head = NULL;
p1 = head;
for ( i = 0 ; i < n ; i ++)
{
p0 = (struct book *)malloc(sizeof(struct book));
scanf("%d %s" , &p0->id , p0->author );
if( head == NULL )
{
p1 = p0;
head = p1;
p0->next = NULL;
}
else
{
p1->next = p0;
p0->next = NULL;
p1 = p0;
}
}
return (head);
}
char best(struct book *head)
{
int i , max , a[26] ;
struct book *p;
p = head;
for (i = 0;i < 26;++i) a[i] = 0;
while(p != NULL)
{
i = 0;
while( p->author[i] != '\0')
{
a[p->author[i]-'A']++;
i ++;
}
p = p->next;
}
for(i = 0 ; i < 26 ; i ++ )
{
if ( i == 0 ) max = i;
else if ( a[i] > a[max]) max = i;
}
return ('A'+max);
}
void print(char x , struct book *head )
{
int i,k = 0;
char a = x;
struct book *p = head;
while(p != NULL)
{
i = 0 ;
while ( p->author[i] != '\0' )
{
if(p->author[i] == a)
{
k ++;
break;
}
i ++;
}
p = p->next;
}
printf("%c\n%d\n" , a , k);
p = head;
while(p != NULL)
{
i = 0;
while ( p->author[i] != '\0' )
{
if(p->author[i] == a)
{
printf("%d\n",p->id);
break;
}
i ++;
}
p = p->next;
}
}
int main(int argc, char* argv[])
{
char writer;
struct book *head;
head = creat();
writer = best(head);
print(writer,head);
return 0;
}
|
2 | 591 | int Book_num(char a[])
{
int j,num;
j=1;
if((j=1)&&a[j]==' ')
{
num=a[0]-48;
}
else j++;
if((j=2)&&a[j]==' ')
{
num=a[1]-48+(a[0]-48)*10;
}
else j++;
if((j=3)&&a[j]==' ')
{
num=a[2]-48+(a[1]-48)*10+(a[0]-48)*100;
}
return num;
}
int main()
{
int m,bk1,i,max,j,wrt;
int author[26][999]={0};
char data[999][30];
scanf("%d\n",&m);
for(i=0;i<m;i++)
{
gets(data[i]);
data[i][strlen(data[i])]='\0';
}
max=0;
for(i=0;i<m;i++)
{
for(j=0;data[i][j]!='\0';j++)
{
if(data[i][j]>64)
{
wrt=data[i][j]-65;
for(bk1=0;author[wrt][bk1]!=0;bk1++)
{;}
author[wrt][bk1]=Book_num(data[i]);
if(bk1>max)
{
max=bk1;
}
}
}
}
for(i=0;i<26;i++)
{
if(author[i][max]!=0)
{
printf("%c\n",i+65);
printf("%d\n",max+1);
for(j=0;j<=max;j++)
{
printf("%d\n",author[i][j]);
}
break;
}
}
return 0;
}
|
2 | 592 | struct library
{
int num;
char aut[30];
struct library *next;
}
main()
{
int m,i,j,a[30],t,b[30],x=0;
char name;
struct library *head;
struct library *p1,*p2,*p;
for(i=0;i<26;i++)
{
a[i]=0;
b[i]=0;
}
scanf("%d",&m);
p1=p2=(struct library*) malloc(LEN);
scanf("%d %s",&p1->num,p1->aut);
head=p1;
p2=p1;
for(i=0;i<m-1;i++)
{
p1=(struct library*) malloc(LEN);
scanf("%d %s",&p1->num,p1->aut);
p2->next=p1;
p2=p1;
}
p1->next=NULL;
p=head;
for(i=0;i<m;i++)
{
for(j=0;j<26;j++)
{
if(p->aut[j]=='A') a[0]=a[0]+1;
if(p->aut[j]=='B') a[1]=a[1]+1;
if(p->aut[j]=='C') a[2]=a[2]+1;
if(p->aut[j]=='D') a[3]=a[3]+1;
if(p->aut[j]=='E') a[4]=a[4]+1;
if(p->aut[j]=='F') a[5]=a[5]+1;
if(p->aut[j]=='G') a[6]=a[6]+1;
if(p->aut[j]=='H') a[7]=a[7]+1;
if(p->aut[j]=='I') a[8]=a[8]+1;
if(p->aut[j]=='J') a[9]=a[9]+1;
if(p->aut[j]=='K') a[10]=a[10]+1;
if(p->aut[j]=='L') a[11]=a[11]+1;
if(p->aut[j]=='M') a[12]=a[12]+1;
if(p->aut[j]=='N') a[13]=a[13]+1;
if(p->aut[j]=='O') a[14]=a[14]+1;
if(p->aut[j]=='P') a[15]=a[15]+1;
if(p->aut[j]=='Q') a[16]=a[16]+1;
if(p->aut[j]=='R') a[17]=a[17]+1;
if(p->aut[j]=='S') a[18]=a[18]+1;
if(p->aut[j]=='T') a[19]=a[19]+1;
if(p->aut[j]=='U') a[20]=a[20]+1;
if(p->aut[j]=='V') a[21]=a[21]+1;
if(p->aut[j]=='W') a[22]=a[22]+1;
if(p->aut[j]=='X') a[23]=a[23]+1;
if(p->aut[j]=='Y') a[24]=a[24]+1;
if(p->aut[j]=='Z') a[25]=a[25]+1;
if(p->aut[j]=='\0') break;
}
p=p->next;
}
t=0;
for(i=1;i<26;i++)
{
if(a[t]<a[i]) t=i;
}
if(t==0)
{
printf("A\n");
name='A';
}
if(t==1)
{
printf("B\n");
name='B';
}
if(t==2)
{
printf("C\n");
name='C';
}
if(t==3)
{
printf("D\n");
name='D';
}
if(t==4)
{
printf("E\n");
name='E';
}
if(t==5)
{
printf("F\n");
name='F';
}
if(t==6)
{
printf("G\n");
name='G';
}
if(t==7)
{
printf("H\n");
name='H';
}
if(t==8)
{
printf("I\n");
name='I';
}
if(t==9)
{
printf("J\n");
name='J';
}
if(t==10)
{
printf("K\n");
name='K';
}
if(t==11)
{
printf("L\n");
name='L';
}
if(t==12)
{
printf("M\n");
name='M';
}
if(t==13)
{
printf("N\n");
name='N';
}
if(t==14)
{
printf("O\n");
name='O';
}
if(t==15)
{
printf("P\n");
name='P';
}
if(t==16)
{
printf("Q\n");
name='Q';
}
if(t==17)
{
printf("R\n");
name='R';
}
if(t==18)
{
printf("S\n");
name='S';
}
if(t==19)
{
printf("T\n");
name='T';
}
if(t==20)
{
printf("U\n");
name='U';
}
if(t==21)
{
printf("V\n");
name='V';
}
if(t==22)
{
printf("W\n");
name='W';
}
if(t==23)
{
printf("X\n");
name='X';
}
if(t==24)
{
printf("Y\n");
name='Y';
}
if(t==25)
{
printf("Z\n");
name='Z';
}
printf("%d\n",a[t]);
p=head;
for(i=0;i<m;i++)
{
for(j=0;j<26;j++)
{
if(p->aut[j]==name)
{
b[x]=p->num;
x=x+1;
break;
}
}
p=p->next;
}
for(i=0;i<x-1;i++) printf("%d\n",b[i]);
printf("%d",b[i]);
}
|
2 | 593 | int main()
{
int n, count[30] = {0}, num[30][1000] = {0};
cin >> n;
while (n--)
{
int no;
char c;
cin >> no;
cin.get();
while ((c = cin.get()) != '\n')
{
num[c - 'A'][count[c - 'A']++] = no;
}
}
int max =count[0], set = 0;
for (int i = 1; i < 26; i++)
{
if (max < count[i])
{
max = count[i];
set = i;
}
}
cout << (char) (set + 'A') << endl << max << endl;
for (int i = 0; i < max; i++)
{
cout << num[set][i] << endl;
}
return 0;
} |
2 | 594 | struct book
{
int id;
char zz[26];
} b[999];
int main()
{
int m,n,i,num[26]={0},maxz,j;
char string[26];
scanf("%d",&m);
for(i=0;i<m;i++)
{
scanf("%d %s",&b[i].id,&b[i].zz);
for(j=0;b[i].zz[j]!='\0';j++)
num[b[i].zz[j]-'A']++;
}
int max=0;
for(i=0;i<26;i++)
if(max<num[i]) { max=num[i]; maxz=i;}
printf("%c\n%d",maxz+65,max);
for(i=0;i<m;i++)
for(j=0;b[i].zz[j]!='\0';j++)
{if(b[i].zz[j]==maxz+65) printf("\n%d", b[i].id);
else continue;}
}
|
2 | 595 |
struct list
{
int num;
char author[26];
};
struct number
{
int a;
int time;
};
int main()
{
int i,j,m,k,length;
struct list book[100];
struct number name[26],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++)
{
name[i].a=i;
name[i].time=0;
}
for(i=0;i<m;i++)
{
length=strlen(book[i].author);
for(j=0;j<length;j++)
{
k=(book[i].author[j]);
name[k-65].time++;
}
}
most=name[0];
for(i=1;i<26;i++)
{
if(name[i].time>most.time){
most=name[i];
}
}
printf("%c\n%d\n",most.a+65,most.time);
for(i=0;i<m;i++)
{
length=strlen(book[i].author);
for(j=0;j<length;j++)
{
k=(book[i].author[j]);
if(most.a+65==k){
printf("%d\n",book[i].num);
}
}
}
return 0;
}
|
2 | 596 | void main()
{
struct tushu
{
int num;
char zuozhe[27];
}ts[999];
int i,j,n,k,temp;
int count[26]={0};
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d %s",&ts[i].num,ts[i].zuozhe);
for(j=0;ts[i].zuozhe[j]!='\0';j++)
{count[ts[i].zuozhe[j]-65]++;}
}
temp=count[0];
k=0;
for(i=0;i<26;i++)
{
if(count[i]>temp){k=i;temp=count[i];}
}
printf("%c\n",k+65);
printf("%d\n",count[k]);
for(i=0;i<n;i++)
{
for(j=0;ts[i].zuozhe[j]!='\0';j++)
{
if(ts[i].zuozhe[j]==k+65)
{
printf("%d\n",ts[i].num);
break;
}
}
}
}
|
2 | 597 | int main()
{
struct x
{int num;
char name[26];
}book[1000];
int i,j,m,n,k,ex;
int a[26][1000];
int count[26]={0},num[26]={65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90};
scanf("%d",&m);
for(i=0;i<m;i++)
{
scanf("%d",&book[i].num);
gets(book[i].name);
}
for(i='A';i<='Z';i++)
{
for(j=0;j<m;j++)
{
n=strlen(book[j].name);
for(k=0;k<n;k++)
{
if(i==book[j].name[k])
count[i-65]++;
}
}
}
for(i=0;i<25;i++)
{
if(count[i]>count[i+1])
{
ex=count[i];
count[i]=count[i+1];
count[i+1]=ex;
ex=num[i];
num[i]=num[i+1];
num[i+1]=ex;
}
}
printf("%c\n%d\n",num[25],count[25]);
for(i=0;i<m;i++)
{
n=strlen(book[i].name);
for(k=0;k<n;k++)
{
if(book[i].name[k]==num[25])
printf("%d\n",book[i].num);
}
}
return 0;
}
|
2 | 598 | int main()
{
int a[26][999],t,i,n[26],k,j,b=0;
char x[27];
scanf("%d",&t);
for(i=0;i<26;i++)
{
n[i]=0;
}
for(i=0;i<t;i++)
{
scanf("%d%s",&k,x);
for(j=0;x[j]!='\0';j++)
{
a[x[j]-65][n[x[j]-65]]=k;
n[x[j]-65]++;
}
}
for(i=0;i<26;i++)
{
if(n[i]>b)
{
b=n[i];
j=i;
}
}
printf("%c\n",j+65);
printf("%d\n",n[j]);
for(i=0;i<n[j];i++)
{
printf("%d\n",a[j][i]);
}
return 0;
} |
2 | 599 | int main()
{
struct author
{
char nm;
int bk[999];
int count;
};
struct author a[26];
struct author max;
struct book
{
char at[26];
int no;
};
struct book b;
int i,j,n,m,k,flag;
for(i=0;i<26;i++)
{
a[i].count=0;
a[i].nm=65+i;
}
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d%s",&b.no, b.at);
m=strlen(b.at);
flag=0;
for(j=0;j<m;j++)
{
for(k=0;k<26;k++)
{
if(b.at[j]==a[k].nm)
{
a[k].bk[a[k].count]=b.no;
a[k].count++;
flag++;
break;
}
}
if(flag==m)
break;
}
}
max=a[0];
for(i=1;i<26;i++)
{
if(a[i].count>max.count)
{
max=a[i];
}
}
printf("%c\n%d\n",max.nm,max.count);
for(i=0;i<max.count;i++)
{
printf("%d\n",max.bk[i]);
}
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.