ex5.c

#include <stdio.h>
#include <stdlib.h>
#include "listas.h"

void sumar(TLista *x, TLista *y, TLista *c);
void restar(TLista *x, TLista *y, TLista *c);

int main(){

    TLista a,b,c;

    init_list(&a);
    init_list(&b);
    init_list(&c);
    //1234
    insert_list_final(&a,1);
    insert_list_final(&a,2);
    insert_list_final(&a,3);
    insert_list_final(&a,4);
    print_list(&a);
    //219
    insert_list_final(&b,2);
    insert_list_final(&b,1);
    insert_list_final(&b,9);
    print_list(&b);
    sumar(&a,&b,&c);
    print_list(&c);
    init_list(&c);
    restar(&a,&b,&c);
    print_list(&c);
    return 0;
}

void sumar(TLista *x, TLista *y, TLista *c){
    int carry = 0;
    TLista a,b;

    init_list(&a);
    init_list(&b);

    invertir(x,&a);
    invertir(y,&b);
    printf("Hola\n");
    TNode *n1 = malloc(sizeof(TNode));
    TNode *n2 = malloc(sizeof(TNode));
    n1 = a.first; // a->first == (*a.first)
    n2 = b.first;
    while(n1 != NULL && n2 != NULL){
        insert_list_first(c,(n1->info + n2->info + carry)%10);
        carry = (n1->info + n2->info + carry) / 10;
        n1 = n1->next;
        n2 = n2->next;
    }
    while(n1 != NULL){
        insert_list_first(c,(n1->info + carry) % 10);
        carry = (n1->info + carry) / 10;
        n1 = n1->next;
    }
    while(n2 != NULL){
        insert_list_first(c,(n2->info + carry) % 10);
        carry = (n2->info + carry) / 10;
        n2 = n2->next;
    }
}

void restar(TLista *x, TLista *y, TLista *c){
    int borrow=0;
    TLista a,b;
    init_list(&a);
    init_list(&b);
    invertir(x,&a);
    invertir(y,&b);
    TNode *n1 = (TNode*)malloc(sizeof(TNode));
    TNode *n2 = (TNode*)malloc(sizeof(TNode));
    n1 = a.first; // a->first == (*a.first)
    n2 = b.first;
    while(n1!= NULL && n2!=NULL){

        if(n1->info < n2->info){
            borrow=1;
            n1->next->info--;
        }
        else borrow=0;
        insert_list_first(c,(10*borrow + n1->info) - n2->info);
        n1=n1->next;
        n2=n2->next;
    }
    while(n1!=NULL){
        if(borrow==0){
            insert_list_first(c,n1->info);
            n1= n1->next;
        }
        else{
            if(n1->info - borrow ==0)
                break;
            else
                insert_list_first(c,n1->info);
        }
    }
    while(n2!=NULL){
        if(borrow==0){
            insert_list_first(c,n2->info);
            n2= n2->next;
        }
        else{
            if(n2->info - borrow ==0)
                break;
            else
                insert_list_first(c,n2->info);
        }
    }

}

void multiplicar(TLista *x, TLista *y, TLista *c){
    int carry = 0;
    TLista a,b,d,aux,aux2;

    init_list(&a);
    init_list(&b);
    init_list(&d);
    init_list(&aux);
    init_list(&aux2);

    invertir(x,&a);
    invertir(y,&b);

    TNode *n = malloc(sizeof(TNode));
    n = b->first;
    int i = 0;
    while(n != NULL){
        multiplicarAux(a,n->info,&aux);
        sumar(c,&aux,&aux2);
        init_list(c);
        sumar(&aux2,&aux3,c);
        init_list(&aux);
        init_list(&aux2);
        init_list(&aux3);
        n = n->next;
    }

}