id int32 0 32.5k | code stringlengths 95 8.4k | label stringclasses 65
values |
|---|---|---|
900 |
struct book
{
int num;
char name[27];
}book[1000];
int main(int argc, char* argv[])
{
int m,i,j,a[27],len,max=0,number;
char p;
for(i=1;i<=26;i++){
a[i]=0;
}
scanf("%d",&m);
for(i=1;i<=m;i++){
scanf("%d %s",&book[i].num,&book[i].name);
len=strlen(book[i].name);
for(j=0;j<=len-1;j++){... | 2 |
901 | int main()
{
int n;
scanf("%d",&n);
int a[1000]={0},b[1000]={0},c[100]={0},l=0;
char s[1000][100]={0},m[26]={0},p;
int i=0,j=0,k=0,t=0;
for(i=0;i<n;i++)
{
scanf("%d %s",&a[i],s[i]);
}
for(i='A';i<='Z';i++)
{
m[j]=i;
for(t=0;t<n;t++)
{
for(k=0;s[t][k]!='\0';k++)
{
if(s[t][k]... | 2 |
902 | struct book
{ int id;
char aut[26];
};
int main()
{
int m,n,i,j,k;
int a[27]={0};
struct book cal[1001];
scanf("%d",&m);
for(i=0;i<m;i++)
{
scanf("%d%s",&cal[i].id,cal[i].aut);
}
for(j=65;j<91;j++)
{ for(i=0;i<m;i++)
{ for(k=0;k<27;k++)
{ if(cal[i].aut[k]==j)
a[j-65]++;
}
... | 2 |
903 | struct tushu{
int bianhao;
char writer[27];
}book[1000];
void jishu(struct tushu *p1,int a[26],int b);
int max(int c[26]);
void shu(struct tushu *p2,int d,int e);
int main(){
int n,i,m;
int zimu[26];
struct tushu *pointer;
pointer=&book[0];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d %s",&book[i... | 2 |
904 | int main(){
int n,i,j,max=0,b[1000],p[26];
char *bm[1000];
scanf("%d",&n);
for(i=0;i<26;i++)
p[i]=0;
for(i=0;i<n;i++){
scanf("%d",&b[i]);
bm[i]=(char *)malloc(26*sizeof(char));
scanf("%s",bm[i]);
for(j=0;j<strlen(bm[i]);j++){
p[(int)(*(bm[i]+j)-'A')]++;
}
}
for(i=0;i<26;i++){
if(p[i]>p[max])
... | 2 |
905 | struct author{
int sumbook;
int id[999];
}a[26];
int main(){
int n,i,j,bookid=0,pos=0,maxbook=0,maxid=0;
char booka[26];
scanf("%d",&n);
for(i=0;i<n;++i){
scanf("%d%s",&bookid,booka);
for(j=0;j<strlen(booka);++j){
pos=booka[j]-'A';
a[pos].id[a[pos].s... | 2 |
906 | struct book{
int num;
char aut[20];
};
void main()
{
int i,j,n,t,max=0;
char a[20];
int words[26]={0};
struct book b[100];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d%s",&(b[i].num),&(b[i].aut));
for(i=0;i<n;i++)
for(j=0;b[i].aut[j]!='\0';j++){
t=(int)b[i].aut[j]-65;
words[t]++... | 2 |
907 | int trans(char k)
{
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 i;
for(i=0;i<26;i++)
{
if(k==a[i])
return i;
}
}
int main ()
{
int m;
scanf("%d",&m);
struct point
{
int id;
char au[26];
}books[1000]... | 2 |
908 |
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... | 2 |
909 | int main()
{
int i,j,k,t,m,c[26]={0},max=0;
char b[27]={"ABCDEFGHIJKLMNOPQRSTUVWXYZ"};
struct book
{
int num;
char man[26];
}a[999];
scanf("%d",&m);
for(i=0;i<m;i++)
{
scanf("%d %s",&a[i].num,a[i].man);
}
i=0;
for(i=0;i<m;i++)
... | 2 |
910 | struct book
{
int num;
char name[20];
struct book *next;
};
int i,j,n,t,number[100],m;
struct book *creat(void)
{
struct book *p1,*p2,*head;
p1=p2=(struct book *)malloc(LEN);
scanf("%d %s",&p1->num,p1->name);
head=NULL;
for(i=1;i<m;i++)
{
if(i==1)
head=p1;
else
p2->next=p1;
p2... | 2 |
911 |
int main()
{
int m;
struct bo
{int a;
char au[36];
};
struct bo bo[999];
int i,j;
char k,K;
int sb[26]={0},sbt;
int len;
int n;
scanf("%d",&m);
for(i=0;i<m;i++){
scanf("%d %s",&bo[i].a,bo[i].au);
len=strlen(bo[i].au);
for(j=0;j<len;j++){
for(k=65;k<91;k++){
if(bo[i].au[j]=... | 2 |
912 | int max,n,x,b[30]={0};
struct book
{
int num;
char author[30];
struct book*next;
};
struct book*creat()
{
struct book*head,*p1,*p2;
p2=NULL;
head=(struct book*)malloc(len);
p1=head;
while(n>0)
{
char a[30];int i,j;
p2=p1;
x=0;
scanf("%d%s",&p1->num,&p1->author);
strcpy(a,p1->auth... | 2 |
913 |
struct list
{
int book;
char name[30];
};
int main(int argc, char *argv[])
{
int n,i,j;
scanf("%d",&n);
int a[26];
struct list shelf[n];
for (i=0;i<=25;i++)
a[i]=0;
for (i=0;i<=n-1;i++)
{
scanf("%d%s",&shelf[i].book,shelf[i].name);
for (j=0;j<=strlen(s... | 2 |
914 |
int num[1000];
char auth[1000][26];
int main()
{
int m,i,l;
scanf("%d",&m);
char c='A';
int k=0;
int a[26];
for(i=0;i<26;i++)
a[i]=0;
for (i=0;i<m;i++)
{
scanf("%d",&num[i]);
scanf("%s",auth[i]);
int j=0;
while(auth[i][j]!='\0')
{
a[auth[i][j]-64]++;
j++;
}
}
for... | 2 |
915 | int m;
struct book
{
char num[20];
char aut[20];
struct book*next;
};
struct book*creat()
{
struct book*head,*p1,*p2;
int i;
p1=(struct book*)malloc(LEN);
scanf("%s %s",p1->num,p1->aut);
p1->next=NULL;
head=p1;
p2=p1;
for(i=1;i<m;i++)
{
p1=(struct book*)malloc(LEN);
scanf("%s %s",p... | 2 |
916 |
int main()
{
int n;
int i, j;
int book_number[26];
int max = 0;
int max_n;
int author_len;
struct data
{
int number;
char author[27];
};
scanf("%d", &n);
struct data *input = (struct data*) malloc(sizeof(struct dat... | 2 |
917 | struct book
{
int num;
char author[27];
struct book *next;
};
void main()
{
int m,i,j,k,a[26],sum=0;
for(j=0;j<26;j++)
a[j]=0;
char aut;
scanf("%d",&m);
struct book *head,*pb1,*pb2;
head=NULL;
for(i=0;i<m;i++)
{
pb1=(struct book*)malloc(sizeof(struct book));
scanf("%d %s",&pb1->num,pb... | 2 |
918 | struct tushu
{
int num;
char name[26];
struct tushu *next;
};
struct tushu *creat(int n)
{
struct tushu *head,*p1,*p2;
p1=p2=(struct tushu *)malloc(LEN);
scanf("%d%s",&p1->num,p1->name);
head=p1;
int i;
for(i=1;i<n;i++)
{
p1=(struct tushu *)malloc(LEN);
scanf("%d%s",&p1->num,p1->name);
... | 2 |
919 |
int N;
struct stu
{
int num;
char au[50];
struct stu *next;
};
struct stu *creat() //????
{
struct stu *p1,*p2,*head;
int i;
for(i=0;i<N;i++)
{
p2=p1;
p1=Z;
scanf("%d%s",&p1->num,p1->au);
p1->next=0;
if(i==0) head=p1;
else p2->next=p1;
}
return head;
... | 2 |
920 | struct a{
int n;
char s[26];
}b[1000];
int main()
{
int n,i,j,c[26]={0};
char t;
scanf("%d",&n);
for (i=0;i<n;i++)
{
int d,m;
scanf("%d%s",&b[i].n,b[i].s);
d=strlen(b[i].s);
for(m=0;m<d;m++)
c[b[i].s[m]-65]+=1;
}
for(i=0;i<26;i++)
{
for(j=i+1;j<26;j++)
if(c[j]>c[i])
... | 2 |
921 | int main()
{
char a[1000][27],x;
int m,i,j,k,b[1000],c[26]={0},max=0;
cin>>m;
for(i=0;i<m;i++)
{
cin>>b[i]>>a[i];
int len=strlen(a[i]);
for(j=0;j<len;j++)
c[a[i][j]-'A']++;
}
for(j=0;j<26;j++)
if(max<c[j])
{
max=c[j];
x='A'+j;
}
cout<<x<<endl;
cout<<max<<endl;
... | 2 |
922 | void main()
{
int a[999],m,i,j,c[26],max=0,d,k;
scanf("%d\n",&m);
for(k=0;k<26;k++)
{
c[k]=0;
}
struct books
{
int num;
char name[26];
}
books[999];
for(i=0;i<m;i++)
{
scanf("%d %s",&books[i].num,books[i].name);
}
for(i=0;i<m;i++)
{
for(j=0;j<strlen(books[i].name);j++)
{
c[books[i].name[j]-'A']++;... | 2 |
923 |
int main()
{int m, i, j, b[999], n[26], t[2]={0}, x=0;
char a[999][26], au;
scanf("%d",&m);
for(i=0;i<m;i++)
{scanf("%d%s",&b[i],a[i]);}
for(i=0;i<m;i++)
{
for(j=0;j<(int)strlen(a[i]);j++)
{n[(int)a[i][j]-65]++;}
}
for(i=0;i<26;i++)
{
if(t[0]<n[i])
{t[0]=n[i],t[1]=i;}
}
au=t[1]+65;
printf("%c\n%d... | 2 |
924 | 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(s... | 2 |
925 | int main()
{
int n,i;
char wri[26]={'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z'};
int num[26];//?????????
char tem[100];
int j=0,k;
int shu[26][100];//?????
int hao;//??
for(i=0;i<26;i++)
num[i]=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
... | 2 |
926 | void main()
{
struct book
{
int num;
char w[27];
};
struct book b[1000];
int n,i,j,k,c[26]={0},max;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d%s",&b[i].num,b[i].w);
}
for(i='A';i<='Z';i++)
{
for(j=0;j<n;j++)
{
for(k=0;k<strlen(b[j].w);k++)
{
if(i==b[j].w[k])
{
... | 2 |
927 | struct student
{
int num;
char s[100];
struct student *next;
};
void main()
{
struct student *p1,*p2,*head;
int n,i,j,k,m,a[100];
char c[100],nam[100][100];
for(i=0;i<26;i++)
{ c[i]=i+65; a[i]=0;} //??
scanf("%d",&n);
p1=p2=head=(struct student*)malloc(LEN);
scanf("%d %s",&p1->num,p1... | 2 |
928 | int main ()
{
struct book
{
int num;
char name[27];
}b[1000];
int m,i,j,a=0;
int c[26];
scanf("%d",&m);
for (i=0;i<m;i++)
scanf("%d%s",&b[i].num,b[i].name);
for (i=0;i<m;i++)
{
for (j=0;j<strlen(b[i].name);j++)
c[*(b[i].name+... | 2 |
929 | struct author
{
int num;
char aut[27];
}a[999];
void main()
{
void search(struct author b[],int n,char marker);
int m ,i,times[30]={0};
int length=0,j;
int max=0,flag=9;
char chac;
scanf("%d",&m);
// printf("%d",m);
for(i=0;i<m;i++)
{
scanf("%d %s",&a[i].num,&a[i].aut);
// printf("%d %s"... | 2 |
930 | 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]]++;
}
fo... | 2 |
931 | 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... | 2 |
932 | struct student
{
long num;
char str[27];
struct student *next;
};
int n;
struct student *creat(int m)
{
struct student *head;
struct student *p1,*p2;
n=0;
p1=p2=(struct student*)malloc(LEN);
scanf("%ld %s",&p1->num,p1->str);
head=0;
while(p1->num!=0)
{
n=n+1;
if(n==1)head=p1;
else p2... | 2 |
933 | struct book
{
int name;
char writer[26];
};
void main()
{
struct book data[999];
int m,i,j,max=0,b=0;
int a[26]={0};
scanf("%d",&m);
for(i=0;i<m;i++)
scanf("%d %s",&data[i].name,data[i].writer);
for(i=0;i<m;i++)
for(j=0;j<strlen(data[i].writer);j++)
a[data[i].writer[j]-'A']++;
fo... | 2 |
934 | 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 |
935 | main()
{
int n,i,j,max=0,maxp;
scanf("%d",&n);
int a[n];
int person[26]={0};
char writer[n][26];
for (i=0;i<n;i++)
{
scanf("%d %s",&a[i],writer[i]);
for (j=0;j<strlen(writer[i]);j++)
{
person[writer[i][j]-'A']++;
... | 2 |
936 |
int main(int argc, char* argv[])
{
int n,i,j,m,b=0,max;
int let[26]={0};
char a;
struct student{
int num;
char name[26];
}book[999];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d%s",&book[i].num,&book[i].name);
}
for(i=0;i<n;i++){
m=strlen(book[i].name);
for(j=0;j<m;j++){
let[book[... | 2 |
937 | struct book
{
int num;
char auth[26];
struct book *next;
};
struct book *creat(int m)
{
int i=0;
struct book *head,*p1,*p2;
if(i==0)
{
p1=(struct book*)malloc(sizeof(struct book));
scanf("%d %s",&p1->num,p1->auth);
head=p1;
p2=p1;
p1->next=NULL;
i++;
}
while(i<m)
{
p1=(struc... | 2 |
938 |
struct author {
char id;
int count;
int books[1000];
};
int cmp(const void *a, const void *b) {
const struct author *pa = (const struct author *) a;
const struct author *pb = (const struct author *) b;
return pb->count - pa->count;
}
int main() {
int i, j, num, id, len, idx;
struct author auth... | 2 |
939 | int main()
{
int n,i,l,x,maxnumber;
scanf("%d",&n);
int a[1000];
char k[1000][30];
int author[27]={0};
for(i=1;i<=n;i++)
{
scanf("%d %s",&a[i],k[i]);
int m;
m=strlen(k[i]);
for(l=0;l<30;l++)
... | 2 |
940 | int main()
{
char temp,s;
int i,j,t[27][2000],m,n,a[27] = {0},num[2000],x;
{
cin >> n;
for (i = 1; i <= n; i++ )
{
cin >> num[i];
temp = cin.get();
while (temp == '\n' || temp == ' ' )
{
temp = cin.get();
... | 2 |
941 | struct book *head;
int abc[26];
struct book
{
int num;
char name[1000];
struct book *next;
};
void ffind(char * name)
{
while(*name!=0)
{
abc[*name-65]++;
name++;
}
}
int mfind(char * name,char a)
{
while(*name!=0)
{
if(a==*name)return 1;
name++;
}
}
struct book* crea... | 2 |
942 | void main()
{
int i,n,j,t,m,a[26]={0},book[999],max;
char writer[999][26],maxwriter;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d %s",&book[i],writer[i]);
m=strlen(writer[i]);
for(j=0;j<m;j++)
{
t=writer[i][j]-'A';
a[t]++;
}
}
max=0;
maxwriter='A';
for(i=0;i<26;i++)
{
i... | 2 |
943 | struct A
{
char num[1000];
char B[27];
};
void main()
{
int n,i,a,k,t;
int sb[27]={0};
int sb2[27]={0};
char x;
scanf("%d",&n);
struct A book[999]={0};
for (i=0;i<n;i++)
{
scanf("%s%s",book[i].num,book[i].B);
}
for(i=0;i<n;i++)
{
for(k=0; ;k++)
{
a=book[i].B[k];
if (bo... | 2 |
944 | void main()
{
int i,n,t[27],max;
char p,a[100][27],b[100][27];
scanf("%d",&n);
for(i=1;i<=26;i++) t[i]=0;
for(i=1;i<=n;i++) scanf("%s%s",a[i],b[i]);
for(p='A';p<='Z';p++)
for(i=1;i<=n;i++)
if(strchr(b[i],p)) t[p-'A'+1]++;
max=1;
for(i=2;i<=26;i++)
if(t[max]<t[i]) max=i;
printf("%c\n",p='A'+... | 2 |
945 | struct book
{
int num;
char name[27];
struct book *next;
};
struct book *creat(int n)
{
struct book *head,*p1,*p2;
int m=0;
head=p1=p2=NULL;
p1=p2=(struct book *)malloc(sizeof(struct book));
scanf("%d %s",&p1->num,p1->name);
while(1)
{
m+=1;
if(m>=n)break;
if(m==1)head=p1;
else p2->... | 2 |
946 | int main()
{
int num[999] , count[27] = {0} , len[999];
int m , i , j , max = 0 , per;
cin >> m;
char ch[999][26] , person;
for (i = 1 ; i <= m ; i++)
{
cin >> num[i] >> ch[i];
len[i] = strlen (ch[i]);
for (j = 0 ; j <= len[i] - 1 ; j++)
{
count[ch[i][j] - 64]++;
}
}
for (i = 1 ; i <... | 2 |
947 | struct book
{
int num;
char aut[26];
};
int main()
{
int i,j,k,m,x,a=0;
int count[26]={0};
char y;
struct book all[1000];
scanf("%d",&m);
for(i=0;i<m;i++){
scanf("%d%s",&all[i].num,&all[i].aut);
}
for(i=0;i<m;i++){
for(j=0;j<26;j++){
if(all[i].aut[j]>='A'&&all[i].aut[j]<='Z'){
x... | 2 |
948 | int main()
{
int m,len[1000],sum[26]={0},max,i,j,i0;
scanf("%d",&m);
struct book{
int num;
char wri[27];
}book[1000];
for(i=0;i<m;i++){
scanf("%d %s",&book[i].num,book[i].wri);
len[i]=strlen(book[i].wri);
}
for(i=0;i<m;i++)
for(j=0;j<len[i];j++)
sum[book[i].wri[j]-65]++;
max=sum[0];
... | 2 |
949 | int main()
{
struct book
{
int m;
char a[26];
};
int n,i,j,k,q=0;int b[26]={0},c[26];
scanf("%d",&n);
struct book * p;
p=(struct book *)malloc(n*sizeof(struct book));
for(i=0;i<n;i++)
scanf("%d %s",&p[i].m,p[i].a);
for(i=0;i<26;i++)
for(j=0;j<n;j++)
for(k=0;k<26;k++)
if(p[j].a[k]... | 2 |
950 | int m;
struct book
{
int num;
char name[26];
struct book *next;
};
struct book *create(void)
{
struct book *head,*p1,*p2;
int i;
scanf("%d",&m);
p1=(struct book *)malloc(LEN);
scanf("%d %s",&p1->num,p1->name);
head=NULL;
for(i=1;i<m;i++)
{
if(i==1) head=p1;
else p2->next=p1;
p2=p1;
... | 2 |
951 | 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... | 2 |
952 | int main()
{
int A[100],C[26]={0},n,i,j,m,a=0,b;
char B[100][100],c;
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%d%s",&A[i],B[i]);
}
for (i=0;i<n;i++)
{
for (j=0;j<strlen(B[i]);j++)
{
m=B[i][j];
C[m-65]++;
}
}
for (i=0;i<26;i++)
{
if (a<C[i])
{
a=C[i];
b=i;
}
... | 2 |
953 |
struct info
{
int num;
char author[26];
} a[1000];
int main()
{
int i,m,j,b[26]={0};
char out;
scanf("%d\n",&m);
for(i=0;i<m;i++)
scanf("%d %s\n",&a[i].num,a[i].author);
for(i=0;i<m;i++)
for(j=0;j<26;j++)
b[a[i].author[j]-'A']++;
int max=b[0];
for(i=0;i<26;i++)
max=max>b[i]?max... | 2 |
954 | 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->na... | 2 |
955 |
void main()
{
struct book
{
int num;
char wri[26];
}*s;
int n,i,j,a[100],t;
char c;
s=(struct book *)malloc(n*sizeof(struct book));
for(i=0;i<100;i++)
a[i]=0;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d %s",&(*(s+i)).num,(*(s+i)).wri);
for(i=0;i<n;i++)
for(j=0;(*(s+i)).wri[j]!='\0... | 2 |
956 | struct s
{
long h;//??????????
char z[1000];
struct s *next;
};
struct s *create(int n)
{
struct s *head,*p1,*p2;
int i=0;
p1=p2=(struct s *)malloc(len);
scanf("%ld %s",&p1->h,p1->z);//???????????????????
head=0;
while(i<n-1)//???????
{
i++;
if(i==1) head=p1;
else
p2->next=p1;
p... | 2 |
957 | 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']++;
... | 2 |
958 | int main()
{
int i,j,k,l,m,n,g[26]={0},s[26][1000]={0};
char a[50];
scanf("%d",&n);
for(m=0;m<n;m++)
{for(i=0;i<50;i++)
a[i]=0;
scanf("%d%s",&l,a);
for(i=0;i<26;i++)
for(j=0;j<26;j++)
if(a[i]=='A'+j)
{s[j][g[j]]=l,g[j]++;
break;}}
m=0;
for(i=0;i<26;i++)
if(g[i]>m) m=g[... | 2 |
959 |
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;
... | 2 |
960 |
int main()
{
int maxc=0,i,j,n,a[1000],c;
char maxp,b[1000][27],p;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d%s",&a[i],b[i]);
}
for (p='A';p<='Z';p++)
{
c=0;
for(i=0;i<n;i++)
{
for(j=0;;j++)
{
if... | 2 |
961 | int main()
{
int n;char name[1000][26];int num[1000];
int i,j;char b[26]={'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z'};
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d%s",&num[i],name[i]);
}
int a[26]={0};char k;
for(i=0;i<n;i++)
{
for(j=... | 2 |
962 | 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;
... | 2 |
963 | void main()
{
char name[30]={"ABCDEFGHIJKLMNOPQRSTUVWXYZ"},c[1000][100];
int n,a[1000],num[100]={0},i,j,k,max=0,t;
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%d ",&a[i]);
scanf("%s",c[i]);
}
for (i=0;i<n;i++)
{
for (k=0;c[i][k]!='\0';k++)
{
for (j=0;name[j]!='\0';j++)
{
if (name[j... | 2 |
964 | struct book
{
int num;
char aut[27];
struct book *next;
};
int n;
struct book *creat(int amount)
{
struct book *head;
struct book *p1,*p2;
n=0;
p1=(struct book *)malloc(sizeof(struct book));
p2=p1;
scanf("%d %s",&p1->num,p1->aut);
while(n<amount-1)
{
n=n+1;
if(n==1)head=p1;
else p2->... | 2 |
965 |
int main()
{
int i, j, n;
struct book
{
int no;
char as[10];
} bk;
scanf("%d", &n);
struct book * books = (struct book *)malloc(sizeof(struct book) * n);
for (i = 0; i < n; i++)
{
scanf("%d %s", &bk.no, bk.as);
books[i] = bk;
}
... | 2 |
966 | struct book
{
int id;
char s[L];
int len;
}b[M];
void fun(int count[L],char s[L],int len)
{
int i;
for(i=0;i<len;i++)
{
int m;
m=s[i]-'A';
count[m]++;
}
}
int judge(char s[L],int len,char name)
{
int i,answer=0;
for(i=0;i<len;i++)
{
if(s[i]==name)
{
answer=1;
break;
... | 2 |
967 | void main()
{
struct b
{int n;
char a[26];
};
struct b b[999];
int m,k,i,j,c[26]={0},p=0,q=0;
char x;
scanf("%d",&m);
for(i=0;i<m;i++)
scanf("%d%s",&b[i].n,&b[i].a);
for(i=0;i<m;i++)
for(j=0;(x=b[i].a[j])!='\0'&&j<26;j++)
c[x-65]++;
k=c[0];
for(i=0;i<26;i++)
if(c[i]>k){k=c[i];p=i;}
... | 2 |
968 | int main()
{
int i,j,temp=26,n,p[27]={0};
struct {
int a;
char s[30];
}t[1000];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d %s",&t[i].a,t[i].s);
for(j=0;j<strlen(t[i].s);j++)
{
p[t[i].s[j]-'A']++;
}
}
for(i=0;i<26;i++)
{
if(p[i]>p[temp])
temp=i;
}
printf("%c\n%d\n",t... | 2 |
969 |
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)
{... | 2 |
970 | struct book
{ int n;
struct book *next;
};
struct au
{
char n;
int s;
struct book *p;
};
void main()
{
int i,j,k,l,m,n,*p,a[100][1100]={0},max=0,b[100]={0};
char s[30];
scanf("%d",&n);
for(l=1;l<=n;l++)
{
scanf("%d",&j);
scanf("%s",s);
for(i=0;s[i]!='\0';i++)
{
b[s[i]]++;
a... | 2 |
971 | int main()
{
char mo='A';
int a[ASC]={0};
int i,j,n;
struct
{ int num;
char wr[MAX_N+1];
}book[MAX_M];
scanf("%d",&n);
for(i=0;i<n;i++)
{scanf("%d%s",&book[i].num,book[i].wr);
for(j=0;book[i].wr[j];j++)
{if(++a[book[i].wr[j]]>a[mo]) mo=book[i].wr[j];}
}
printf("%c\n%d\n",mo,a[mo]);
for(i=0... | 2 |
972 | struct books
{
int num;
char name[100];
struct books *next;
};
struct books * create(int n)
{
struct books *head,*p1,*p2;
p1=(struct books*)malloc(Len);
scanf("%d %s",&p1->num,p1->name);
p1->next=NULL;
head=p1;
p2=p1;
while(--n)
{
p1=(struct books*)malloc(Len);
scanf("%d %s",&p1->num,p1-... | 2 |
973 | 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(... | 2 |
974 | struct book
{
int num;
char wr[26];
};
int main()
{
int n,b[91][1000],max=0,i,j,k,s,m,writer;
struct book bk[1000];
scanf("%d",&n);//??????//
for(i=0;i<n;i++)
{
scanf("%d%s",&bk[i].num,bk[i].wr);
}//?????????//
for(i=0;i<26;i++)//?????//
{
s=0;
for(j=0;j<n;j++)//???????i???//
{
... | 2 |
975 | void main()
{
int n,i,j,k,a[1000],max=0,t,p[26]={0};
char c[1000][27],d,l[26]={'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z'};
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d %s",&a[i],c[i]);
for(i=0;i<n;i++)
for(j=0;j<strlen(c[i]);j++)
for(k=0;k... | 2 |
976 | struct book
{
int num;
char a[26];
struct book *next;
};
void main()
{
struct book *head,*p,*s;
head=(struct book *)malloc(sizeof(struct book));
head->next=NULL;
int n,i,j,c[26]={0},max,maxj;
char b[26];
for(j=0;j<26;j++)
b[j]=65+j;
scanf("%d",&n);
p=head;
for(i=0;i<n;i++)
{
s=(struc... | 2 |
977 |
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++)... | 2 |
978 |
void main()
{
int m;
scanf("%d",&m);
int i,j,k,x,t;
struct book
{
int num;
char w[26];
}b[1000];
for(i=0;i<m;i++)
{
scanf("%d",&b[i].num);
scanf("%s",&b[i].w);
}
int c[26];
for(i=0;i<26;i++)c[i]=0;
for(i=0;i<26;i++)
{
for(j=0;j<m;j++)
... | 2 |
979 | struct book
{
int num;
char name[27];
struct book *next;
};
int m;
struct book *head;
struct book *setup()
{ int t=0;
struct book *head,*p1,*p2;
head=p1=p2=(struct book *)malloc(sizeof (struct book));
scanf("%d %s",&p1->num,p1->name);
while(t<m)... | 2 |
980 | struct book
{
int num;
char name[26];
}book[1000];
int judge(char*a,int b);
int main(int argc, char* argv[])
{
char c;
int n=0,i=0,j=0,rec[26]={0},k=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d%s",&book[i].num,book[i].name);
}//????
for(i=0;i<26;i++)//??i??????
{
for(j=0;j<n;j++)//??j?... | 2 |
981 |
int main ()
{
int m;
cin >> m;
char writter[27];
int data[26][1000];
memset(data,0,sizeof(data));
int max = 0;
char max_name;
for (int i = 1; i <= m; i++){
int number;
cin >> number >> writter;
for (int j = 0; j < strlen(writter); j++){
... | 2 |
982 | int main()
{
char book[1000][20]={'\0'},name[1000][30]={'\0'};
int length,n,i,j,number[30]={0},memory,largest,temp;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %s",book[i],name[i]);
}
for(i=0;i<n;i++)
{
length=strlen(name[i]);
for(j=0;j<length;j++)
{
temp=name[i][j]-'A';
number[tem... | 2 |
983 | void main()
{
struct book{int num;char author[26];}b[999];
int a[26]={0},n,i,j,k,max=0;
scanf("%d",&n);
for(i=0;i<n;i++)scanf("%d %s",&b[i].num,b[i].author);
for(i=0;i<26;i++)
{
for(j=0;j<n;j++)
{
k=0;
while(b[j].author[k]!='\0')
{if(b[j].author[k]==i+65)a[i]++;
k++;}
}
}
for(i... | 2 |
984 | 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 |
985 | struct book
{
int num;
char name[27];
}b[1001];
void main()
{
int n,i,j,k,d,g[27],e=0,f=0,l;
char m,h;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d %s",&b[i].num,b[i].name);
m='A';
for(k=0;k<26;k++)
{
d=0;
for(i=0;i<n;i++)
{
for(j=0;j<26;j++)
{
if(b[i].name[j]==m)
d... | 2 |
986 | void main()
{
int n,i,j,t[26]={0},k=0,max,h;
scanf("%d",&n);
struct book
{
int a;
char b[26];
}book[100]={0,""};
for(i=0;i<n;i++)
{
scanf("%d%s",&book[i].a,book[i].b);
}
for(i=0;i<n;i++)
{
k=strlen(book[i].b);
for(j=0;j<k;j++)
{
t[book[i].b[j]-65]++;
}
}
max... | 2 |
987 | void main()
{
struct book
{
int a;
char b[20];
}book[999];
int n,i,k,max,m,j,p;
int c[999]={0};
char str1[20],str2[20];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d %s",&book[i].a,&book[i].b);
m=strlen(book[i].b);
strcpy(str1,book[i].b);
for(j=0;j<m;j++)
c[str1[j]]= c[str1[... | 2 |
988 | struct information
{
int a;
char s[26];
int len;
}xinxi[1000];
void main()
{
int n,i,c[26]={0},max,t,j;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d %s",&xinxi[i].a,xinxi[i].s);
xinxi[i].len=strlen(xinxi[i].s) ;
}
for(i=0;i<n;i++)
for(j=0;j<xinxi[i].len;j++)
{
if(... | 2 |
989 |
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[... | 2 |
990 | struct st
{
int a;
char s[26];
struct st *n;
}
;
struct st *creat(int m)
{
int i;
struct st *p1,*p2,*head;
for(i=0;i<m;i++)
{
p1=(struct st *)malloc(len);
if(i==0)head=p1;
else p2->n=p1;
scanf("%d %s",&p1->a,p1->s);
p2=p1;
}
p1->n=NULL;
return(head);
}
void main()
{
int m;
... | 2 |
991 | int main()
{
struct book
{
int num;
char writer[26];
}bookn[999];
struct zuozhe
{
char w;
int count;
}zuozhen[26];
int n,i;
scanf("%d",&n);
for(i=0;i<26;i++)
{
zuozhen[i].w='A'+i;
zuozhen[i].count=0;
}
int h=0;
int m,j;
for(i=0;i<n;i++)
{
scanf("%d %s",&bookn[i].num,b... | 2 |
992 | struct book
{
int order;
int num;
char writer[26];
}b[1000];
int main()
{
int n,i,j,k,p,q[1000];
scanf("%d",&n);
for(i=0;i<=(n-1);i++)
{
scanf("%d %s",&b[i].num,b[i].writer);
b[i].order=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','... | 2 |
993 | void main()
{
int num[1000],i,j,a[26]={0},len,k,max,l=0;
char x[1000][10];
int n;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d %s",&num[i],x[i]);
for(i=0;i<n;i++)
{
len=0;
k=0;
len=strlen(x[i]);
for(j=0;j<len;j++)
{
k=x[i][j];
a[k-65]++;
}
}
max=a[0];
for(j=1;j<26;j++)... | 2 |
994 | int main()
{
int m, a, i, j, k, n, s[26][999] = {0}, p[26] = {0};
char b[26], c;
cin >> m;
for(i = 0; i < m; i++)
{
cin >> j;
cin >> b;
n = strlen(b);
for(k = 0; k < n; k++)
{
a = b[k] - 'A';
s[a][p[a]] = j;
p[a] ++;
}
}
j = 0;
for(i = 1; i < 26; i++)
{
if(p[j] < p[i]... | 2 |
995 | int max(int array[26])
{
int i,max=0;
for(i=0;i<26;i++)
if(array[i]>max)max=array[i];
for(i=0;i<26;i++)
if(max==array[i])break;
return i;
}
void main()
{
struct book
{
int num;
char aut[26];
};
int a,i,j,m,k,t[26]={0};
struct book nbook[999];
scanf("%d",&m);
for(i=0;i<m;i++)
sca... | 2 |
996 | 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)<<e... | 2 |
997 | 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(s... | 2 |
998 | struct
{
int no;
char wr[26];
}book[999];
struct
{
char name;
int num;
int book[999];
}a[26];
int main()
{
int n,m,t,k,d;
int all=0;
for (t=0;t<26;t++)
{
a[t].name='A'+t;
a[t].num=0;
}
scanf("%d",&m);
for (t=0;t<m;t++)
{
scanf("%d %s",&book[t].no,book[t].wr);
}
for... | 2 |
999 | int main(int argc, char* argv[])
{
int m,i,j,A[26]={0},B[26];
char s;
scanf("%d",&m);
struct book{
int num;
char n[26];
}*book;
book=(struct book*)malloc(sizeof(struct book)*m);
for(i=0;i<m;i++)
{
scanf("%d %s",&book[i].num,book[i].n);
for(j=0;book[i].n[j]!='\0';j++)
{
switch(book... | 2 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.