# include < iostream >
# include < iostream >
# include < fstream >
# include < cmath >
struct Nod {
int valoare;
Nod* urmator ;
};
void inserareOrdonata (Nod*& lista, int valoare) {
Nod* nod = new Nod;
nod->valoare = valoare;
nod-> urmator = nullptr ;
if (lista == nullptr ) {
lista = nod;
return ;
}
if (valoare < lista->valoare) {
nod-> urmator = lista;
lista = nod;
return ;
}
Nod* p = lista;
while (p-> urmator != nullptr && valoare >= p-> urmator ->valoare) {
p = p-> urmator ;
}
nod-> urmator = p-> urmator ;
p-> urmator = nod;
}
int main () {
// Citire lista circulara din fisier
std :: ifstream fisier ( "lista.txt" ) ;
Nod* lista = nullptr ;
Nod* ultimulNod = nullptr ;
int valoare;
while ( fisier >> valoare) {
inserareOrdonata (lista, valoare);
}
ultimulNod = lista;
while ( ultimulNod -> urmator != nullptr ) {
ultimulNod = ultimulNod -> urmator ;
}
ultimulNod -> urmator = lista;
// Cream lista cu numerele patrate perfecte
Nod* listaPatrate = nullptr ;
Nod* ultimulNodPatrate = nullptr ;
Nod* p = lista;
do {
if ( std :: sqrt (p->valoare) == std :: floor ( std :: sqrt (p->valoare))) {
Nod* nod = new Nod;
nod->valoare = p->valoare;
nod-> urmator = listaPatrate ;
if ( listaPatrate == nullptr ) {
listaPatrate = nod;
}
else {
ultimulNodPatrate -> urmator = nod;
}
ultimulNodPatrate = nod;
}
p = p-> urmator ;
} while (p != lista);
// Afisam lista patratelor perfecte
std :: cout << "Lista patratelor perfecte: " ;
p = listaPatrate ;
do {
std :: cout << p->valoare << " " ;
p = p-> urmator ;
} while (p != listaPatrate );
std :: cout << std :: endl ;
// Eliberam memoria alocata dinamic
p = listaPatrate ;
do {
Nod* q = p;
p = p-> urmator ;
delete q;
} while (p != listaPatrate );
p = lista;
do {
Nod* q = p;
p = p-> urmator ;
delete q;
} while (p != lista);
return 0 ;
}