#include "stdafx.h"
#include <iostream>

using namespace std;

struct L1 {
    double data;
    L1 *next;
}*start_L1 = NULL;

struct L2 {
    int data;
    L2 *next;
}*start_L2 = NULL;

void delElem();
void add_e_L1(double &n);
void add_b_L2(int number);
void print_list();

void main()
{
    double number_L1 = -1;
    while (number_L1 != 0)

    {
        cout << "Vavedete realno chislo za spisaka L1 ( 0 za kraj ): ";
        cin >> number_L1;

        if(number_L1 != 0)
            add_e_L1(number_L1);
    }

    int number_L2 = -1;
    while (number_L2 != 0)
    {
        cout << "Vavedete cqlo chislo za spisaka L2 ( 0 za kraj ): ";
        cin >> number_L2;
        if(number_L2 != 0)
            add_b_L2(number_L2);
    }
    delElem();
    print_list();
}


void add_b_L2(int number)
{
    L2 *p = start_L2;
    start_L2 = new L2;
    start_L2->data = number;
    start_L2->next = p;
}

void add_e_L1(double &n)
{
    L1 *p = start_L1, *q;
    q = new L1;
    q->next = NULL;
    q->data = n;
    if (start_L1)
    {
        while (p->next)
            p = p->next;
        p->next = q;
    }
    else start_L1 = q;
}

void add_e_L2(int &n)
{
    L2 *p = start_L2, *q;
    q = new L2;
    q->next = NULL;
    q->data = n;
    if (start_L2)
    {
        while (p->next)
            p = p->next;
        p->next = q;
    }
    else start_L2 = q;
}

void print_list()
{
    L1 *p = start_L1;
    if (start_L1)
    {
        while (p) {
            cout << p->data << "\t";
            p = p->next;
        }
    }
    else
        cout << "No list \n";
}

void delElem()
{
    bool notDeleted = true;
    L2 *m = start_L2;
    int deleteOnIndex = 0;

    while (m != NULL) {
        deleteOnIndex = m->data;

        L1 *p = start_L1, *q, *toDelete;

        if (start_L1 == NULL)
            return;

        int index = 0;

        while (p != NULL && p->next != NULL)
        {
            index++;
            q = p;

            while (q->next != NULL)
            {
                if (deleteOnIndex == index && notDeleted)
                {
                    toDelete = q->next;
                    q->next = q->next->next;
                    delete (toDelete);
                    notDeleted = false;
                }
                else
                    q = q->next;
            }
            p = p->next;
        }
        notDeleted = true;
        m = m->next;
    }
}