#include <stdio.h>
int main() {
typedef struct node * list;
struct node {
int key;
list next;
};
list L = NULL;
L->key = 5; // аналог L^.key ; Можно: (*L).key
L->next->key = 10;
L
->next
->next
= malloc(sizeof(*L
));L->next->next->key = 12;
L->next->next->next = NULL;
list p = L, q;
while (p!=NULL) {
printf("%d ",p
->key
); // будет выдано 5 10 12 p = p->next;
}
p = L;
while (p!=NULL) {
q = p;
p = p->next;
}
return 0;
}
I2luY2x1ZGUgPHN0ZGlvLmg+CgppbnQgbWFpbigpIHsKCQkKCQp0eXBlZGVmIHN0cnVjdCBub2RlICogbGlzdDsKc3RydWN0IG5vZGUgeyAKCWludCBrZXk7IAoJbGlzdCBuZXh0OyAKfTsKCmxpc3QgTCA9IE5VTEw7CkwgPSBtYWxsb2Moc2l6ZW9mKCpMKSk7CkwtPmtleSA9IDU7IC8vINCw0L3QsNC70L7QsyBMXi5rZXkgOyDQnNC+0LbQvdC+OiAoKkwpLmtleQpMLT5uZXh0ID0gbWFsbG9jKHNpemVvZigqTCkpOwpMLT5uZXh0LT5rZXkgPSAxMDsKTC0+bmV4dC0+bmV4dCA9IG1hbGxvYyhzaXplb2YoKkwpKTsKTC0+bmV4dC0+bmV4dC0+a2V5ID0gMTI7CkwtPm5leHQtPm5leHQtPm5leHQgPSBOVUxMOwoKbGlzdCBwID0gTCwgcTsKCndoaWxlIChwIT1OVUxMKSB7CiAgcHJpbnRmKCIlZCAiLHAtPmtleSk7IC8vINCx0YPQtNC10YIg0LLRi9C00LDQvdC+IDUgMTAgMTIKICBwID0gcC0+bmV4dDsKfQpwcmludGYoIlxuIik7CnAgPSBMOwp3aGlsZSAocCE9TlVMTCkgewogIHEgPSBwOwogIHAgPSBwLT5uZXh0OwogIGZyZWUocSk7Cn0KCgoJcmV0dXJuIDA7Cn0=