#include<iostream>
#include<stdio.h>
using namespace std;
struct node
{
int data;
node* next;
};
node *head=NULL;
void insert(int x)
{
node* temp;
temp=new node;
temp->data=x;
temp->next=NULL;
if(head==NULL)
head=temp;
else
{
temp->next=head;
head=temp;
}
}
void print()
{
node* temp=head;
while(temp!=NULL)
{
printf("%d\n",temp->data);
temp=temp->next;
}
}
int main()
{
int x,n,i;
node* head;
head=NULL;
printf("enter the no of=\n");
scanf("%d",&n);
for(i=0;i<n;i++)
{
printf("enter the elements\n");
scanf("%d",&x);
insert(x);
print();
}
return 0;
}
I2luY2x1ZGU8aW9zdHJlYW0+CiNpbmNsdWRlPHN0ZGlvLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CnN0cnVjdCBub2RlCnsKCWludCBkYXRhOwogICAgIG5vZGUqIG5leHQ7Cn07Cm5vZGUgKmhlYWQ9TlVMTDsKdm9pZCBpbnNlcnQoaW50IHgpCnsKCW5vZGUqIHRlbXA7CnRlbXA9bmV3IG5vZGU7Cgl0ZW1wLT5kYXRhPXg7Cgl0ZW1wLT5uZXh0PU5VTEw7CglpZihoZWFkPT1OVUxMKQpoZWFkPXRlbXA7CgllbHNlCgl7CgkJdGVtcC0+bmV4dD1oZWFkOwoJCWhlYWQ9dGVtcDsKCX0KCn0Kdm9pZCBwcmludCgpCnsKCW5vZGUqIHRlbXA9aGVhZDsKCQl3aGlsZSh0ZW1wIT1OVUxMKQoJewoJCXByaW50ZigiJWRcbiIsdGVtcC0+ZGF0YSk7CgkJdGVtcD10ZW1wLT5uZXh0OwoJfQp9CmludCBtYWluKCkKewoJaW50IHgsbixpOwoJbm9kZSogaGVhZDsKICBoZWFkPU5VTEw7CnByaW50ZigiZW50ZXIgdGhlIG5vIG9mPVxuIik7CnNjYW5mKCIlZCIsJm4pOwpmb3IoaT0wO2k8bjtpKyspCnsKCXByaW50ZigiZW50ZXIgdGhlIGVsZW1lbnRzXG4iKTsKCXNjYW5mKCIlZCIsJngpOwoJaW5zZXJ0KHgpOwoJcHJpbnQoKTsKfQkKcmV0dXJuIDA7Cn0=