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

Detalii evaluare #22862754

Rezumat problemă

#636 Arbore

Se dau cele n-1 muchii ale unui arbore cu n noduri și un nod k . Afișați vectorul de tați al arborelui cu rădăcina în k.

Rezolvă

Detalii

Problema Arbore Operații I/O arbore.in/arbore.out
Limita timp 0.1 secunde Limita memorie Total: 64 MB / Stivă 8 MB
Id soluție #22862754 Utilizator Simion Alexandra (alexandra_simi)
Fișier arbore.cpp Dimensiune 494 B
Data încărcării 09 Mai 2020, 20:56 Scor / rezultat Eroare de compilare

Evaluare


Mesaj compilare

arbore.cpp:12:1: error: stray '\302' in program
    if(dec[i]==0 && a[k][i])

 ^
arbore.cpp:12:1: error: stray '\240' in program
arbore.cpp:12:1: error: stray '\302' in program
arbore.cpp:12:1: error: stray '\240' in program
arbore.cpp:13:1: error: stray '\302' in program
    {

 ^
arbore.cpp:13:1: error: stray '\240' in program
arbore.cpp:13:1: error: stray '\302' in program
arbore.cpp:13:1: error: stray '\240' in program
arbore.cpp:14:1: error: stray '\302' in program
        tata[i]=k;

 ^
arbore.cpp:14:1: error: stray '\240' in program
arbore.cpp:14:1: error: stray '\302' in program
arbore.cpp:14:1: error: stray '\240' in program
arbore.cpp:14:1: error: stray '\302' in program
arbore.cpp:14:1: error: stray '\240' in program
arbore.cpp:14:1: error: stray '\302' in program
arbore.cpp:14:1: error: stray '\240' in program
arbore.cpp:15:1: error: stray '\302' in program
        fct(i);

 ^
arbore.cpp:15:1: error: stray '\240' in program
arbore.cpp:15:1: error: stray '\302' in program
arbore.cpp:15:1: error: stray '\240' in program
arbore.cpp:15:1: error: stray '\302' in program
arbore.cpp:15:1: error: stray '\240' in program
arbore.cpp:15:1: error: stray '\302' in program
arbore.cpp:15:1: error: stray '\240' in program
arbore.cpp:16:1: error: stray '\302' in program
    }

 ^
arbore.cpp:16:1: error: stray '\240' in program
arbore.cpp:16:1: error: stray '\302' in program
arbore.cpp:16:1: error: stray '\240' in program
arbore.cpp:24:1: error: stray '\302' in program
    f>>x>>y;

 ^
arbore.cpp:24:1: error: stray '\240' in program
arbore.cpp:24:1: error: stray '\302' in program
arbore.cpp:24:1: error: stray '\240' in program
arbore.cpp:25:1: error: stray '\302' in program
    a[x][y]=a[y][x]=1;

 ^
arbore.cpp:25:1: error: stray '\240' in program
arbore.cpp:25:1: error: stray '\302' in program
arbore.cpp:25:1: error: stray '\240' in program
arbore.cpp:30:1: error: stray '\302' in program
    g<<tata[i]<<" ";

 ^
arbore.cpp:30:1: error: stray '\240' in program
arbore.cpp:30:1: error: stray '\302' in program
arbore.cpp:30:1: error: stray '\240' in program
arbore.cpp:31:1: error: stray '\302' in program
    return 0;

 ^
arbore.cpp:31:1: error: stray '\240' in program
arbore.cpp:31:1: error: stray '\302' in program
arbore.cpp:31:1: error: stray '\240' in program
arbore.cpp: In function 'void fct(int)':
arbore.cpp:9:1: error: reference to 'dec' is ambiguous
 dec[k]=1;

 ^
arbore.cpp:6:35: note: candidates are: int dec [105]
 int tata[105],n,x,y,k,a[105][105],dec[105];

                                   ^
In file included from /usr/include/c++/4.8/ios:42:0,
                 from /usr/include/c++/4.8/ostream:38,
                 from /usr/include/c++/4.8/iostream:39,
                 from arbore.cpp:1:
/usr/include/c++/4.8/bits/ios_base.h:939:3: note:                 std::ios_base& std::dec(std::ios_base&)
   dec(ios_base& __base)
   ^
arbore.cpp:12:9: error: reference to 'dec' is ambiguous
    if(dec[i]==0 && a[k][i])

         ^
arbore.cpp:6:35: note: candidates are: int dec [105]
 int tata[105],n,x,y,k,a[105][105],dec[105];

                                   ^
In file included from /usr/include/c++/4.8/ios:42:0,
                 from /usr/include/c++/4.8/ostream:38,
                 from /usr/include/c++/4.8/iostream:39,
                 from arbore.cpp:1:
/usr/include/c++/4.8/bits/ios_base.h:939:3: note:                 std::ios_base& std::dec(std::ios_base&)
   dec(ios_base& __base)
   ^
arbore.cpp: In function 'int main()':
arbore.cpp:28:1: error: reference to 'dec' is ambiguous
 dec[k]=1;

 ^
arbore.cpp:6:35: note: candidates are: int dec [105]
 int tata[105],n,x,y,k,a[105][105],dec[105];

                                   ^
In file included from /usr/include/c++/4.8/ios:42:0,
                 from /usr/include/c++/4.8/ostream:38,
                 from /usr/include/c++/4.8/iostream:39,
                 from arbore.cpp:1:
/usr/include/c++/4.8/bits/ios_base.h:939:3: note:                 std::ios_base& std::dec(std::ios_base&)
   dec(ios_base& __base)
   ^

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 Arbore 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ă.