#include<iostream>
#include<stdlib.h>
using namespace std;
struct list{
struct list * next;
int data;
} * head;
int Creat_list( int num)
{
struct list * temp;
struct list * q;
q= head;
temp = new list;
temp- > data= num;
if ( head== NULL ) {
head= temp;
head- > next= NULL ;
}
else
{
while ( q- > next! = NULL )
q= q- > next;
q- > next= temp;
q= temp;
q- > next= NULL ;
}
}
count( )
{
int count= 0 ;
struct list * c1;
c1= head;
while ( c1! = NULL )
{
cout << "->" << c1- > data;
count++ ;
c1= c1- > next;
}
}
cout << "no of nodes %d" << count;
}
int main( ) {
// your code goes here
head= NULL ;
int i, num;
for ( i= 0 ; i< 4 ; i++ )
{
printf ( "Enter number" ) ;
scanf ( "%d" ,& num) ;
Creat_list( num) ;
}
count( ) ;
return 0 ;
}
I2luY2x1ZGU8aW9zdHJlYW0+CiNpbmNsdWRlPHN0ZGxpYi5oPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKc3RydWN0IGxpc3R7CgkJc3RydWN0IGxpc3QgKiBuZXh0OwoJCWludCBkYXRhOwp9KmhlYWQ7CgppbnQgQ3JlYXRfbGlzdChpbnQgbnVtKQp7CglzdHJ1Y3QgbGlzdCAqdGVtcDsKCXN0cnVjdCBsaXN0ICpxOwoJcT1oZWFkOwoJdGVtcCA9IG5ldyBsaXN0OwoJdGVtcC0+ZGF0YT1udW07CglpZihoZWFkPT1OVUxMKXsKCQloZWFkPXRlbXA7CgkJaGVhZC0+bmV4dD1OVUxMOwoJfQoJZWxzZQoJewoJd2hpbGUocS0+bmV4dCE9TlVMTCkKCQoJCXE9cS0+bmV4dDsKCQlxLT5uZXh0PXRlbXA7CgkJcT10ZW1wOwoJCXEtPm5leHQ9TlVMTDsKCX0KCQp9CmNvdW50KCkKewoJaW50IGNvdW50PTA7CglzdHJ1Y3QgbGlzdCAqYzE7CgljMT1oZWFkOwoJd2hpbGUoYzEhPU5VTEwpCgl7CgkJY291dDw8Ii0+Ijw8YzEtPmRhdGE7CgkJCWNvdW50Kys7CgkJCWMxPWMxLT5uZXh0OwoJCX0KCX0KCWNvdXQ8PCJubyBvZiBub2RlcyAlZCI8PGNvdW50Owp9CgppbnQgbWFpbigpIHsKCS8vIHlvdXIgY29kZSBnb2VzIGhlcmUKCSBoZWFkPU5VTEw7CglpbnQgaSwgbnVtOwoJZm9yIChpPTA7aTw0O2krKykKCXsKCQlwcmludGYoIkVudGVyIG51bWJlciIpOwoJCXNjYW5mKCIlZCIsJm51bSk7CgkJQ3JlYXRfbGlzdChudW0pOwoJfQpjb3VudCgpOwoJcmV0dXJuIDA7Cn0K