#include
#include
using namespace std;
typedef struct node
{
char data;
node *next;
}Node;
int init(Node *&L)
{
L=(Node *)malloc(sizeof(Node));
L->next=NULL;
return 0;
}
int crete(Node *&L,int a[],int n)
{
Node *s,*r;
int i;
L=(Node *)malloc(sizeof(Node));
r=L;
for(i=0;i
{
s=(Node *)malloc(sizeof(Node));
s->data=a[i];
r->next=s;
r=s;
}
r->next=NULL;
return 0;
}
int Link(Node *A,Node *B)
{
Node *p=A;
while(p->next!=NULL)
{
p=p->next;
}
p->next=B->next;
return 0;
}
int print(Node *L)
{
node *q=L->next;
while(q!=NULL)
{
cout<data<<" ";
q=q->next;
}
cout<<endl;
return 0;
}
int main()
{
int a,b,c,i;
Node *ha,*hcc;
int test[50];
int follow[50];
init(ha);
init(hcc);
cin>>a;
for (i=0;i
cin>>test[i];
crete(ha,test,a);
cin>>b;
for(c=0;c
cin>>follow[c];
crete(hcc,follow,b);
Link(ha,hcc);
print(ha);
return 0;
}