#include<iostream>
#include<stdio.h>
using namespace std;
struct node
{
int data;
node* next;
} ;
node * head= NULL ;
node * last;
void insert( int x)
{
node* temp;
temp= new node;
temp- > data= x;
temp- > next= NULL ;
if ( head== NULL ) {
head= temp;
last= temp;
}
else
{
last- > next= temp;
last= 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+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CnN0cnVjdCBub2RlCnsKaW50IGRhdGE7Cm5vZGUqIG5leHQ7Cn07Cm5vZGUgKmhlYWQ9TlVMTDsKbm9kZSAqbGFzdDsKdm9pZCBpbnNlcnQoaW50IHgpCnsKbm9kZSogdGVtcDsKdGVtcD1uZXcgbm9kZTsKdGVtcC0+ZGF0YT14Owp0ZW1wLT5uZXh0PU5VTEw7CgoJaWYoaGVhZD09TlVMTCl7CgkJaGVhZD10ZW1wOwoJCWxhc3Q9dGVtcDsKCX0KCWVsc2UKCXsKCWxhc3QtPm5leHQ9dGVtcDsKCWxhc3Q9dGVtcDsKCX0KfQoKCnZvaWQgcHJpbnQoKQp7Cm5vZGUqIHRlbXA9aGVhZDsKd2hpbGUodGVtcCE9TlVMTCkKewpwcmludGYoIiVkXG4iLHRlbXAtPmRhdGEpOwp0ZW1wPXRlbXAtPm5leHQ7Cn0KfQppbnQgbWFpbigpCnsKaW50IHgsbixpOwpub2RlKiBoZWFkOwpoZWFkPU5VTEw7CnByaW50ZigiZW50ZXIgdGhlIG5vIG9mPVxuIik7CnNjYW5mKCIlZCIsJm4pOwpmb3IoaT0wO2k8bjtpKyspCnsKcHJpbnRmKCJlbnRlciB0aGUgZWxlbWVudHNcbiIpOwpzY2FuZigiJWQiLCZ4KTsKaW5zZXJ0KHgpOwpwcmludCgpOwp9CnJldHVybiAwOwp9Cg==