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... |
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;
}... |
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)
... |
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<... |
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... |
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]);
... |
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;
... |
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+... |
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(... |
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 ... |
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(... |
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... |
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)
{
... |
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));... |
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<... |
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... |
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... |
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("... |
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... |
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+6... |
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... |
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;
... |
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);
... |
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=... |
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));/*????... |
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("... |
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("... |
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';... |
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][... |
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 fla... |
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... |
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... |
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);
}
//??????,?????
... |
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));... |
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;... |
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;
}
... |
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]=... |
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++){
... |
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)
... |
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[ma... |
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++){
... |
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++... |
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<l... |
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-... |
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++)
{
... |
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... |
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(nu... |
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;... |
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[... |
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;
... |
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]);... |
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... |
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].a... |
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;... |
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][nu... |
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++... |
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... |
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 =... |
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])
... |
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);
}... |
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... |
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)) p... |
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)
{m... |
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... |
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",&s... |
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 ... |
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... |
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]>m... |
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],a... |
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;
... |
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
... |
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]... |
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,b... |
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... |
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",boo... |
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 boo... |
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;
... |
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... |
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]... |
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;
}
... |
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++)
... |
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 *... |
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;hea... |
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;... |
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++)
{
... |
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... |
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;... |
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);//?????
fo... |
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;
... |
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->nex... |
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 )
... |
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 d... |
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;... |
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;
f... |
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++... |
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;
... |
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... |
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+... |
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... |
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)... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.