id int32 0 32.5k | code stringlengths 95 8.4k | label stringclasses 65
values |
|---|---|---|
600 |
struct data{
int code;
char author[20];
};
struct letter{
char let;
int count;
};
int main()
{
int n,i,j,k,t,max;
struct data a[100];
struct letter l[26];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i].code);
gets(a[i].author);
}
for(i=0;i<26;i++)
{
l[i].let=i+65;
... | 2 |
601 | //****************************************
//*??????? **
//*?????? 1100012763 **
//*???2011.11.14 **
//****************************************
int main()
{
int n , number , i , j , k , t , len , max;
int map[26][1000] = {0};
char name[27];
cin >> ... | 2 |
602 | struct person{
int num;
int book[1000];
};
struct person p[26];
int n,m,i,j,k;
char str[30];
int main(){
memset(p,0,sizeof(p));
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d%s",&m,str);
for(j=strlen(str)-1;j>=0;j--)
if(str[j]>='A'&&str[j]<='Z'){
... | 2 |
603 | int w[26]={0};//zimu 0 26
int p=0;
void zimu(char a[]){
int m,i,j;
char c;
m=strlen(a);
for(j=0;j<26;j++){
c='A'+j;
for(i=0;i<m;i++){
if(a[i]==c)
w[j]++;
}
}//for1 end
}
int max(int w[26]){
int i,max;
max=w[0];
for(i=1;i<26;i++)
if(w[i]>max){
max=w[i];
p=i;
}
... | 2 |
604 | 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);
... | 2 |
605 |
void function(int,int);
int main()
{
char s[200][100];
int n[100],h[100],maxh[100];
int a;
int i,j,k,p;
int num,maxnum=0;
char c;
scanf("%d",&a);
for(i=0;i<a;i++)
{
scanf("%d%s",&n[i],s[i]);
}
for(j='A';j<='Z';j++)
{
num=0;
for(i=0;i<a;i++... | 2 |
606 | void main()
{
struct book{
int num;
char str[30];
}bk[1000]={0};
int i,j,m,n,sum[100]={0},number[1000]={0},result,max=0;
char temp='A';
scanf("%d",&m);
for(i=0;i<m;i++)
scanf("%d %s",&bk[i].num,&bk[i].str);
for(i=65;i<=90;i++){
for(j=0;j<m;j++){
for(n=0;n<26;n++)
if(bk[j].str[n]==i)
... | 2 |
607 | 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].n... | 2 |
608 | void main()
{
int n,i,j,no[1000],shu[26]={0},max=0;
char s[1000][20],c;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d%s",&no[i],s[i]);
for(j=0;j<strlen(s[i]);j++)
{
shu[s[i][j]-'A']++;
}
}
for(i=0;i<26;i++)
{
if(shu[i]>max)
{
max=shu[i];
c='A'+i;
}
}
printf("%c\n%d\n... | 2 |
609 | struct info
{
int nam;
char aut[27];
}inf[1000];
void main()
{
int n,i,a[26]={0},k,max=0,sum=0;
char *p;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d%s",&inf[i].nam,inf[i].aut);
for(i=0;i<n;i++)
{
p=inf[i].aut;
while(*p!='\0')
{
a[*p-65]++;
p++;
}
}
for(i=0;i<26;i++)
max=... | 2 |
610 | struct books
{char num[20];
char w[26];};
int main()
{int k,j,i,m;
int b[150]={0};
scanf("%d",&m);
struct books a[1000];
for(i=0;i<m;i++)
{scanf("%s %s",a[i].num,a[i].w);
for(j=0;a[i].w[j]!='\0';j++)
b[a[i].w[j]]++;
}
int max=0;
for(i='A',j=0;i<='Z';i++)
if (max<b[i]) {max=b[i];j=i;}
printf("%c\n"... | 2 |
611 |
struct student
{int num;
char s[26];
}stu[999];
int main()
{ int m,a[26]={0},i,j,max,k,l=0;
scanf("%d",&m);
for(i=0;i<m;i++)
scanf("%d%s",&stu[i].num,stu[i].s);
for(i=0;i<26;i++)
for(k=0;k<m;k++)
for(j=0;j<strlen(stu[k].s);j++)
if(stu[k].s[j]=='A'+i)
a[i]++;
... | 2 |
612 | void main()
{
struct book
{
int bianhao;
char zuozhe[100];
}a[1000];
int i,j,n,l,max;
int b[26]={0};
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d %s",&a[i].bianhao,a[i].zuozhe);
for(i=0;i<n;i++)
for(j=0;a[i].zuozhe[j]!='\0';j++)
b[a[i].zuozhe[j]-65]++;
max=b[0];
l=0;
for(i=1;i<=25;i... | 2 |
613 | struct shu
{
int num;
char a[26];
struct shu*next;
};
int main()
{
char ma='A';
struct shu *p1,*p2;
struct shu*head,*p;
int cnt[128]={0};
int i,j,n,m;
scanf("%d",&n);
p1=p2=(struct shu*)malloc(l);
scanf("%d%s",&p1->num,p1->a);
m=strlen(p1->a);
for(j=0;j<m;j++){
if(++cnt[p1->a[j]]>cnt[ma... | 2 |
614 | struct student
{
int num;
char str[27];
struct student *next;
};
int n;
struct student *creat(int m)
{
struct student *head;
struct student *p1,*p2;
p1=p2=(struct student*)malloc(LEN);
scanf("%ld %s",&p1->num,p1->str);
n=1;
head=0;
while(n<m)
{
if(n==1)head=p1;
else p2->next=p1;
p... | 2 |
615 | int main()
{
int m,i,j,a[1000],c[91]={0},k,n,p=0;
char b[1000][26],q;
scanf("%d", &m);
for(i=1;i<=m;i++)
{
scanf("%d%s", &a[i], b[i]);
n=strlen(b[i]);
for(j=0;j<=n-1;j++)
{
... | 2 |
616 | struct a
{
int num;
char s[20];
struct a *next;
}
main()
{
int n,i,a[26],b[26]={0},t,j,max;
struct a *p1,*p2,*head;
scanf("%d",&n);
head=p1=(struct a *)malloc(L);
scanf(M,&p1->num,p1->s);
for(i=1;i<n;i++)
{
p2=p1;
p1=(struct a *)malloc(L);
p2->next=p1;
scanf(M,&p1->num,p1->s);
}
... | 2 |
617 | 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... | 2 |
618 |
int main()
{
int bkn,m=1,n,i,j;
char bka[30];
struct author
{
int num;
int p[200];
}
a[30];
scanf("%d",&n);
for(i=1;i<27;i++)
a[i].num=0;
for(i=0;i<n;i++)
{
scanf("%d%s",&bkn,bka);
for(j=0;j<strlen(bka);j++)
{
a[bka[j]-64].num++;
a[bka[j]-64].p[a[bka[j]-64].num-1]=bkn;... | 2 |
619 | void main()
{
int a[1000],i,j,m,b[26],t=0,k;
char c[1000][20];
scanf("%d",&m);
for(i=0;i<m;i++)
scanf("%d %s",&a[i],c[i]);
for(i=0;i<m;i++)
for(j=0;j<strlen(c[i]);j++)
if('A'<c[i][j]<'Z') b[c[i][j]-65]++;
for(i=0;i<26;i++)
if(b[i]>t){t=b[i];k=i;}
printf("%c\n",k+65);
printf("%d\n... | 2 |
620 | struct book
{
int num;
char author[27];
}book[1000];
void main()
{
int m,i,j,k;
char s[26];
int w[26]={0};
int len[1000];
int max,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++)
{
s[i]='A'+i;
}
for(i=0;i<m;i++)
{
len... | 2 |
621 | struct book
{
int num;
char author[26];
};
int main()
{
int n;
scanf("%d\n",&n);
int i;
struct book book[1000];
for(i=0;i<n;i++)
{
scanf("%d %s",&book[i].num,book[i].author);
}
int b[26]={0};
for(i=0;i<n;i++)
{
int l;
l=strlen(book[i].author);
int j;
for(j=0;j<l;j++)
{
... | 2 |
622 | struct book
{
int id;
char s[26];
}a[100];
int main()
{
int m,i,n,j,k,max,maxnum;
int aut1[26]={0},aut2[26][100]={0};
scanf("%d",&m);
for(i=0;i<m;i++)
{
scanf("%d",&a[i].id);
gets(a[i].s);
n=strlen(a[i].s);
for(j=0;j<n;j++)
{
k=a[i].s[j]-'A';
aut2[k][aut1[k]]=a[i].id;
... | 2 |
623 | int n;
struct book
{
int num;
char name[20];
struct book *next;
}*p1,*p2;
//????
struct book *creat(void)
{
struct book *head;
int i;
head=0;
p1=0;
p2=0;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
p1=(struct book *)malloc(LEN);
scanf("%d %s",&p1->num,p1->name);
if(head==0)
head=p1;
... | 2 |
624 |
struct book
{ int num;
char peo[26];
} book[999];
int main()
{ char zm,max;
int n,i,k,num,cishu=-1;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d %s",&book[i].num,&book[i].peo);
}
for(zm='A';zm<='Z';zm++){
num=0;
for(i=0;i<n;i++){
for(k=0;k<26;k++){... | 2 |
625 | int main()
{
int number[1001],num[27]={0},ascii[27];
char a[1001][27],p;
int i,j,m,n,t1,t;
cin>>m;
n=26;
for(i=0;i<m;i++)
{
cin>>number[i];
cin>>a[i];
for(j=0;j<strlen(a[i]);j++)
{
num[a[i][j]-'A']++;
}
}
for(i=0;i<n;i++)
{
ascii[i]=i;
}
for(i=0;i<n;i++)
{
for(j=n-1;j... | 2 |
626 | struct j
{
int bianhao;
char zuozhe[100];
};
main()
{
int m,i,l,k,z,max=0;
int shumu[26];
scanf("%d",&m);
struct j * a;
a=(struct j *)malloc(m*sizeof(j));
for(i=0;i<m;i++)
{
scanf("%d %s",&a[i].bianhao,a[i].zuozhe);
}
for(z=0;z<26;z++)
{
shumu[z]=0;
for(i=0;i<m;i++)
{
char * p;
... | 2 |
627 | 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 = ... | 2 |
628 | int main()
{
int n,i,j,k;
scanf("%d\n",&n);
struct book
{
int num;
char name[26];
}book[999];
for(i=0;i<n;i++)
{ scanf("%d %s\n",&book[i].num,book[i].name);
}
struct author
{
char l;
int count;
}au[26];
for(i=0;i<26;i++)
... | 2 |
629 | struct book
{
int num;
char wr[26];
struct book *next;
};
void main()
{
int i,n,m=0,j,a,b,c;
int s[100]={0};
scanf("%d",&n);
struct book *head,*p1,*p2,*p;
p1=p2=(struct book *)malloc(LEN);
scanf("%d %s",&p1->num,p1->wr);
head=NULL;
while(m!=n-1)
{
m=m+1;
if(m==1) head=p1;
else p2->n... | 2 |
630 | int main()
{
int n;
int i,j,k;
int max,max2;
int a[26];
struct book
{
int number;
char author[26];
}stu1[1000];
struct author
{
int number[1000];
int ben;
}stu2[26];
scanf("%d",&n);
for(i=0;i<=n-1;i+... | 2 |
631 | struct book
{
int num;
char writer[20];
struct book *next;
};
int main()
{
int n,i,j,m,k,c[26],max;//c[26]???????????//
char a[26];//a[26]??????//
scanf("%d",&m);
struct book *p1,*p2,*head;
for(i=0;i<m;i++)
{
p1=(struct book*)malloc(Len);
if(i==0)
{
head=p1;
}
else
{
p2->... | 2 |
632 | struct stu
{
int num;
char c[26];
struct stu*next;
};
struct stu*create(void)
{
struct stu *p1,*p2,*head;
int m;
scanf("%d",&m);
p1=(struct stu*)malloc(LEN);
scanf("%d %s",&p1->num,p1->c);
p2=p1;
head=p1;
while(m-1)
{
m--;
p1=(struct stu*)malloc(LEN);
scanf("%d %s",&p1->num,p... | 2 |
633 | main()
{
int i,j,m,a[26]={0},max=0;
struct book
{
int no;
char w[26];
}
s[1000];
scanf("%d",&m);
for (i=0;i<m;i++)
{
scanf("%d %s",&s[i].no,s[i].w);
for (j=0;j<strlen(s[i].w);j++)
a[s[i].w[j]-'A']++;
}
for (i=0;i<26;i++)
if (a[i]>a[max])
max=i;
printf("%c\n%d\n",max+'A... | 2 |
634 | int main()
{
int m,i,a[1000]={0},count[30]={0},temp,j,max=-999,flag;
char s[1000][30]={0},cha;
scanf("%d", &m);
for(i=1;i<=m;i++)
{
scanf("%d", &a[i]);
for(j=1;j<30;j++)
{
scanf("%c", &s[i][j]);
if(s[i][j]==' ')
{
s[i][j]=0;
continue;
}
if(s[i][j]=='\n')
{
s[i... | 2 |
635 | 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++)
{
... | 2 |
636 | int main()
{
int m,a[1000],i,n,j,k;
scanf("%d",&m);
char b[1000][27];
int count[26]={0};
for(i=0;i<m;i++)
{
scanf("%d %s",&a[i],b[i]);
}
for(i=0;i<m;i++)
{
n=strlen(b[i]);
for(j=0;j<n;j++)
{
for(k=0;k<26;k++)
{
if(b[i][j]==k+65)count[k]++;
}
}
}
int max,maxk;
max... | 2 |
637 |
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])
... | 2 |
638 | struct cs
{
int b;
char a[26];
};
int main()
{
int m,i,j,k,max=0;
int c[200][1000],count[200]={0};
struct cs x[1000];
scanf("%d",&m);
for(i=0;i<m;i++)
{
scanf("%d",&x[i].b);
gets(x[i].a);
}
for(i=0;i<m;i++)
{
for(j=0;j<strlen(x[i].a);j++)
{
for(k=65;k<91;k++)
{
if(x[i]... | 2 |
639 |
struct book{
int num;
char s[27];
};
struct author{
int num;
int bn[1000];
};
int main()
{
int m,i,j,l,max=0;
char c;
struct book bk[1000];
struct author au['Z'+1],t;
scanf("%d",&m);
for(j=0;j<'Z'+1;j++)
au[j].num=0;
for(i=0;i<m;i++)
{
scanf("%d %s",&bk[i].num,bk[i].s... | 2 |
640 | struct people
{
int a;
char name[26];
};
void main()
{
struct people pl[1000];
int i,j,k,l=0,n,s,m,max,x[26];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d %s",&pl[i].a,pl[i].name);
}
for(i=0;i<n;i++)
{
m=strlen(pl[i].name);
for(j=0;j<m;j++)
for(k=0;k<26;k++)
if(k==pl[i].name[... | 2 |
641 | void main()
{
struct s
{
int a;
char b[100];
struct s *next;
};
struct s *p1,*p2,*head;
int m,n,i,j,k,t,d[50],max;
char c;
scanf("%d",&n);
p1=(struct s *)malloc(sizeof(struct s));
p2=p1;
head=p1;
scanf("%d %s",&p1->a,p1->b);
for(i=0;i<n-1;i++)
{
p1=(struct s *)malloc(sizeof(struct... | 2 |
642 | 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 |
643 | struct book
{ char name[20];
int num;
struct book *next;
};
struct book *creat(int m)
{
int i;
struct book *head,*p1,*p2;
p1=(struct book *)malloc(len);
scanf("%d",&p1->num);
scanf("%s",p1->name);
p1->next=null;
head=p1;
p2=p1;
for(i=1;i<m;i++)
{
p1=(struct b... | 2 |
644 | struct a{
int n;
char s[27];
}b[1000];
int main()
{
int n;
scanf("%d",&n);
int i,k;
for(i=0;i<n;i++)
{
scanf("%d %s",&b[i].n,b[i].s);
}
int c[26]={0};
for(i=0;i<n;i++)
{
for(k=0;b[i].s[k];k++)
{switch(b[i].s[k]){
case 'A':c[0]++;break;
case 'B':c[1]++;break;
case 'C':c[2]++;brea... | 2 |
645 | void main()
{
int n,i,c[26]={0},d[26]={0},j,s,t,k;
char b[26000],r,max;
scanf("%d\n",&n);
struct book
{
int num;
char author[26];
}a[999];
for(i=0;i<n;i++) scanf("%d %s\n",&a[i].num,&a[i].author);
strcpy(b,a[0].author);
for(i=1;i<n;i++) strcat(b,a[i].author);
s=strlen(b);
for(r='A',j=0;r... | 2 |
646 | struct book
{
int num;
char aut[26];
}bo[999];
main()
{
int n,i,j,k,count[26],max;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d %s",&bo[i].num,&bo[i].aut);
}
for(i=0;i<26;i++)
count[i]=0;
for(i=0;i<n;i++)
{
for(j=0;j<26;j++)
{
if(bo[i].aut[j]-65>=0&&bo[i]... | 2 |
647 | 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]==... | 2 |
648 |
main(){
int i, sum[26]={0}, m, j, max=0, p;
struct book{
int num;
char au[27];
int l;
};
struct book bk[1000];
scanf("%d", &m);
for(i=0; i<m; i++){
scanf("%d %s", &bk[i].num, bk[i].au);
bk[i].l=strlen(bk[i].au);
for(j=0; j<bk[i].l; j++){
switch(bk[i].au[j]){
case 'A': sum[0]+=1; ... | 2 |
649 |
int main()
{
int m;
char a[1000][10]={0}; //????
char b[1000][30]; //????
int len[1000]={0}; //?????????
int c[150]={0}; //???????
int max=0; //??????????????
int i,j,k,p,q,r,s; //????
scanf("%d", &m);
for(i=0;i<m;i++)
{
scanf("%s %s", a[i], b[i]);
len[i]=strlen(b[i]);
//pri... | 2 |
650 | int main(int argc, char* argv[])
{
int m,i,j=0,zhe[26],t=0,x,name;
for(i=0;i<26;i++)
{
zhe[i]=0;
}
char s[26];
scanf("%d",&m);
struct
{
int num;
char s[26];
}shu[1000];
for(i=0;i<m;i++)
{
scanf("%d%s",&shu[i].num,shu[i].s);
}
for(i=0;i<m;i++)
{
for(j=0;shu[i].s[j]!=0;j++)
{... | 2 |
651 | struct student
{
char number[100];
char name[100];
struct student*next;
};
int n;
struct student*creat(void)
{
struct student *head;
struct student *p1,*p2;
int i=0;
p1=p2=(struct student*)malloc(LEN);
scanf("%s %s",&p1->number,&p1->name);
head=NULL;
do
{
i=i+1;
if(i==1)head=p1;else ... | 2 |
652 | //????
int main()
{
int a,s[26][1000],m,i,j,author,max=0;//a????
char b[1000][28];//???
for (i=0;i<26;i++)
s[i][0]=0;
cin>>m;
for (i=0;i<m;i++)
{
cin>>a;
cin>>b[a];
for (j=0;b[a][j]!='\0';j++)
{
s[b[a][j]-'A'][0]++;//??????+1
s[b[a][j]-'A'][s[b[a][j]-'A'][0]]=a;//??????
}
}
f... | 2 |
653 | struct book
{
char id[11];
char name[30];
};
struct au
{
int num;
char id[1000][11];
};
void main()
{
struct book b;
struct au a[26];
int n,i,j=0,k;
char c;
for(i=0;i<26;i++)
a[i].num=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%s",b.id,b.name);
while(b.name[j]!='\0')
{... | 2 |
654 |
struct book
{
int number;
char auther[27];
}bk[1000];
struct ath
{
char a;
int books[999];
int sum;
}auth[27],temp;
void main()
{
int n,i,x,m,j;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d%s",&bk[i].number,bk[i].auther);
for(i=0;i<27;i++)
{
for(j=0;j<999;j++)
auth[i].books[j]=0... | 2 |
655 | int main()
{
int b[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};
int m,i,j,k,num[10000],max=0,t=0;
char a[10000][26];
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'};
scanf("%d",&m);
for(i=0;i<m;i++)
{
scanf("%d",&num[i]... | 2 |
656 | struct book
{
int ID;
char author[30];
struct book *next;
};
int n,max=0;
char c;
struct book *create()
{
struct book *head,*p1,*p2;
p1=(struct book*)malloc(LEN);
scanf("%d %s",&p1->ID,p1->author);
head=p1;
p2=p1;
p1->next=NULL;
int i=1;
do
{
if(i==n)break;
p1=(struct boo... | 2 |
657 | int main ()
{
int m;
scanf ("%d",&m);
int a[1000];
char s[1000][26];
int i,j;
for (i=0;i<m;i++)
{
scanf ("%d %s",&a[i],s[i]);
}
char x;
int max=0;
char maxx;int l;
for (x='A';x<='Z';x++)
{
l=0;
for (i=0;i<m;i++)
{
for (j=0;j<26;j++)
{
if (s[i][j]==x)br... | 2 |
658 | int a[30]={0},b[30][1000];
struct stu
{
int num;
char name[30];
struct stu *next;
};
struct stu *creat(int n)
{
struct stu *p1,*p2,*head;
int i=0;
p1=p2=(struct stu *)malloc(sizeof(struct stu));
scanf("%d %s",&p1->num,p1->name);
head=0;
for(i=0;i<n;i++)
{
if(i==0)
head=p1;
else
... | 2 |
659 | int main()
{
int n,amount[26],num[26][1000],num0,max=0;
char a;
memset(amount,0,sizeof(amount));
cin>>n;
for(int i=0;i<n;i++)
{
cin>>num0;
cin.get();
a=cin.get();
while(a!='\n')
{
num[a-65][amount[a-65]]=num0;
amount[a-65]++;
a=cin.get();
}
}
for(int i=0;i<26;i++)
if(ma... | 2 |
660 |
int main()
{
char author[27];
int i,j,n,no,ab[26][1000]={0},an[26]={0},ma=0,na,am;
cin>>n;
for(;n>0;n--){
cin>>no>>author;
for(i=0;i<27;i++)
if(author[i]!='\0')ab[author[i]-'A'][an[author[i]-'A']]=no,an[author[i]-'A']++;
else break;}
for(i=0;i<26;i++)
{
na=0;
for(j=0;j<999;j++)
if... | 2 |
661 | struct data
{
int no;
char au[10];
};
void main()
{
struct data lib[1000];
char x;
int n,i,j,num[26]={0},l[1000],k,max;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&lib[i].no);
scanf("%s",lib[i].au);
l[i]=strlen(lib[i].au);
}
for(i=0;i<n;i++)
{
for(j=0;j<l[i];j++)
{
num[li... | 2 |
662 | struct b
{
int na;
char au[20];
}book[1000];
int main()
{
int m,i,len[1000],num[128]={0},j,max,p=0;
char maxi;
int boo[1000];
scanf("%d",&m);
for(i=0;i<m;i++)
{
scanf("%d%s",&book[i].na,book[i].au);
len[i]=strlen(book[i].au);
for(j=0;j<len[i];j++)
num[book[i].au[j]]++;
}
maxi='A';
... | 2 |
663 | struct sa
{
int a;
char b[100];
struct sa *next;
};
int n,m,k[27];
struct sa *kao(void)
{
struct sa *head;
struct sa *p1,*p2;
n=0;
head=NULL;
p1=p2=(struct sa *)malloc(len);
scanf("%d %s",&p1->a,p1->b);
head=p1;
for(;;)
{
n++;
if(n==m+1)
break;
if(n==1)
h... | 2 |
664 |
main()
{
struct book
{
int num;
char name[26];
}b[1000];
int m,i,j,n[26]={0},max=0,t;
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++)
{ ++n[b[i].name[j]-65];
}
}
for(i=0... | 2 |
665 |
struct author{
char num[4];
char str[27];
};
int main(int argc, char* argv[])
{
int m,i,j,zimu[26]={0},x,max;
char p;
scanf("%d",&m);
struct author *auth=(struct author *)malloc(sizeof(struct author)*m);
for(i=0;i<m;i++){
scanf("%s %s",auth[i].num,auth[i].str);
}
for(i=0;i<m;i++){
for(j=0... | 2 |
666 | struct index
{
int num;
char wr[26];
};
int main()
{
int n,a[26],*pr,max;
char s[26],*sp,*pt,temp;
for(pr=a;pr<a+26;pr++)
{
*pr=0;
}
sp=s;
*sp=65;
for(sp=s+1;sp<s+26;sp++)
{
*sp=*(sp-1)+1;
}
struct index *p;
scanf("%d",&n);
struct index *ind=(struct index*)malloc(sizeof(struct in... | 2 |
667 | int main()
{
int n,i,j,k,t=0,c=0;
int A[25];
char g[]="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
struct point{
int a;
char s[80];
}tope[1000];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d %s",&tope[i].a,tope[i].s);
}
for(k=0;k<26;k++)
{
... | 2 |
668 | 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 |
669 | struct author
{ int num;
char name[26];
};
struct author ren[100];
int main()
{ int n,i,j=0,k=0,biao,maxzuozhe,p,geshu[26]={0},max=0,maxdeshu[999];
scanf("%d\n",&n);
for(i=0;i<=n-1;i++)
{ scanf("%d",&ren[i].num);
scanf("%s",ren[i].name);
}
for(i=0;i<=25;i++)
... | 2 |
670 | 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<2... | 2 |
671 | struct stu{
int id;
char author[26];
int length;
}a[1000];
int main(){
int n,i,k,num=0,max=0;
char b,c;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d%s",&a[i].id,a[i].author);
a[i].length=strlen(a[i].author);
}
for(b='A';b<='Z';b++){
num=0;
for(i=0;i<n;i++){
for(k=0;k<a[i].length;k++... | 2 |
672 | //********************************
//*???? ??(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 - ... | 2 |
673 | struct SHU
{
int bh;
char bz[26];
};
int main()
{
int m,i,j,l,k,p;
int name[200]={0},max,shuhao[1000];
struct SHU shu[1000];
scanf("%d",&m);
for(i=0;i<m;i++)
{
scanf("%d %s",&shu[i].bh,shu[i].bz);
}
for(i=0;i<m;i++)
{
l=strlen(shu[i].bz);
for(j=0;j<l;j++)
{
name[shu[i].bz[j]]... | 2 |
674 | int main(){
struct book{
int num;
char name[26];
};
int n,i,j,a[26]={0},len[1000],k,max=0;
struct book list[1000];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&list[i].num);
scanf("%s",list[i].name);
len[i]=strlen(list[i].name);
}
for... | 2 |
675 | int main()
{
int m,i,j,x,maxnumber;
scanf("%d",&m);
int booknum[1000];
char k[1000][30];
int author[27]={0};
for(i=1;i<=m;i++)
{
scanf("%d %s",&booknum[i],k[i]);
for(j=0;k[i][j]!='\0';j++)
{
author[k[i][j]-'A'+1]++;
}
}
int max=0;
for(i=1;i<=26;i++)
... | 2 |
676 | 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']++;
}
}
... | 2 |
677 | struct information
{
int num;
char author[26];
}*a;
void main()
{
int n,i,j,m,s[26]={0},max=0,p;
scanf("%d",&n);
a=(struct information *)malloc(sizeof(struct information)*n);
for(i=0;i<n;i++) scanf("%d%s",&a[i].num,a[i].author);
for(i=0;i<n;i++)
{
for(j=0;a[i].author[j]!='\0';j++)
{
m=a[i]... | 2 |
678 | int main()
{
int n,i,j,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(j=0;k[i][j]!='\0';j++)
{
author[k[i][j]-'A'+1]++;
}
}
int max=0;
fo... | 2 |
679 |
struct
{
int a;
char b[26];
}shu[1000];
int main()
{
int s[27];
int n,i,j,o,max,t=1,x;
scanf("%d",&n);
for (i=0;i<n;i++)
scanf("%d %s",&shu[i].a,shu[i].b);
for (i=1;i<=26;i++)
s[i]=0;
for (i=0;i<n;i++)
for (j=0;j<strlen(shu[i].b);j++)
{
o=shu[i].b[j]-64;
s[o]++;
}
... | 2 |
680 | struct book
{
long int num;
char name[26];
}book[1000];
int main()
{
int m,i,j,r;
int writer[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};
scanf("%d",&m);
for(i=0;i<m;i++)
{
scanf("%ld ",&book[i].num);
scanf("%s",book[i].name);
}
for(i=0;i<m;i++)
{
r=strlen(boo... | 2 |
681 | void main()
{
int m,n,i,j,k,d,s;
int a,b=0,c;
int tt[1000],pp[1000],miao[26]={0};
char kk[1000][30];
char w;
scanf("%d",&m);
for(i=0;i<m;i++)
{
scanf("%d %s",&tt[i],kk[i]);
}
for(s=0,j=65;j<=90;j++,s++)
{
for(k=0;k<m;k++)
{
for(d=0;kk[k][d]!='\0';d++)
... | 2 |
682 | int main()
{
int k;
cin>>k;
int book;
char writer[26];
int counter[26]={0};
int bookbelong[26][999]={0};
int everynum[26]={0};
int t=0;
while(k--)
{
cin>>book>>writer;
int str=strlen(writer);
for(int i=0;i<str;i++)
{
int flag=writer[i]-'A';
counter[flag]++;
bookb... | 2 |
683 | 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;... | 2 |
684 |
int main()
{
int bookno[100];
char author[100][26];
int numOfauthor[26] = {0};
int nbook, max = 0, maxno;
char maxauthor;
cin >> nbook;
int i, j;
for ( i = 0; i < nbook; i ++)
{
cin >> bookno[i];
cin.get();
cin.getline(*(author + i), 26);
}
for ( i = 0; i < nbook; i ++)
for ( j =... | 2 |
685 | int main()
{ struct s
{int N;
char w[26];
};
struct s s[999];
int n,i,j,c,a[26];
scanf("%d\n",&n);
for (i=0;i<=(n-1);i++)
{ scanf("%d",&s[i].N);
gets(s[i].w);
}
for (i=0;i<=(n-1);i++)
{ for (j=0;j<=25;j++)
{ c=s[i].w[j];
a[c-65]++;
}
... | 2 |
686 | struct BOOK{
int id;
int author[26];
};
int main(){
struct BOOK book[1000];
int countauthor[26];
int n,i,j,minusA,no,count,max=0,maxau;
char input[30];
scanf("%d",&n);
for(i=0;i<n;i++){
for(j=0;j<26;j++){
book[i].author[j]=0;
}
}// refresh data: each book-->all authors initiate with 0
fo... | 2 |
687 | struct{
int location[1001];
int num;
int sum;
}ans[27];
int main()
{
int n,value=-1,order,m;
char s[28];
cin>>n;
for(int i=1;i<=26;i++)
{
ans[i].num=ans[i].sum=0;
}
for(int i=1;i<=n;i++)
{
cin>>m;
cin>>s;
for(int j=0;j<strlen(s);j++)
{
ans[s[j]-'A'+1].num++;
ans[s[j]-'A'+... | 2 |
688 | main()
{
int n,i,a,t,d[26]={0},f=0,c,h,e=0;
struct book
{
int N;
char name[20];
}p[1000];
scanf("%d",&n);
for(i=0;i<=n-1;i++)
scanf("%d %s",&p[i].N,p[i].name);
for(i=0;i<=n-1;i++)
{
a=strlen(p[i].name);
for(t=0;t<=a-1;t++)
{
c=p[i].name[t]-'A';
d[c]++;
}
}
... | 2 |
689 | //#define NULL 0
struct stu
{
int num;
char c[26];
struct stu *next;
};
struct stu* create(int m)
{
struct stu *p1,*p2,*xhead;
p1=(struct stu *)malloc(LEN);
scanf("%d %s",&p1->num,p1->c);
p2=p1;
xhead=p1;
while(m-1)
{
m--;
p1=(struct stu*)malloc(LEN);
scanf("%d %s",&p1->num,p1->c);... | 2 |
690 | /*
* 1.cpp
*
* Created on: 2013-1-13
* Author: Administrator
*/
int main()
{
int n, i, j, max = 0, maxi = 0;
int a[1100] = {0}, b[30] = {0}, c[30][1100] = {0};
char zz[1100][30];
cin >> n;
for(i = 1; i <= n; i++)
{
cin >> a[i] >> zz[i];
for(j = 0; zz[i][j] != '\0'; j++)
{
b[(i... | 2 |
691 |
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[... | 2 |
692 | struct book
{
int num;
char zz[32];
struct book *next;
};
struct book *creat(int n)
{
struct book *head,*p1,*p2;
int i;
p1=p2=(struct book *)malloc(LEN);
scanf("%d %s",&p1->num,p1->zz);
head=NULL;
for(i=0;i<n-1;i++)
{
if(i==0) head=p1;
else p2->next=p1;
p2=p1;
p1=(struct book *)ma... | 2 |
693 | void main()
{
int m,i,j,temp,max;
char a[1000][10],b[1000][20],w;
int c[26];
scanf("%d",&m);
for(i=0;i<26;i++) c[i]=0;
for(i=0;i<m;i++)
{
scanf("%s %s",a[i],b[i]);
}
for(i=0;i<m;i++)
{
for(j=0;j<strlen(b[i]);j++)
{
if(b[i][j]=='A') c[0]++;
if(b[i][j]=='B') c[1]++;
if(b[... | 2 |
694 | typedef char q[30];
void init(int a[],int f[],q *p[lll],int m)
{
int i;
char e[432];
char *pp;
int r;
for(i=1;i<=m;i++)
{
p[i]=(q *)malloc(sizeof(q));
scanf("%d%s",&f[i],p[i]);
getchar();
pp=*p[i];
while (*pp!='\0')
{a[*pp]++;
pp++;
}
}
}
char pro(int a[])
{
... | 2 |
695 | void main()
{
int a[100],i,l,c[26]={0},k,max,n,j;
char b[100][26],d[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],b[i]);
for(i=0;i<n;i++)
{
l=strlen(b[i]);
for(j=0;j<l;j++)
{
... | 2 |
696 | int alpha[26]={0};
struct library
{
int num;
char authors[27];
}books[999];
void addauthor(char string[])
{
int i=0;
do
{ alpha[string[i]-'A']++;
i++;
}
while(string[i]!='\0');
}
void hewroteit(struct library book,int maxalpha)
{
int i;
for(i=0;book.authors[i]!='\0';i++)
{
if(book.autho... | 2 |
697 | int main()
{
int booknumber;
int order[1000];
char author[1000][27];
char single_author[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 author_booknumber[26]={0};
int i,j,k;
int tmp;
scanf("%d",&booknumber);
for(i=0;i<booknumber... | 2 |
698 | struct book
{
int ID;
char author[30];
struct book *next;
};
int n,max=0;
char c;
int num[26]={0};
struct book *create()
{
struct book *head,*p1,*p2;
p1=(struct book*)malloc(LEN);
scanf("%d %s",&p1->ID,p1->author);
head=p1;
p2=p1;
p1->next=NULL;
int i=1;
do
{
if(i==n)break;
... | 2 |
699 |
struct book
{
int num;
char *name;
struct book *next;
}
main()
{
int n,i;
scanf("%d",&n);
struct book *p1,*p2,*head;
p1=len;
head=p1;
for(i=0;i<n;i++)
{
p1->name=(char *)malloc(26*1);
scanf("%d %s",&p1->num,p1->name);
p2=len;
p1->next=p2;
p1=p2;
}
p1=p2=head;
int *a;
a... | 2 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.