#include<stdio.h>
#include<stdlib.h>
struct node{
int data;
struct node* next;
};
struct node* head;
void Insert(int x);
void Print();
int main(void){
head = NULL;
int n,i,x;
for(i=0;i<n;i++){
Insert(x);
Print();
}
return 0;
}
void Insert(int x){
struct node
* temp
= (struct node
*)malloc(sizeof(struct node
)); temp->data = x;
(*temp).next = head;
head = temp;
}
void Print(){
struct node* temp = head;
while(temp!=NULL){
temp=temp->next;
}
}
I2luY2x1ZGU8c3RkaW8uaD4KI2luY2x1ZGU8c3RkbGliLmg+CgpzdHJ1Y3Qgbm9kZXsKICAgIGludCBkYXRhOwogICAgc3RydWN0IG5vZGUqIG5leHQ7Cn07CgpzdHJ1Y3Qgbm9kZSogaGVhZDsKCnZvaWQgSW5zZXJ0KGludCB4KTsKdm9pZCBQcmludCgpOwoKaW50IG1haW4odm9pZCl7CgogICAgaGVhZCA9IE5VTEw7CiAgICBwcmludGYoImhvdyBtYW55IG51bWJlcnM/Iik7CiAgICBpbnQgbixpLHg7CiAgICBzY2FuZigiJWQiLCZuKTsKCiAgICBmb3IoaT0wO2k8bjtpKyspewogICAgICAgIHByaW50ZigiRW50ZXIgdGhlIG51bWJlciIpOwogICAgICAgIHNjYW5mKCIlZCIsJngpOwogICAgICAgIEluc2VydCh4KTsKICAgICAgICBQcmludCgpOwogICAgfQoKICAgIHJldHVybiAwOwp9Cgp2b2lkIEluc2VydChpbnQgeCl7CgogICAgc3RydWN0IG5vZGUqIHRlbXAgPSAoc3RydWN0IG5vZGUqKW1hbGxvYyhzaXplb2Yoc3RydWN0IG5vZGUpKTsKICAgIHRlbXAtPmRhdGEgPSB4OwogICAgKCp0ZW1wKS5uZXh0ID0gaGVhZDsKICAgIGhlYWQgPSB0ZW1wOwp9Cgp2b2lkIFByaW50KCl7CgogICAgc3RydWN0IG5vZGUqIHRlbXAgPSBoZWFkOwogICAgcHJpbnRmKCJcblRoZSBMaXN0IGlzICIpOwogICAgd2hpbGUodGVtcCE9TlVMTCl7CiAgICAgICAgcHJpbnRmKCIgJWQiLCB0ZW1wLT5kYXRhKTsKICAgICAgICB0ZW1wPXRlbXAtPm5leHQ7CiAgICB9Cn0=