id int32 0 32.5k | code stringlengths 95 8.4k | label stringclasses 65
values |
|---|---|---|
800 |
void main()
{
int n,i,k[100],l[26]={0},m=0,v,j;
char c[100][26];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d %s",&k[i],c[i]);
for(j=0;j<strlen(c[i]);j++)
{
l[(int)c[i][j]-65]+=1;
}
}
for(i=0;i<26;i++)
{
if(l[i]>m)
m=l[i];
}
for(i=0;i<26;i++)
{
if(l[i]==m)
{
... | 2 |
801 | 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<2... | 2 |
802 | struct book
{
int mark;
char name[26];
};
int main()
{
int m,h,i,j,k,max,length;
int t[26];
char a;
scanf("%d",&m);
struct book book[1000];
for(i=0;i<m;i++)
{
scanf("%d%s",&book[i].mark,book[i].name);
}
for(i=0;i<26;i++)
{
a='A'+i;
t[i]=0;
for(j=0;j<m;j++)
{
le... | 2 |
803 |
struct book
{
int num;
char writer[26];
};
int m;
int main()
{
int i;
scanf("%d",&m);
book *p;
p=(struct book*)malloc(sizeof(struct book)*m);
for(i=0;i<m;i++)
{
scanf("%d %s",&p[i].num,p[i].writer);
}
int j=0,u=0;
int *a;
a=(int *)malloc(sizeof(int)*150);
f... | 2 |
804 | int main(int argc, char* argv[])
{
struct {
int a;
char b[26];
}num[999];
int i,m,j,k;
int s[26];
scanf ("%d",&m);
for (i=0;i<m;i++)
{
scanf ("%d%s",&num[i].a,num[i].b);
}
for (k=0;k<26;k++)
{
s[k]=0;
}
for (i=0;i<m;i++)
{
for (j=0;num[i].b[j]!='\0';j++)
{
k=num[i]... | 2 |
805 | struct book
{
int id;
char str[27];
}bo[1000];
struct people
{
int name;
int number;
int book_number[1000];
}people[26];
int main ( )
{
int n, i, j, k, m, max = 0;
char a[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','\0'};
cin >> n... | 2 |
806 |
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++)
... | 2 |
807 | void main()
{
struct book
{
int num;
char name[26];
};
int m,i,j,max;
int sum[26]={0};
scanf("%d",&m);
struct book b[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<... | 2 |
808 | int main()
{
int n, i, j, k, f=0, c, d;
struct aut
{ int num;
char wrt[26];
}a[999];
char wr[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 g[26]={0};
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d%s",&a[i].num,a[i].wrt);
... | 2 |
809 | int main()
{
int n,max,t,i,j,a[1000],l,b[30]={0},c;
char str[1000][20];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d %s",&a[i],str[i]);
l=strlen(str[i]);
for(j=0;j<l;j++){
b[str[i][j]-64]++;
}
}
for(i=1;i<27;i++){
if(b[i]>max){
max=b[i];
t=i;
}
}
printf("%c\n%d\n",t+64,b[t]... | 2 |
810 | 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->... | 2 |
811 | void main()
{
struct book
{
int num;
char wri[26];
struct book *next;
};
int n,m,i;
scanf("%d",&m);
struct book *head,*p1,*p2;
n=0;
p1=p2=(struct book *)malloc(L);
scanf("%d%s",&p1->num,p1->wri);
head=NULL;
for(i=0;i<m-1;i++)
{
n=n+1;
if(n==1)head=p1;
else p2->next=p1;
p2=p... | 2 |
812 | 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... | 2 |
813 |
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++)... | 2 |
814 | struct inf
{
int sum;
char write[1000][4];
};
int main()
{
int m;
int i,j;
char name[5];
char author[27];
struct inf book[26];
for(i=0;i<26;i++)
book[i].sum=0;
cin >> m ;
cin.get();
while( m -->0 )
{
cin.get( name,5);
cin.getline( author,27);
for(i=0;i <strlen(author);i++)... | 2 |
815 | struct a
{
int number;
char author[26];
}b[100];
int main()
{
int L[26]={0};
int n=0;
int max=0;
int p=0;
cin>>n;
for(int i=0;i<n;i++)
{
cin>>b[i].number;
cin>>b[i].author;
for(int j=0;b[i].author[j]!='\0';j++)
L[b[i].author[j]-'A']++;
}
for(int i=0;i<26;i++)
if(max<L[i])
{
... | 2 |
816 | struct book
{
int a;
char b[30];
struct book *next;
};
void main()
{
int i,k,m,max=0,t;
char j,ch;
struct book *head,*p1,*p2;
scanf("%d",&m);
p1=(struct book*)calloc(1,sizeof(struct book));
head=p1;
for(i=0;i<m;i++)
{
scanf("%d %s",&(p1->a),p1->b);
p2=p1;
if(i==m-1)
p2->next=NULL;... | 2 |
817 | struct shu
{
int num;
char author_name[27];
};
int main()
{
int ere[26];
int m,i,max=0,key;
for(i=0;i<26;i++)
{
ere[i]=0;
}
char *a;
struct shu book[999];
scanf("%d",&m);
for(i=0;i<m;i++)
{
scanf("%d",&book[i].num);
scanf("%s",book[i].author_name);
}
for(i=0;i<m;i++)
{
a... | 2 |
818 | struct book
{
int id;
char writer[30];
}book[1200];
int main()
{
int n,l,t,a[30];
char m;
cin>>n;
for(int i=0;i<30;i++) a[i]=0;
for(int i=0;i<n;i++)
{
cin>>book[i].id>>book[i].writer;
l=strlen(book[i].writer);
for(int j=0;j<l;j++)
{
t=book[i].writer[j]-65;
a[t]++;
}
}
t=a... | 2 |
819 | struct test {
int num;
int book[100];
}a[26];
int main() {
int n,i,j,index,temp,max;
char s[100];
char ch;
scanf("%d",&n);
for (i=0;i<26;i++) {
a[i].num=0;
}
for (i=0;i<n;i++) {
scanf("%d %s",&index,&s);
for (j=0;s[j]!='\0';j++) {
temp = (int)(s[j]-'A');
a[temp].book[a[temp].num]=... | 2 |
820 | struct book
{
int num;
char name[26];
struct book *next;
};
struct book *creat(int m)
{
struct book *head,*p1,*p2;
p1=(struct book *)malloc(sizeof(struct book));
scanf("%d %s",&p1->num,p1->name);
int i;
for(i=1;i<m;i++)
{
if(i==1) head=p1;
else p2->next=p1;
p2=p1;
p1=(struct book *)mal... | 2 |
821 | 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],... | 2 |
822 |
void main()
{
int s=0,n,i,j,b[26]={0},t,x,m,q;
char a[1000][27];
scanf("%d\n",&n);
for(i=0;i<n;i++)
{
gets(a[i]);
}
for(i=0;i<n;i++)
{
t=strlen(a[i]);
for(j=4;j<t;j++)
{
x=a[i][j];
b[x-65]=b[x-65]+1;
}
}
for(i=0;i<26;i++)
{
if(b[i]>s)
{s=b[i];x=i;}
}
printf... | 2 |
823 | 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[... | 2 |
824 | 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... | 2 |
825 | /*????????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;
... | 2 |
826 | main()
{
int m,n,j,k,id[1001],a[26]={0};
char c[1001][26],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(j=1;j<=n;j++) {scanf("%d %s",&id[j],&c[j]);}
for(m=0;m<26;m++)
{
for(j=1;j<=n;j++)
... | 2 |
827 | struct book
{
char number[20];
char name[26];
}books[1000];
main()
{
int n,i,j;int count[26]={0};int temp,base,k=0;char author;int pd=0,N=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %s",&books[i].number,&books[i].name);
}
... | 2 |
828 |
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,siz... | 2 |
829 | 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] - ... | 2 |
830 | struct book
{
int num;
char author[26];
struct book *next;
};
struct book *creat()
{
int n;
scanf("%d",&n);
int i=1;
struct book *head,*p1,*p2;
p1=(struct book*)malloc(LEN);
scanf("%d %s",&p1->num,p1->author);
p1->next=NULL;
if(i>=n) {free(p1);head=NULL;return head;}
else
{head=... | 2 |
831 | struct Book
{
int number;
char author[30];
};
void main()
{
int max=0,len;
int sum[30]={0};
int m,i,j;
struct Book book[999];
scanf("%d",&m);
for(i=0;i<m;i++)
{
scanf("%d %s",&book[i].number,book[i].author);
len=strlen(book[i].author);
for(j=0;j<len;j++)
sum[book[i].author[j]-65]++;... | 2 |
832 |
struct inf
{
int num;
char wri[27];
struct inf *next;
};
void main()
{
int n,i,time[26]={0};
//for(i=0;i<26;i++)
// printf("%d",time[i]);
char *pn;
struct inf *head,*p1,*p0,*p;
scanf("%d",&n);
p1 = head = (struct inf*)malloc(sizeof(struct inf));
for (i=0;i<n;i++)
{
p0 = (struct inf*... | 2 |
833 | 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);
... | 2 |
834 | struct su
{
int a;
char b[26];
struct su *next;
};
int main()
{
int n,c[26]={0},i,k,j,l,max,m;
struct su *p,*head,*q;
scanf("%d",&n);
for(i=0;i<n;i++)
{
p=(struct su *)malloc(sizeof(struct su));
if(i==0)
{head=p;
q=p;
scanf("%d %s",&p->a,p->b);
k=strlen(p->b);
for(j=0;j... | 2 |
835 |
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(... | 2 |
836 | 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]++;
... | 2 |
837 | 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++)
{
... | 2 |
838 | 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;
... | 2 |
839 | struct BOOK
{
int No;
char author[27];
}book[999];
int letter[26]={0};
main()
{
int letter[26]={0};
int count=0;
int m,n,s;
scanf("%d",&m);
int i,j,max;
for(i=0;i<m;i++){
scanf("%d%s",&book[i].No,&book[i].author);
}
for(i=0;i<m;i++){
for(j=0;j<strlen(book[i].author);j++){
n=book[i]... | 2 |
840 |
int main(int argc, char* argv[])
{
int m,i,j,len,max;
int id[1000],b[26]={0};
char a[100][27],name;
scanf("%d",&m);
for(i=0;i<m;i++){
scanf("%d %s",&id[i],a[i]);
len=strlen(a[i]);
for(j=0;j<len;j++){
b[a[i][j]-'A']++;
}
}//??????????????????????????
max=b[0];name='A';
for(j=1;... | 2 |
841 |
int main(int argc, char* argv[])
{
int n;
scanf("%d",&n);
struct{
int a;
char s[26];
}zuozhe[1000];
int i, k;
for(i=0;i<n;i++){
scanf("%d %s",&zuozhe[i].a, zuozhe[i].s);
}
int c[26]={0}, d;
for(i=0;i<n;i++){
d=strlen(zuozhe[i].s);
for(k=0;k<d;k++){
c[zuozhe[i].s[k]-65]++;
}
... | 2 |
842 |
int c[255];
int main()
{
int i,j,n;
char m = 0;
struct {
int id;
char s[255];
} a[1000];
scanf("%d", &n);
for (i=0;i<n;i++) {
scanf("%d%s", &a[i].id, a[i].s);
for (j=0; a[i].s[j]; j++) {
if (++c[a[i].s[j]] > c[m])
m=a[i].s[j];
}
}
printf("%c\n%d\n", m, c[m]);
for (i=0;i<n;i... | 2 |
843 | int main()
{
int m,sum[27]={0},max=0,author;
cin>>m;
char str[1000][4],name[1000][27];
for(int i=0;i<m;i++) cin>>str[i]>>name[i];
for(int i=0;i<m;i++){
for(int j=0;j<strlen(name[i]);j++)
sum[name[i][j]-'A']++;
}
for(int i=0;i<26;i++){
if(max<sum[i]){
max=sum[i];
author=i;
}
}
cou... | 2 |
844 | int main()
{
struct book
{
int num;
char author[26];
}list[999],*p;
int n;
int count[26]={0};
int i;
char k='A';
int max;
scanf("%d",&n);
for(p=list;p<list+n;p++){
scanf("%d %s",&p->num,p->author);
}
for(p=list;p<list+n;p++){
for(i=0;;i++){
if(p->author[i]=='\0'){
bre... | 2 |
845 | struct book
{int num;
char str[200];
}bk[1000];
int main()
{
int m,i,l,k,p=0,max,maxl;
int a[200][1000];
int b[200];
scanf("%d",&m);
for(i=0;i<m;i++)
scanf("%d%s",&bk[i].num,bk[i].str);
for(l=0;l<26;l++)
{
for(i=0;i<m;i++)
{
for(k=0;bk[i].str[k]!='\0';k++)
... | 2 |
846 | struct xinxi
{
int sh;
char zz[20];
}a[1000];
void main()
{
int n,i,l,j,b[26]={0},m=0,k=0;
char c;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d%s",&a[i].sh,a[i].zz);
for(i=0;i<n;i++)
{
l=strlen(a[i].zz);
for(j=0;j<l;j++)
b[a[i].zz[j]-65]++;
}
for(i=0;i<26;i++)
if(b[i]>m) {m=b[i];k=... | 2 |
847 | 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 ma... | 2 |
848 | int main(){
int max,max1,t,k,x[28]={0},n,a,b,c,d,i,j;
char cc,y[100][32],q;
scanf("%d",&n);
scanf("%c",&cc);
for(i=1;i<=n;i++){
gets(y[i]);
for(j=2;y[i][j];j++){
if(y[i][j]>='A'&&y[i][j]<='Z'){
x[y[i][j]+1-'A']++;}
}}
max=x[1];
max1=1;
for(i=2;i<=26;i++){
if(x[i]>max){
max=x[i];... | 2 |
849 | int main()
{
int m;
int i, j, a,n;
struct book{
int no;
char name[30];
}book[999];
int author1[30]={0}, author2[30]={0};
char k;
scanf("%d", &m);
for(i=0;i<m;i++)
scanf("%d %s", &book[i].no, &book[i].name);
for(i=0;i<m;i++){
a = strlen(book[i].name);
for(j=0;j<a;j++){
for(k='A';k<=... | 2 |
850 | struct Bo{
int num;
char auth[30];
}a[1010];
void main(){
int n,i,j,maxnum=0,max;
int zuozhe[26]={0};
char out;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d %s",&a[i].num,a[i].auth);
for(j=0;j<=strlen(a[i].auth)-1;j++)
zuozhe[a[i].auth[j]-'A']=zuozhe[a[i].auth[j]-'A']+1;
}
for(i=1;i... | 2 |
851 | 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;
}
}
... | 2 |
852 | int n;
struct student
{
int num;
char name[100];
struct student *next;
};
struct student *creat(void)
{
struct student *head;
struct student *p1,*p2;
int i;
p1=(struct student*)malloc(LEN);
scanf("%d",&p1->num);
scanf("%s",p1->name);
p1->next=NULL;
head=p1;
p2=p1;
for(i=1;i<n;i++)
{
... | 2 |
853 | int main()
{struct book
{int m;
char au[26];}b[999];
int m,n[26],M=0,i,j;
scanf("%d",&m);
for(i=0;i<26;i++)
n[i]=0;
for(i=0;i<m;i++)
scanf("%d %s",&b[i].m,b[i].au);
for(i=0;i<m;i++)
for(j=0;b[i].au[j]!='\0';j++)
n[b[i].au[j]-65]++;
for(i=1;i<26;i++)
if(n[M]<n[i]) M=i;
printf("%c\n%d",M+65,n[M]);
for(i=0... | 2 |
854 | struct jisuan{
int num;
char name[26];
}book[1000];
int main()
{
int i,j,m,n,k,e;
int count[26]={0},author[26];
scanf("%d",&m);
for(i=0;i<26;i++)
author[i]=65+i;
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++){
... | 2 |
855 |
struct student
{
int num;
char zz[20];
struct student *next;
};
struct student *New(int n)
{
struct student *head=NULL;
struct student *newp, *thisp;
int i=0;
do
{
newp=(struct student*)malloc(sizeof(struct student));
if (newp==NULL)
{
printf("request failed\n");
exit(-1);
... | 2 |
856 | 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]);
... | 2 |
857 | int main()
{
int m,i,j,k,q=0,t=0,u,max;
int b[26]={0};
char c[]="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
struct as{
int sh;
char a[26];
}cla[1000];
scanf("%d",&m);
for(i=0;i<m;i++){
scanf("%d %s",&cla[i].sh,cla[i].a);
t=(int)strlen(cla[i].a);
for(k=0;k<t;k++){
u=cla[i].a[k]-'A';
... | 2 |
858 | struct book
{
int num;
char name[20];
};
void main()
{
struct book c[1000];
int i,j,n,k,max,l,d[26],a;
int b[26]={0};
scanf("%d",&n);
for(k=0;k<n;k++)
{
scanf("%d %s",&c[k].num,c[k].name);
for(i=0;i<strlen(c[k].name);i++)
{
for(j=0;j<26;j++)
{
if('A'+j==c[k].name[i])
break;
... | 2 |
859 |
struct book
{
int number;
char a[26];
int la;
struct book *next;
};
struct book *insert(struct book *head,struct book *temp)
{
struct book *p0,*p1,*p2;
p1=head;
p0=temp;
if(head==NULL)
{head=p0;p0->next=NULL;}
else
{
while(p1->next!=NULL)
{p1=p1->next;}
p1->next=p0;
p0->next=NULL;
}
retu... | 2 |
860 |
int main()
{
int *p;
char q[1000][30];
int shu[26]={0};
char zm[]={'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 n,i,j,k;
int len,max=0;
scanf("%d",&n);
p=(int*)malloc(sizeof(int)*n);
for(i=0;i<n;i++)
{
len=0;
scanf("%d %s", ... | 2 |
861 | struct
{
int num;
char name[27];
}book[999];
struct
{
int cishu;
}ren[26];
int main()
{
int n,zimu,a,b,i,j;
int sz[26];
char m;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d %s",&book[i].num,book[i].name);
}
for(i=0;i<n;i++)
{
for(j=0;book[i].name[j]!='\0';j++)
{
... | 2 |
862 | 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+... | 2 |
863 | struct info
{
int num;
char author[30];
struct info *next;
};
struct info*create(int n)
{
struct info *p1,*p2,*head;
int i;
p1=(struct info*)malloc(sizeof(struct info));
scanf("%d%s",&p1->num,p1->author);
p1->next=NULL;
p2=p1;
head=p1;
i=1;
while(i<n)
{
p1=(struct info*)malloc(sizeof(struct info))... | 2 |
864 |
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];
}input[1000];
scanf("%d", &n);
for(j = 0; j <= 25; j++)
book_number[j] = ... | 2 |
865 | int main()
{
int n,a[999],i,k[27]={0},j,t,m;
char b[999][27];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d %s",&a[i],b[i]);
for(j=0;b[i][j];j++)
k[b[i][j]-65]++;
}
t=k[0];m=0;
for(j=0;j<26;j++)
{
if(k[j]>t) {t=k[j];m=j;}
}
print... | 2 |
866 | int main()
{struct book{
int num;
char s[26];
}b[1000];
struct author{
int n[1000];
int p;
char c;
}a[26],e;
int i,j,k,m,q,max;
char d;
for(i=0;i<26;i++)
a[i].p=0;
for(i=0,d='A';i<26;i++,d++)
{a[i].c=d;}
scanf("%d",&m);
for(i=0;i<m;i++)
{scanf("%d%s",&b[i].num,b[i].s);}
for(i=0;i<m;i++)
{for... | 2 |
867 | struct book
{
int no;
char auth[26];
};
void main()
{
struct book *head,*BK;
int m,n,k,i,j,t,q,p,max;
int a[26]={0};
scanf("%d",&m);
BK=(struct book*)malloc(m*LEN);
head=BK;
for(i=0;i<m;i++)
{
scanf("%d %s",&BK->no,&BK->auth);
n=strlen(BK->auth);
for(j=0;j<n;j++)
{
k=BK->auth[j]-... | 2 |
868 | void main()
{
struct shu
{
int bian;
char name[26];
};
struct shu a[1000];
int n,i,j,l[1000],b[26]={0},most,good,k;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d%s",&a[i].bian,a[i].name);
for(i=0;i<n;i++)
l[i]=strlen(a[i].name);
for(i=0;i<n;i++)
for(j=0;j<l[i];j++)
for(k=0;k<26;... | 2 |
869 | struct book
{
char writer[32];
int id;
struct book *next;
};
struct book *create(int m)
{
struct book *head=NULL,*p1,*p2;
int i;
p1=p2=(struct book*)malloc(Len);
scanf("%d %s",&p1->id,p1->writer);
p1->next=NULL;
head=p1;
p2=p1;
for(i=1;i<m;i++)
... | 2 |
870 | 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... | 2 |
871 | int main()
{
int m;
cin>>m;
int book[1000];
char person[]="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
char people[100][100];
int i,j;
int l;
int t[100]={0};
for(i=1;i<=m;i++)
{
cin>>book[i];
cin>>people[i];
l=strlen(people[i]);
for(j=0;j<l;j++)
{
t[people[i][j]-'A']++;
}
}
int ma... | 2 |
872 |
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->... | 2 |
873 | struct Au{
int num;
int a[1000];
} au[26];
int main ()
{
int i, n, buch, tn;
char s[30];
for(i=0; i<26; i++)
au[i].num=0;
scanf("%d", &n);
while(n--) {
scanf("%d%s", &buch, s);
for (i=0; s[i]; i++) {
tn=au[s[i]-'A'].num;
au[s[i]-'A'].a[tn]=buch;
au[s[i]-'A'].num++;
}
}
int t... | 2 |
874 | struct zuozhe
{
int m;
char q;
char shu[1001][5];
}zuozhe[26],t;
int main()
{
int n;
cin>>n;
int i;
char xingming[30];
char bianhao[5];
char zimu[27]="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
for(i=... | 2 |
875 |
struct student{
char name[27];
int anum;
int num;
struct student *next;
};
int n;
int i;
char c;
struct student *creat()
{
struct student *head;
head=(struct student *)malloc(LEN);
if(n==0)
head=NULL;
else
{
scanf("%d",&head->num);
for(i=0;(c=getchar())!='\n';i++)
{
head->nam... | 2 |
876 | int main(int argc, char* argv[])
{
int N;
int a[26]={0};
struct book{
int x;
char y[27];
}A[1000];
scanf("%d",&N);
int i,j;
for(i=0;i<N;i++)
{
scanf("%d%s",&A[i].x,A[i].y);
for(j=0;A[i].y[j]!='\0';j++)
{
if(A[i].y[j]=='A')
{
a[0]++;
}
else if(A[i].y[j]=='B')... | 2 |
877 |
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 ++)
{... | 2 |
878 | int ismax(int l[],int a)
{
int i;
for(i=0;i<26;i++)
{
if(l[i]>l[a]) return(0);
}
return(1);
}
void main()
{
int i,j,k,n,p,l[26]={0};
struct shu
{
int num;
char auth[100];
} book[999];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d %s",&book[i].num,book[i].auth);
}
for(i=0;i<2... | 2 |
879 |
char name;
int num,k=0,t=0;
int nametimes[100]={0};
struct book
{
unsigned int No;
char Name[26];
}*p;
void operate()
{
int i;
for(i=65;i<91;i++)
if(nametimes[i]>t)
{
t=nametimes[i];
name=i;
}
}
void print()
{
struct book *pi;
int i;
printf("%c\n%d\n",name,t);
for(pi=p;pi<p+... | 2 |
880 | struct book
{
int num;
char writer[30];
struct book *next;
};
int n;
struct book *creat(void)
{
struct book *head;
struct book *p1,*p2;
int m=0;
p1=p2=(struct book*)malloc(len);
scanf("%d %s",&p1->num,p1->writer);
head=NULL;
while(m<n-1)
{
m++;
if(m==1) head=p1;
else p2->next=p1;
... | 2 |
881 | int main()
{
int num[27] = {0},no[27][1000]={0};
char s[27],ls;
int l,i,max,t,j,flag,n,w;
cin >> t;
for (i = 1;i <= t;i++)
{
cin >> n >> s;
l = strlen (s);
for (j = 0;j <= l-1;j++)
{
w = s[j] - 'A' + 1;
num[w] ++;
no[w][num[w]] = n;
}
}
max = 0;
for (i = 1;i <= 26;i++)
i... | 2 |
882 | 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[... | 2 |
883 | 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,... | 2 |
884 |
int main ()
{
int m, i, j, k, n, max, l, y = 0;
struct book
{
int num;
char aut[26];
}book[1000];
int a[26] = {0};
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", &m);
for (i = 0; i < m;... | 2 |
885 | 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... | 2 |
886 | struct author
{
char name;
int count;
}aut[26];
int max(struct author a[26])
{
int i,max;
max=a[0].count;
for(i=0;i<26;i++)
if(a[i].count>max)
max=a[i].count;
return(max);
}
void main()
{
int m,h=0;
scanf("%d",&m);
int i,j,n,l[1000],book_name[1... | 2 |
887 | struct student
{
int num;
char name[20];
struct student* next;
};
struct student*creat(int n)
{
struct student*p1,*p2,*head;
int i;
p1=p2=(struct student*)malloc(len);
head=NULL;
i=0;
while(i<n)
{
scanf("%d %s",&p1->num, p1->name);
i=i+1;
if(i==1) head=p1;
else p2->next=p... | 2 |
888 | int main()
{char ma='A';
int cnt[128]={0};
int i,j,n;
struct s
{int id;
char au[27];
}bk[1000];
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]!='\0';j++)
{cnt[bk[i].au[j]]++;
if(cnt[bk[i].au[j]]>cnt[ma]){ma=bk[i].au[j];}
}
}
printf("%c\n%d\n",ma,cnt[ma]);
fo... | 2 |
889 | struct x{
int num;
char author[26];
int amount;
};
void main(){
struct x y[999];
int i,j,m,max=0,max_=0;
int k;
int amount[91]={0};
scanf("%d",&m);
for(i=0;i<m;i++){
scanf("%d %s",&y[i].num,y[i].author);
y[i].amount=strlen(y[i].author);
}
for(i=0;i<m;i++){
for(j=0;j<y[i].amount;j++){
... | 2 |
890 | struct book
{
int id;
char writer[26];
int length;
}zz[999];
int main()
{
int n,i,j,k;
int letter[26]={0};
int letter_book[26][999]={0};
cin>>n;
for ( i = 0 ; i < n; i ++ )
{
cin>>zz[i].id;
cin>>zz[i].writer;
zz[i].length=strlen(zz[i].writer);
}
for ( j = 0 ; j < n ; j ++ )
{
f... | 2 |
891 | int a[26]={0} ;int n;int max;int hao;
struct chushu
{
int num;
char s[30];
struct chushu *next;
};
struct chushu *create()
{
int j=0,q,i=0,k=0;
struct chushu *head,*p1,*p2;
p1=(struct chushu *)malloc(len);
scanf("%d %s",&p1->num,p1->s);
for (i=0;p1->s[i]!='\0';i++... | 2 |
892 | int a[26][1000];
int ai[26];
void func()
{
int k,i,len;
char str[27];
scanf("%d %s",&k,str);
len=strlen(str);
for(i=0;i<len;i++)
{
a[str[i]-'A'][ai[str[i]-'A']]=k;
ai[str[i]-'A']++;
}
}
int main()
{
memset(a,0,sizeof(a));
memset(ai,0,sizeof(ai));
... | 2 |
893 | struct book
{
int num;
char aut[26];
}b[999];
void main()
{
int i,j,m,n,k,max,p;
int a[26]={0},q[999]={0};
scanf("%d",&m);
for(i=0;i<m;i++)
scanf("%d %s",&b[i].num,b[i].aut);
for(i=0;i<m;i++)
{
n=strlen(b[i].aut);
for(j=0;j<n;j++)
{
k=b[i].aut[j];
a[k-65]++;
}
}
for... | 2 |
894 |
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']... | 2 |
895 |
struct shu
{
int haoma;
char b[26];
struct shu *next;
};
int main()
{
int n,i,a[26],c[26][100],max;
int *s,(*q)[100];
s=a;
q=c;
char m[26];
struct shu *head,*p;
for(i=0;i<26;i++)
a[i]=0;
scanf("%d",&n);
head=(struct shu *)malloc(n*sizeof(shu));
p=head;
for(i=0;i<n-1;i++)
... | 2 |
896 | 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... | 2 |
897 | void main()
{
int t=0,m,i,j,n,k,a[999],c[26]={0};
char b[999][999];
scanf("%d\n",&m);
for(i=0;i<m;i++)
scanf("%d %s",&a[i],b[i]);
for(i=0;i<m;i++)
{
k=strlen(b[i]);
for(j=0;j<k;j++)
c[b[i][j]-'A']++;
}
for(j=0;j<26;j++)
{
if(t<c[j])
t=c[j];
}
for(i=0;i<26;i++)
{
if(c... | 2 |
898 |
int main(int argc, char* argv[])
{
struct book{
int num;
char author[27];
}B[1000];
char A;
int m,i,j,a[26]={0},max;
scanf("%d",&m);
for(i=0;i<m;i++){
scanf("%d%s",&B[i].num,B[i].author);
}
for(i=0;i<m;i++){
for(j=0;;j++){
if(B[i].author[j]==0)
break;
else
a[B[i].author[... | 2 |
899 | 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);//?????
... | 2 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.