id int32 0 32.5k | code stringlengths 95 8.4k | label stringclasses 65
values |
|---|---|---|
500 | void main()
{
int n,len,i,j,k,max;
int c[26]={0};
char a[26],f,x;
struct book{ int num; char author[26];};
struct book b[1000];
scanf("%d",&n);
for (i=0;i<n;i++)
scanf("%d %s",&b[i].num,&b[i].author);
for(i=0;i<n;i++)
{
strcpy(a,b[i].author);
len=strlen(a);
for(j=0;j<len;j++)
if('A'<=(x=a[j])&&(x=a[j])... | 2 |
501 | struct book
{
int num;
char writer[27];
struct book *next;
};
int n;
int time[26]={0},max,k;
struct book *create(int m)
{
struct book *head;
struct book *p1,*p2;
n=0;
p1=p2=(struct book *)malloc(LEN);
head=NULL;
while(n<m)
{
scanf("%d %s",&p1->num,p1->writer);
n=n+1;
if(n==1) head=p... | 2 |
502 | 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... | 2 |
503 |
struct BOOK
{
int num;
char name[26];
int name_num[26];
}book[999];
void main()
{
int n; //????//
scanf("%d",&n);
int i;
for(i=0;i<n;i++){
scanf("%d%s",&book[i].num,&book[i].name); //??????????????????i??j????????????//
}
int count[26]={0};
int k;
f... | 2 |
504 | void main()
{
int n,i,j,max=0,seq=0;
int a[26]={0};
scanf("%d",&n);
struct book
{
int num;
char str[26];
}book[999];
for(i=0;i<n;i++)
scanf("%d %s",&book[i].num,&book[i].str);
for(i=0;i<n;i++)
{
for(j=0;j<26;j++)
a[(book[i].str[j]-65)]++;
}
for(i=0;i<26;i++)
if (a[i]>max) {max=a[i];seq=i;}
... | 2 |
505 | void main()
{
struct book
{
int x;
char z[10];
}a[400];
int i,n,max=0,j,k,l,y[400],p;char u;scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d %s",&a[i].x,a[i].z);y[i]=strlen(a[i].z);
}
for(i=0;i<n-1;i++)
{
for(j=0;j<y[i];j++)
{
p=1;
for(k=i+1;k<n;k++)
{
for(l=0;l<y[k];l++)
if(a[i].z[j... | 2 |
506 | struct book
{
int id;
char author[26];
};
int main()
{
struct book b[999];
int a[26];
int m,i,j,max,maxauthor;
char c;
scanf("%d",&m);
for (i=0;i<m;i++)
{
scanf("%d %s",&b[i].id,b[i].author);
}
for (i=0;i<26;i++)
{
a[i]=0;
}
for (i=0;i<m;i++)
{
for (j=0;b[i].author[j]!='\0';j... | 2 |
507 | struct {
int num;
char w[26];
}book[999],test[1];
int main(int argc, char* argv[])
{
int m,i,j,n,s;
char x,c;
scanf ("%d",&m);
for (i=0;i<m;i++)
{
scanf ("%d%s",&book[i].num,book[i].w);
}
x='A';
n=0;
c='A';
while (1)
{
s=0;
for (i=0;i<m... | 2 |
508 | struct books
{
int num;
char author[27];
}book[999];
void main()
{
int f(struct books *p,int n,char z);
int i,n,j,x[26],k,max;
char z;
scanf("%d",&n);
for(i=0;i<n;i++)scanf("%d%s",&book[i].num,book[i].author);
for(z='A',i=0;z<='Z';z++,i++)x[i]=f(book,n,z);
for(i=1,max=x[0],k=0;i<26;i++)if(x[i]>... | 2 |
509 | char zimu[28]="ABCDEFGJIJKLMNOPQRSTUVWXYZ";
char writer[10000][10000];
int times[26],id[1000],i,len[10000],book=0;
int n,j,k,tmax,max=0;
int main()
{
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d%s",&id[i],&writer[i]);
len[i]=strlen(writer[i]);
}
for(i=0;i<26;i++)
{
times[i]=0;
}
fo... | 2 |
510 | struct book{
int num;
char s[27];
}shu[1000];
int main(){
int n,i,l,j,max;
char name;
int letter[26]={0};
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d%s",&shu[i].num,&shu[i].s);
l=strlen(shu[i].s);
for(j=0;j<l;j++){
letter[(shu[i].s[j]-65)]++;
}
}
for(max=letter[0],name=65,i=1;i<26;i+... | 2 |
511 |
struct book{
int num;
char author[26];
};
char max(int *p);
int main()
{
int m,b,i,*p;
struct book shu[999];
char c;
int writer[26];
scanf("%d",&m);
for(i=0;i<m;i++){
scanf("%d%s",&shu[i].num,shu[i].author);
}
for(c='A',writer[c-'A']=0;c<='Z';c++){
writer[c-'A']=0;
for(i=0;i<m;i++){... | 2 |
512 |
struct book{
int num;
char aut[100];
}b[200000];
int count[1000]={0};
int main()
{
int n,max=0,maxnum,i,j,f;
scanf("%d", &n);
for(i=1;i<=n;i++){
scanf("%d %s", &b[i].num, b[i].aut);
for(j=0;j<strlen(b[i].aut);j++){count[b[i].aut... | 2 |
513 |
struct aut
{
char name;
int num;
int id[1000];
};
struct aut author[26];
int main()
{
int m,i,j,ID,max=0,maxauthor,k[26]={0};
char c[27];
scanf("%d",&m);
for(i=0;i<26;i++){
author[i].name='A'+i;
author[i].num=0;
}
for(i=0;i<m;i++){
scanf("%d %s",&ID,c);
for(j=0;c[j];j++){
au... | 2 |
514 | void main()
{char c;
int max=0,store,m,i,x[26][1000]={0},coun[27]={0},flag;
scanf("%d", &m);
for (i=1;i<=m;i++)
{scanf("%d ", &store);
for (;;)
{scanf("%c", &c);
if (c<65||c>90)
break;
else {x[c-64][i]=store;coun[c-64]++;}}
}
for (i=1;i<=26;i++)
{if (coun[i]>max)
{max=... | 2 |
515 | struct book{
char a[1000];
char b[26];
}book[1000];
int main()
{
int m,i,j,s,k,p,l;
int t[26]={0};
char x;
scanf("%d",&m);
for(i=0;i<m;i++)
scanf("%s %s",&book[i].a,book[i].b);
for(i=0;i<m;i++)
{
s=strlen(book[i].b);
for(j=0;j<s;j++)
{
x=book[i].b[j];
k=x;
t[k-65]=t[k-65]+... | 2 |
516 | 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];
... | 2 |
517 |
struct book
{
int num;
char writer[100];
};
void main()
{
int n,i,j,a[26],c[100],k,t,d[100],s;
struct book bo[100];
for(i=0;i<26;i++)
a[i]=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&bo[i].num);
scanf("%s",bo[i].writer);
}
for(i=0;i<n;i++)
{
c[i]=strlen(bo[... | 2 |
518 | int main()
{
int i,j,n,k,c,big=0;
int num[30]={0},a[1000];
char name[1000][20];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d %s",&a[i],name[i]);
}
for(k=0;k<26;k++)
{
for(i=0;i<n;i++)
{
for(j=0;j<strlen(name[i]);j++)
{
i... | 2 |
519 | struct m
{ int no,j;
char a[27];
}
main()
{ int n,k,i,j,no,ath[26]={0},m;
char *t,a[26];
struct m *head,*p1,*p2,*tp,*q;
scanf("%d",&n);
head=(struct m*)calloc(n,L);
for(i=0;i<n;i++)
{ scanf("%d%s",&(head+i)->no,(head+i)->a);
(head+i)->j=0;
for(t=(head+i)->a;*t!='\0';t++)
{
... | 2 |
520 | int main()
{
int m,n=0,book[1000],num[26]={0};
char name[1000][10];
cin>>m;
for(int i=1;i<=m;i++)
{
cin>>book[i]>>name[i];
}
for(char z='A';z<='Z';z++)
{
for(int i=1;i<=m;i++)
{
for(int j=0;j<10;j++)
if(name[i][j]==z)num[z-'A']++;
}
}
int max=0,k=0;
for(int i=0;i<26;i++)
{ ... | 2 |
521 | struct book
{
int num;
char edt[27];
};
struct total //??????????????
{
char name;
int amount;
};
int main()
{
int m,i,j,k;
struct book bk[1000];
struct total to[27];
scanf("%d",&m);
for(i=0;i<m;i++)
scanf("%d %s",&bk[i].num,bk[i].edt);
for(i=0;i<26;i++)
{
to[i].name='A'+i;//????26?... | 2 |
522 | int main()
{
int n,i,j;
scanf("%d",&n);
struct book{
short int a;
char s[27];
}b[999];
short int q[26]={0};
short int w[26]={0},p,t,m;
for(i=0;i<n;i++)
{
scanf("%d %s",&b[i].a,b[i].s);
}
for(i=0;i<n;i++)
for(j=0;b[i].s[j]!='\0';j++)
{
p=(int)b[i].s[j]-65;
q[p]++;
w[p]++;... | 2 |
523 | void main()
{
struct book
{
int n;
char a[26];
};
struct book book[999];
int m,c[26]={0},k;
char w[26];
scanf("%d",&m);
int i,j,max=0,t;
for(i=0;i<m;i++)
scanf("%d %s",&book[i].n,book[i].a);
for(i=0;i<26;i++)
w[i]='A'+i;
for(i=0;i<26;i++)
for(j=0;j<m;j++)
for(k=0;k<26;k++)
{
if(book[j]... | 2 |
524 | struct book
{char name[26];
int number;
}a[1000];
void main()
{
int n,i,j,b[26]={0},max=0,t;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d %s",&a[i].number,a[i].name);
for(i=0;i<n;i++)
for(j=0;a[i].name[j]!='\0';j++)
b[a[i].name[j]-65]++;
for(i=0;i<26;i++)
if(max<b[i])
max=b[i];
for(i=0;... | 2 |
525 | int main()
{
int n,len,i,j,book[1000],num[26]={0},k=0,t,m=0;
char w[1000][27],c='A';
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d %s",&book[i],w[i]);
len=strlen(w[i]);
for(j=0;j<len;j++)
{
for(c='A',t=0;c<='Z';c++)
{
if(w[i][j]==c)
{
num[t]++;
break;
}
t++;... | 2 |
526 |
void main()
{
int i,j,k,n,m,sum=0,min,max,ID[1000]={0},a[26]={0};
char name[1000][26]={""};
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d %s",&ID[i],&name[i]);
for(i=0;i<n;i++)
for(j=0;j<strlen(name[i]);j++)
a[name[i][j]-'A']++;
max=a[0];
k=0;
for(i=0;i<26;i++)
if(a[i]... | 2 |
527 |
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++)
{
++n... | 2 |
528 | struct a
{
int book;
char author[26];
struct a *next;
};
struct a *creat(int m)
{
int i=0;
struct a *p,*head,*temp;
head=NULL;
do
{
p=(struct a *)malloc(sizeof(struct a));
if(p==NULL){
exit(1);
}
scanf("%d %s",&p->book,p->author);
if(head==NULL){
head=p;
temp=p;}
e... | 2 |
529 | 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)... | 2 |
530 |
void main()
{
int j,n,i,book,max=0,pos,a[30][1000]={0};
char s[100];
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%d%s",&book,&s);
for (j=0;j<strlen(s);j++)
{
a[s[j]-'A'][0]++;
a[s[j]-'A'][a[s[j]-'A'][0]]=book;
}
}
for (i=0;i<26;i++)
if (a[i][0]>max)
{
max=a[i][0];
... | 2 |
531 | struct book
{
int num;
char name[27];
};
int main()
{
int n,i,j,l,sum[26],t=0,T=0;struct book a[1000];memset(sum,0,sizeof(sum));char A;
cin >> n;
for(i=0;i<n;i++)
{
cin >> a[i].num >> a[i].name;
l=strlen(a[i].name);
for(j=0;j<l;j++)
{
sum[a[i].name[j]-'A']++;
}
}
for(i=0;i<26;i++)... | 2 |
532 | struct shu
{
int bianhao;
char name[26];
}shu[999];
int main ()
{
int m;
scanf("%d",&m);
int i,j,k;
int jishu[26]={0};
int beiyong[26];
for (i=0;i<m;i++)
scanf("%d %s",&shu[i].bianhao,shu[i].name);
for (i=0;i<26;i++)
{
for (j=0;j<m;j++)
{
for (k=0;k<26;k++)
{
if (shu[j... | 2 |
533 | 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;
... | 2 |
534 |
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 );
... | 2 |
535 | void main()
{
int n,i;
scanf("%d",&n);
int b[1000];
char s[1000][26];
for(i=0;i<n;i++)
{
scanf("%d%s",&b[i],&s[i]);
}
int a[26]={0};
char c[26]={'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z'};
for(i=0;i<n;i++)
{
int l,j;
l=strlen(... | 2 |
536 | int main()
{
int m ;
cin >> m ;
int p ;
char a[m+1][27];
int len[m +1];
int b[m+1];
int c[26];
int i , j , k ,l ;
for( i = 0 ;i <=25 ; i++ )
c[i] = 0 ;
for( i = 1 ; i <= m ; i ++ )
{
cin >> b[i];
cin >> a[i] ;
len[i]... | 2 |
537 |
int main()
{
int n;
scanf("%d",&n);
struct book{
int booknumber;
char writer[27];
}book[999];
int i;
for(i=0;i<n;i++)
{
scanf("%d %s",&book[i].booknumber,book[i].writer);
}
int writerbookquantity[26];
for(i=0;i<26;i++)writerbookquantity[i]=0;
int j,len,x;
for(i=0;i<n;i++)
{
... | 2 |
538 | 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;
}
}... | 2 |
539 |
struct book
{
int num;
char au[30];
struct book *next;
};
void main()
{
int m;
scanf("%d",&m);
struct book *p1,*p2,*head;
p1=(struct book*)malloc(LEN);
scanf("%d %s",&p1->num,p1->au);
p2=p1;
head=p1;
int n=1;
while(n<m)
{
p1=(struct book*)malloc(LEN);
scanf("%d %s",&p1->num,p1->au);
... | 2 |
540 | /*
* most books.cpp
* ??:?????????
* Created on: 2012-12-30
* Author: ???
*/
int main()
{
int m=0,num=0,wnum=0,max=0,i=0,j=0; //??????,??,????,?????
int books[26][30]; //??26??????????
char writer[26],name; //????????
memset(books,0,sizeof... | 2 |
541 |
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 &... | 2 |
542 | 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... | 2 |
543 | int 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=0;
int max = 0;
char maxn;
struct book
{
int id;
char author[28];
}*bb;
void find ( int ii );
int main()
{
int n;
scanf("%d",&n);
int ii;
bb = ( struct book * ) malloc ( sizeof ( struct book... | 2 |
544 | int main()
{
struct bookinf
{
int code;
char auth[27];
}book[999];
int i,k,m,max=0,num[26];
for (i=0;i<26;i++)
num[i]=0;
scanf("%d", &m);
for (i=0;i<m;i++)
{
scanf ("%d %s", &book[i].code, book[i].auth);
for (k=0;book[i].auth[k]!='\0';k++)
num[book[i].auth[k]-'A']+=1;
}
for (i=1... | 2 |
545 | struct lib
{
int num;
char author[26];
}book[1000];
int main()
{
int n,i,k,p,e;
e=0;
int tol[1000]={0};
int own[1000][1000];
scanf("%d",&n);
for(i=0;i<=n-1;i++){
scanf("%d%s",&(book[i].num),book[i].author);
}
for(k='A';k<='Z';k++){
for(i=0;i<=n-1;i++){
for(p=0;p<=25;p++){
if(k==bo... | 2 |
546 | int main()
{
int n,i,j,k,w=0;
int maxzm,maxbk=0;
char c1;
int zimu[26]={0};
int lm[100];
struct{
int num;
char a[100];
}book[1000];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d %s",&book[i].num,book[i].a);
for(i=0;i<n;i++)
{
for(j=0;book[i].a[j];j++)
{
for(k=65;k<91;k++)
{
... | 2 |
547 |
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++)
{
l... | 2 |
548 | struct book
{
int id;
char peo[26];
}book1[999];
int main()
{
int n,i,j,m=0,num[26]={0},length,max=0,t;
char author;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d%s",&book1[i].id,&book1[i].peo);
}
for(i=0;i<n;i++){
length=strlen(book1[i].peo);
for(j=0;j<length;j++){
num[(int)(book1[i].peo... | 2 |
549 | struct book
{
int num;
char ren[26];
}
main()
{
struct book shu[999];
int m,i,j,k,max=0,p;
int a[26]={0};
scanf("%d",&m);
for(i=0;i<m;i++)
{
scanf("%d %s",&shu[i].num,shu[i].ren);
for(j=0;shu[i].ren[j]!='\0';j++)
for(k=65;k<91;k++)
if(shu[i].ren[j]==k)
a[k-65]++;
}
for(i=0;i<2... | 2 |
550 | void main()
{
char s[400][400],t[400][400];
int n,m,i,j,k,l,p,y,z;
char c;
int a[30];
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%s%s",t[i],s[i]);
j=0;
for(c=65;c<91;c++)
{
p=0;
for(k=1;k<=n;k++)
{
l=strlen(s[k]);
for(m=0;m<l;m++)
{
if(s[k][m]==c)
p++;
}
}
a... | 2 |
551 | void main()
{
struct books
{
int num;
char author[26];
}books[999];
int n,a[26]={0},max,i,j,u,lenth,temp;
scanf ("%d",&n);
for (i=0;i<n;i++)
scanf("%d %s",&books[i].num,books[i].author);
for (i=0;i<n;i++)
{
lenth=strlen(books[i].author);
for (j=0;j<lenth;j++)
{
for (u=0;u<26;u++)
{
if (books[i].author... | 2 |
552 | void main()
{
struct book
{
int num;
char a[100];
};
struct book b[1000];
int n,i,j,s,t=0,m,h;
int c[1000];
char d[27];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d %s",&b[i].num,b[i].a);
d[0]=b[0].a[0];
t=1;
c[0]=0;
for(i=0;i<n;i++)
... | 2 |
553 | 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++)
... | 2 |
554 | 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);
... | 2 |
555 |
struct Article {
int number;
char author[26];
};
int main()
{
struct Article book[1000];
int m, i;
int j, k;
int c;
int max = 0;
int writer[26] = {0};
scanf("%d",&m);
for (i = 0; i < m; i++) {
scanf("%d %s",&book[i].number,book[i].author);
}
for (i = 0; i < m; i++) {
for (j = ... | 2 |
556 | void main()
{
char a[1000][100];
int b[1000],c[27],s[1000],max,i,j,k;
int n;
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%d %s",&b[i],a[i]);
s[i]=strlen(a[i]);
}
for (j=0;j<26;j++)
{
c[j]=0;
for (i=0;i<n;i++)
{
for (k=0;k<s[i];k++)
{
if (a[i][k]==65+j)
c[j]=c[j]+1;
... | 2 |
557 | struct book
{int num;
char w[26];
}b[999];
void main()
{
int m,i,j,k,e;
scanf("%d",&m);
for(i=0;i<m;i++)
scanf("%d %s",&b[i].num,b[i].w);
char a[26]={'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z'};
int c[26]={0};
for(j=0;j<26;j++)
{for... | 2 |
558 | int main()
{
int n,i,j,num[1000],l[1000],count[128],m,max;
char edi[1000][26],au[128];
scanf("%d",&n);
for(j=0;j<n;j++)
{
scanf("\n%d",&num[j]);
gets(edi[j]);
l[j]=strlen(edi[j]);
}
for(i=0;i<128;i++)
count[i]=0;
for(j=0;j<n;j++)
{
for(i=1;i<l[j];i++)
{
m=edi[j][i];
au[m]=ed... | 2 |
559 |
struct stu{
int num;
char id[26];
}a[999];
struct aut{
char wri;
int sum;
}b[26];
int main(){
int n,i,j,k,t,m=0;
for(i=0;i<26;i++){
b[i].wri='A'+i;
b[i].sum=0;
}
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a[i].num);
scanf("%s",a[i].id);
}
for(j=0;j<26;j++){
for(i=0... | 2 |
560 | 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++){
... | 2 |
561 |
int main()
{
struct {
int num;
char author[26];
}book[1000];
int shu_num[26],i,j,k,n,max,length;
char max_author;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d %s",&book[i].num,book[i].author);
}
for(k=0;k<26;k++){
shu_num[k]=0;
}
for(k=0;k<26;k++){
for(i=0;i<n;i++){
length=strlen(book[i].author)... | 2 |
562 |
struct book{
int num;
char author[26];}shu[999];
int main(int argc, char* argv[])
{
int m,b,i,*p;
char c;
int writer[26];
char max(int *p);
scanf("%d",&m);
for(i=0;i<m;i++){
scanf("%d%s",&shu[i].num,shu[i].author);}
for(c='A',writer[c-'A']=0;c<='Z';c++){
writer[c-'A']=0;
for(i=0;i<m;i++)... | 2 |
563 | struct info
{
short int num;
char author[27];
};
int main()
{
char findoutmax(struct info a[],int n,int *pt);
void detect(struct info b[],char writter,int nn);
char figure;
int i,n_book,max,*p;
struct info book[999];
scanf("%d",&n_book);
for (i=0;i<n_book;i++)
{
scanf("%d %s",&book[i].num ,... | 2 |
564 |
int main()
{
int n ;
cin >> n ;
int shu ;
char ppl[27] ;
int a[26][n+1] ;
memset( a , 0 , sizeof( a ) ) ;//???
for( int i = 0 ; i < n ; i ++ )
{
memset( ppl , 0 , sizeof( ppl ) ) ;//????
cin >> shu ;//????
getchar() ;//???
cin.getline( ppl , 27 ,'\n' ) ;//????
for( int j = 0 ; 'A' <=... | 2 |
565 | void main()
{
int *p;
p=(int *)malloc(26*sizeof(int));
struct book
{
int num;
char s[26];
}b[999];
int n,i,j,ss,max=0,r;
char x;
for(ss=0;ss<26;ss++)
*(p+ss)=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d %s",&b[i].num,b[i].s);
for(j=0;b[i].s[j]!='\0';j++)
{
*... | 2 |
566 | int main()
{
int n,i,j,k,max;
char name[2000][30],alp[27]={"ABCDEFGHIJKLMNOPQRSTUVWXYZ"};
int No[2000],num[30]={0};
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d %s",&No[i],name[i]);
}
for(i=0;i<26;i++){
for(k=0;k<n;k++){
for(j=0;j<s... | 2 |
567 | 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(... | 2 |
568 | int n;
struct student
{
char name[100];
int num;
struct student *next;
};
struct student *creat(void)
{
struct student *head;
struct student *p1,*p2;
int i;
p1=p2=(struct student*)malloc(LEN);
head=p1;
for(i=0;i<n;i++)
{p1=(struct student*)malloc(LEN);
p2->next=p1;
p2=p1;
scanf("%... | 2 |
569 | 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=... | 2 |
570 |
void main()
{
struct book
{
char num[20];
char ren[30];
struct book *next;
};
int n;
int a[26]={0};
struct book *head,*p1,*p2;
int i,j;
char tem;
char b[100][30];
p1=(struct book *)malloc(L);
head=p1;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%s",p1->num,p1->ren);
... | 2 |
571 | int main()
{
int n,i,j,d[1000];
char zuo[26]={'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z'};
scanf("%d",&n);
char s[1000][26],len;
int sum[26]={0},k;
for(i=0;i<n;i++)
{
scanf("%d%s",&d[i],s[i]);
len=strlen(s[i]);
for(j=0;j<len;j++)
{
... | 2 |
572 |
int main()
{
int n,i,j,max=0;
int zuozhe[26]={0};
char maxer;
struct book
{
int num;
char author[26];
}
shu[1000];
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%d %s",&shu[i].num,shu[i].author);
for (j=0;j<26;j++)
zuozh... | 2 |
573 |
int main()
{
int n, i;
scanf("%d", &n);
struct
{
int name;
char author[26];
}
book[999];
for(i = 0; i < n; i++)
{
scanf("%d%s", &book[i].name, book[i].author);
}
char t, tmax;
int max = 0, j, k;
for(t = 'A'; t <= 'Z'; t++)
{
k = 0;
for(i = 0; i < n; i++)
{
for(j =... | 2 |
574 | int main()
{
int m,i,j,k,a[1000],c[91],max=0;
char b[1000][26],d;
cin>>m;
memset(c,0,sizeof(c));
for(i=0;i<m;i++)
{
cin>>a[i]>>b[i];
for(j=0;j<26;j++)
if(b[i][j]>0)
c[b[i][j]]++;
}
for(i=65;i<91;i++)
if(c[i]>max)
max=c[i];
for(i=65;i<91;i++)
if(c[i]==max)
{
d=i;
co... | 2 |
575 |
int main()
{
int m;
cin>>m;
int num[1001];
char name[1001][27];
for(int i=0;i<m;++i)
{
cin>>num[i];
cin.get();
cin.getline(name[i],27);
}
int count[100];memset(count, 0, sizeof(count));
int record[27][1000];
int start=0;
int i,j;
char call;
for( i=0;i<m;i++)
{
f... | 2 |
576 | int main()
{
int n;
cin >> n;
int number[n+1];
int writer[26] = {0};
char book[n+1][27];
for(int i = 1; i <= n; ++i)
{
cin >> number[i] >> book[i];
for(int t = 0; t < strlen(book[i]); ++t)
{
writer[book[i][t] -'A']++;
... | 2 |
577 | 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"... | 2 |
578 |
struct books{
int num;
char writer[26];
struct books *next;
};
int m;
struct books *creat()
{
struct books *head,*p1,*p2;
int i;
p2=p1=(struct books*)malloc(sizeof(struct books));
for (i=1;i<=m;i++){
if (i==1) head=p1;
scanf("%d %s",&p1->num,p1->writer);
p2=p1;
if(i!=m){
p1=(st... | 2 |
579 |
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;
... | 2 |
580 |
int main()
{
int n,book[1000],i,j,countt[26]={0},len,max=-1, maxauthor;
char peo[1000][27],sum[100000]="\0",ch;
cin >> n;
for(i=1;i<=n;i++)
{
cin >> book[i] >> peo[i];
strcat(sum,peo[i]);
}
len=strlen(sum);
for(i=0;i<len;i++)
countt[sum[i]-65]++;
for(i=0;i<26;i++)
if(countt[i]>max)
... | 2 |
581 | struct shu
{
int hao;
char zuo[26];
struct shu*next;
};
int main()
{
int m,a[26]={0},i,j,b[26][1000],k,max;
struct shu*p1,*p2,*head=NULL,*p;
scanf("%d",&m);
p1=p2=(struct shu*)malloc(len);
scanf("%d %s",&p1->hao,p1->zuo);
head=p1;
for(i=2;i<=m;i++)
{
p1=(struct shu*)malloc(len);
scanf... | 2 |
582 | int trans(char k)
{
int i;
char a[26]={'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z'};
for(i=0;i<26;i++)
{
if(k==a[i])
return i;
}
}
int main()
{
struct books
{
int n;
char w[27];
}*m;
int num,i,j;
scanf("%d",&num);
m=(stru... | 2 |
583 | 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=(s... | 2 |
584 |
int m,n;
struct student
{
int id;
char name[100];
struct student* next;
};
struct student *creat()
{
int i=1;
struct student *head,*p1,*p2;
p1=p2=(struct student*)malloc(len);
scanf("%d",&m);
scanf("%d %s",&p1->id,p1->name);
head=NULL;
for(;i<m;i++)
{
if(i==1) head=p1;
p1=(struct s... | 2 |
585 | int main()
{
int i,j,num[1000],m,a[1000][26],k,sum[26],max=0,b;
char writer[1000][26],letter[27]={'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z'};
scanf("%d",&m);
for(k=0;k<26;k++)
{
sum[k]=0;
}
for(i=0;i<m;i++)
{
for(j=0;j<26;j++)
{
... | 2 |
586 | struct book
{
int H;
char writer[26];
}b[max];
int main()
{
int m,i,j,k,sum[26]={0},t,Max,g;
char y;
scanf("%d",&m);
for(i=0;i<m;i++)
{
scanf("%d %s",&b[i].H,b[i].writer);
t=strlen(b[i].writer);
for(j=0;j<t;j++)
{
k=b[i].writer[j]-65;
sum[k]++;
}
}
Max=sum[0];
for(i=0;i<26... | 2 |
587 | void main()
{
int m,a[1000],l[1000],i,j,k,t,time[26]={0},max,q=0;
char name[26]={'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z'};
char b[1000][26];
scanf("%d",&m);
for(i=0;i<m;i++)
{
scanf("%d %s",&a[i],b[i]);
l[i]=strlen(b[i]);
}
for(i=0;i... | 2 |
588 |
int main() {
struct book1 {
int num;
char author[20];
} book[999];
int time[26]={0};
int n, i, j, k, maxi, sign=0;
scanf("%d", &n);
for (i=0;i<n;i++) {
scanf("%d%s", &book[i].num, book[i].author);
}
for (i=0;i<n;i++) {
for (j=0;book[i].author... | 2 |
589 |
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... | 2 |
590 | struct book
{
int a;
char b[30];
struct book *next;
};
void main()
{
int m,i,j,k,mid,l=0;
int d[26],e[26];
char c[27]="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
struct book *head,*p1,*p2;
scanf("%d",&m);
head=p1=p2=(struct book *)malloc(LEN);
for(i=0;i<m;i++)
{
scanf("%d %s",&p1->a,p1->b);
p1=(struct... | 2 |
591 | struct book
{
int num;
char author[26];
struct book *next;
};
void main()
{
int m,i,j,l,max,maxi;int n[26]={0};
struct book *head,*p1,*p2;char *p;
scanf("%d",&m);
i=0;
p1=p2=(struct book *)malloc(LEN);
scanf("%d %s",&p1->num,p1->author);
head=NULL;
while(i<m)
{
i++;
if(i==1)
head=p... | 2 |
592 | struct book
{ int n;
char name[26];
struct book *next;
};
struct book *head;
int m;
struct book *creat()
{struct book *p1,*p2;
int i=0;
p1=p2=(struct book*)malloc(LEN);
scanf("%d %s",&p1->n,p1->name);
head=NULL;
while(i<m-1)
{i=i+1;
if(i==1) head=p1;
else p2->next=p1;
p2=p1;
p1=(struc... | 2 |
593 |
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 ... | 2 |
594 | struct
{
char z[30];
int n;
}s[1000];
struct
{
int name;
int nb,b[1000],k;
}r[93];
int main()
{
int m,i,j,l,q;
for(i=65;i<=90;i++)
{
r[i].name=i;
r[i].k=1;
}
scanf("%d",&m);
for(i=1;i<=m;i++)
{
scanf("%d %s",&s[i].n,s[i].z);
l=strlen(s[i].z);
for(j=0;j<l;j++)... | 2 |
595 | int main()
{
int num[27] = {0};
int n, i, j, temp;
unsigned long len;
char author[27], temp2, book[27][1000] = {'\0'};
char str[4];
cin >> n;
for (i = 0; i < n; i++)
{
cin >> str; //??????
cin.get();
cin.getline(author, 27);
len = strlen(au... | 2 |
596 | void main()
{
struct x
{
char num[26];
int y;
}q[1000],x0;
int n,i,j,c[100]={0},m=0,f;
scanf("%d",&n);
for(i=0;i<n;i++)
{scanf("%d %s",&q[i].y,&q[i].num);}
for(i=0;i<n;i++)
for(j=0;q[i].num[j]!='\0';j++)
m=(int)q[i].num[j],c[m]=c[m]+1;
for(m=0;m<100;m++)
if(c[m... | 2 |
597 | 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 auth... | 2 |
598 | struct book
{
int ISBN;
char name[26];
}b[999];
int main()
{
int i,j,m,k[26],max=0;
char a,d='A';
for(i=0;i<26;i++)
k[i]=0;
scanf("%d",&m);
for(i=0;i<m;i++)
scanf("%d%s",&b[i].ISBN,b[i].name);
for(a='A';a<='Z';a++)
for(i=0;i<m;i++)
for(j=0;j<26;j++)
if(b[i].name[j]==a)
k[a-'A... | 2 |
599 | 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++)
... | 2 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.