山东理工大学ACM平台题目答案

}
struct node * merge(struct node *head1,struct node *head2)
{
struct node *p,*q,*tail;
p=head1->next;
int i;
head1->next=NULL;
tail=head1;
for(i=1;i<=n;i++)
{
p=(struct node*)malloc(sizeof(struct node));
scanf("%d",&p->date);
p->next=NULL;
tail->next=p;
{
int i;
struct node *p,*tail;
head->next=NULL;
tail=head;
for(i=1;i<=m;i++)
{
p=(struct node*)malloc(sizeof(struct node));
scanf("%d",&p->date);
#include<stdio.h>
#include<string.h>
void show(char c,int a,int b)
{
if(c=='+')
printf("%d\n",a+b);
else if(c=='-')
printf("%d\n",a-b);
else if(c=='*')
{
struct node *y;
y=head->next;
while(y!=NULL)
{
if(y->next!=NULL)
printf("%d ",y->date);
if(y->next==NULL)
printf("%d",y->date);
y=y->next;
for(j=0;j<n-i-1;j++)
{
if(a[j]<a[j+1])
{m=a[j];a[j]=a[j+1];a[j+1]=m;}
}
for(i=0;i<k;i++)
{
if(i<k-1)
printf("%d ",a[i]);
else printf("%d\n",a[i]);
while(scanf("%d",&n)!=EOF)
{
m=f(n);
if(m%3==0)
printf("yes\n");
else
printf("no\n");
}
return 0;
}
1608
#include<stdio.h>
#include<stdlib.h>
#include<stdlib.h>
struct node
{
int date;
struct node *next;
};
struct node * creat(int n)
{
struct node *p,*head1,*tail;
head1=(struct node*)malloc(sizeof(struct node));
if(!show(m))
{
while(!show(k))
{
printf("%d*",f(k));
k=k/f(k);
}
printf("%d",k);
}
printf("\n");
}
return 0;
}
2119
#include<stdio.h>
scanf("%d",&k);
printf("%d\n",n);
show(head);
q=head;
while(q!=NULL)
{
q=del(q,k);
++v;
}
printf("%d\n",n-v+1);
shБайду номын сангаасw(head);
return 0;
}
1605
}
printf("\n");
}
int main()
{
int n,v,n1,n2,n3,i;
struct node *head,*q;
scanf("%d",&n1);
for(i=0;i<n1;i++)
{v=0;
head=(struct node*)malloc(sizeof(struct node));
free(q);
free(head);
}
return 0;
}
1138
#include<stdio.h>
#include<stdlib.h>
struct node
{
int date;
struct node *next;
};
struct node *creat(struct node *head,int m)
return 0;
}
1606
#include<stdio.h>
int f(int m)
{
int p;
if(m==0)
p=7;
if(m==1)
p=11;
if(m>1)
p=f(m-1)+f(m-2);
return p;
}
int main()
{
int n,m;
p->next=NULL;
tail->next=p;
tail=p;
}
return head;
}
struct node *del(struct node *head,int z)
{
struct node *q,*p;
int i=0;
p=head;
while(p->next!=NULL)
}
void show(struct node *head)
{
struct node *y;
y=head->next;
while(y!=NULL)
{
if(y->next!=NULL)
printf("%d ",y->date);
if(y->next==NULL)
printf("%d",y->date);
return 0;
return 1;
}
int main()
{
int n,m,i,k;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&m);
k=m;
if(show(m))
printf("%d",m);
end=head2;
for(j=1;j<=m;j++)
{
q=(struct node *)malloc(sizeof(struct node));
scanf("%d",&q->date);
q->next=NULL;
end->next=q;
end=q;
}
return head2;
}
return 0;
}
1607
#include<stdio.h>
#include<stdlib.h>
int main()
{
int n,a,b,i;
int *x;
while(scanf("%d %d %d",&a,&b,&n)!=EOF&&(a||b||n))
{
x=(int *)malloc(n*sizeof(int));
{
if(p->next->date==z)
{
i=1;
break;
}
else p=p->next;
}
if(i==1)
{
q=p->next;
p->next=q->next;
free(q);
return p;
}
else return 0;
tail=p;
}
return head;
}
struct node *del(struct node *head,int z,int r)
{
struct node *q,*p;