Acest site foloseşte cookies. Navigând în continuare, vă exprimaţi acordul asupra folosirii cookie-urilor.

Detalii evaluare #57631776

Rezumat problemă

kNivel1

#760

Se consideră un arbore binar în care nodurile memorează numere naturale nenule și un număr k. În arbore rădăcina se află pe nivelul 0, fii rădăcinii pe nivelul 1, fii fiilor rădăcinii pe nivelul 2, etc. Să se determine suma valorilor din nodurile aflate pe nivelul k.

Fișiere Candale Silviu (silviu) medie
Clasa 11 Structuri de date arborescente Arbori binari
Rezolvă

Detalii

Problema kNivel1 Operații I/O knivel1.in/knivel1.out
Limita timp 0.1 secunde Limita memorie Total: 64 MB / Stivă 8 MB
Id soluție #57631776 Utilizator Antonescu Andrei (Andrei_Antonescu)
Fișier knivel1.cpp Dimensiune 789 B
Data încărcării 08 Aprilie 2025, 13:06 Scor / rezultat Eroare de compilare

Evaluare

Mesaj compilare

knivel1.cpp:7:1: error: stray '\302' in program
 struct nod{  

 ^
knivel1.cpp:7:1: error: stray '\240' in program
knivel1.cpp:8:1: error: stray '\302' in program
 int info,l;  

 ^
knivel1.cpp:8:1: error: stray '\240' in program
knivel1.cpp:12:1: error: stray '\302' in program
 {     

 ^
knivel1.cpp:12:1: error: stray '\240' in program
knivel1.cpp:12:1: error: stray '\302' in program
knivel1.cpp:12:1: error: stray '\240' in program
knivel1.cpp:12:1: error: stray '\302' in program
knivel1.cpp:12:1: error: stray '\240' in program
knivel1.cpp:12:1: error: stray '\302' in program
knivel1.cpp:12:1: error: stray '\240' in program
knivel1.cpp:15:5: error: stray '\302' in program
     p=new nod;  

     ^
knivel1.cpp:15:5: error: stray '\240' in program
knivel1.cpp:16:5: error: stray '\302' in program
     cin>>x;   

     ^
knivel1.cpp:16:5: error: stray '\240' in program
knivel1.cpp:16:5: error: stray '\302' in program
knivel1.cpp:16:5: error: stray '\240' in program
knivel1.cpp:17:5: error: stray '\302' in program
     p->info=x;     

     ^
knivel1.cpp:17:5: error: stray '\240' in program
knivel1.cpp:17:5: error: stray '\302' in program
knivel1.cpp:17:5: error: stray '\240' in program
knivel1.cpp:17:5: error: stray '\302' in program
knivel1.cpp:17:5: error: stray '\240' in program
knivel1.cpp:17:5: error: stray '\302' in program
knivel1.cpp:17:5: error: stray '\240' in program
knivel1.cpp:18:5: error: stray '\302' in program
     if(x!=0)  

     ^
knivel1.cpp:18:5: error: stray '\240' in program
knivel1.cpp:19:5: error: stray '\302' in program
     {        p->st=arbore();  

     ^
knivel1.cpp:19:5: error: stray '\240' in program
knivel1.cpp:19:5: error: stray '\302' in program
knivel1.cpp:19:5: error: stray '\240' in program
knivel1.cpp:19:5: error: stray '\302' in program
knivel1.cpp:19:5: error: stray '\240' in program
knivel1.cpp:19:5: error: stray '\302' in program
knivel1.cpp:19:5: error: stray '\240' in program
knivel1.cpp:19:5: error: stray '\302' in program
knivel1.cpp:19:5: error: stray '\240' in program
knivel1.cpp:19:5: error: stray '\302' in program
knivel1.cpp:19:5: error: stray '\240' in program
knivel1.cpp:19:5: error: stray '\302' in program
knivel1.cpp:19:5: error: stray '\240' in program
knivel1.cpp:19:5: error: stray '\302' in program
knivel1.cpp:19:5: error: stray '\240' in program
knivel1.cpp:19:5: error: stray '\302' in program
knivel1.cpp:19:5: error: stray '\240' in program
knivel1.cpp:20:6: error: stray '\302' in program
      p->dr=arbore();  

      ^
knivel1.cpp:20:6: error: stray '\240' in program
knivel1.cpp:21:5: error: stray '\302' in program
     }    return p; 

     ^
knivel1.cpp:21:5: error: stray '\240' in program
knivel1.cpp:21:5: error: stray '\302' in program
knivel1.cpp:21:5: error: stray '\240' in program
knivel1.cpp:21:5: error: stray '\302' in program
knivel1.cpp:21:5: error: stray '\240' in program
knivel1.cpp:21:5: error: stray '\302' in program
knivel1.cpp:21:5: error: stray '\240' in program
knivel1.cpp:23:1: error: stray '\302' in program
 void afisare(nod *p){  

 ^
knivel1.cpp:23:1: error: stray '\240' in program
knivel1.cpp:25:5: error: stray '\302' in program
     if(p->st->info!=0){     

     ^
knivel1.cpp:25:5: error: stray '\240' in program
knivel1.cpp:25:5: error: stray '\302' in program
knivel1.cpp:25:5: error: stray '\240' in program
knivel1.cpp:25:5: error: stray '\302' in program
knivel1.cpp:25:5: error: stray '\240' in program
knivel1.cpp:25:5: error: stray '\302' in program
knivel1.cpp:25:5: error: stray '\240' in program
knivel1.cpp:26:9: error: stray '\302' in program
         p->st->l=p->l+1;   

         ^
knivel1.cpp:26:9: error: stray '\240' in program
knivel1.cpp:26:9: error: stray '\302' in program
knivel1.cpp:26:9: error: stray '\240' in program
knivel1.cpp:27:9: error: stray '\302' in program
         afisare(p->st);  

         ^
knivel1.cpp:27:9: error: stray '\240' in program
knivel1.cpp:28:5: error: stray '\302' in program
     }    if(p->dr->info!=0){  

     ^
knivel1.cpp:28:5: error: stray '\240' in program
knivel1.cpp:28:5: error: stray '\302' in program
knivel1.cpp:28:5: error: stray '\240' in program
knivel1.cpp:28:5: error: stray '\302' in program
knivel1.cpp:28:5: error: stray '\240' in program
knivel1.cpp:28:5: error: stray '\302' in program
knivel1.cpp:28:5: error: stray '\240' in program
knivel1.cpp:28:5: error: stray '\302' in program
knivel1.cpp:28:5: error: stray '\240' in program
knivel1.cpp:29:9: error: stray '\302' in program
         p->dr->l=p->l+1;  

         ^
knivel1.cpp:29:9: error: stray '\240' in program
knivel1.cpp:34:1: error: stray '\302' in program
 {  

 ^
knivel1.cpp:34:1: error: stray '\240' in program

Cum funcționează evaluarea?

www.pbinfo.ro permite evaluarea a două tipuri de probleme:

  • probleme la care rezolvarea presupune scrierea unui program complet
  • probleme la care rezolvarea presupune scrierea unei secvențe de program - câteva instrucțiuni, o listă de declarații, una sau mai multe funcții, etc.

Problema kNivel1 face parte din prima categorie. Soluția propusă de tine va fi evaluată astfel:

  • Programul sursă este compilat folosind compilatorul corespunzător. Dacă în urma compilării se obțin erori sau avertismente, acestea sunt afișate în această pagină.
  • Dacă programul a fost compilat, executabilul obținut va fi rulat, furnizându-i-se unul sau mai multe seturi de date de intrare, în concordanță cu restricțiile specifice problemei. Pentru fiecare set de date se obține un anumit punctaj, în raport cu corectitudinea soluției tale.

Suma punctajelor acordate pe testele utilizate pentru verificare este 100. Astfel, soluția ta poate obține cel mult 100 de puncte, caz în care se poate considera corectă.

Du-te sus!