int remover(node*h, int key){
    node*aux=h;
    for(h=h->next;h;h=h->next){
        if(h->info==key)
            break;
        if(h->next==NULL)
            return 0;
    }

    for(h;h;h=h->next){
        if(h->next==NULL){
            h->info=NULL;
            break;
        }
        h->info=h->next->info;
    }delete_last(aux);
    return 1;
}

int delete_last(node * head) {
    node *temp = head;
    node *t;
    while(temp->next != NULL)
    {
        t=temp;
        temp=temp->next;
    }
    free(t->next);
    t->next=NULL;
}