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

Detalii evaluare #52105605

Rezumat problemă

#792 BiNefrunze1

Se consideră un arbore binar în care nodurile memorează numere naturale nenule. Să se afișeze valorile memorate în nodurile neterminale ale arborelui, în ordine descrescătoare.

Rezolvă

Detalii

Problema BiNefrunze1 Operații I/O binefrunze1.in/binefrunze1.out
Limita timp 0.1 secunde Limita memorie Total: 64 MB / Stivă 8 MB
Id soluție #52105605 Utilizator Dore Stefan (stefan_dore_)
Fișier binefrunze1.cpp Dimensiune 868 B
Data încărcării 19 Septembrie 2024, 10:08 Scor / rezultat Eroare de compilare

Evaluare


Mesaj compilare

binefrunze1.cpp: In function 'void cmp(const int&, const int&)':
binefrunze1.cpp:20:16: error: return-statement with a value, in function returning 'void' [-fpermissive]
     return a > b;

                ^
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from binefrunze1.cpp:3:
/usr/include/c++/4.8/bits/stl_algo.h: In instantiation of 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = int*; _Compare = void (*)(const int&, const int&)]':
/usr/include/c++/4.8/bits/stl_algo.h:2226:70:   required from 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = int*; _Compare = void (*)(const int&, const int&)]'
/usr/include/c++/4.8/bits/stl_algo.h:5500:55:   required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = int*; _Compare = void (*)(const int&, const int&)]'
binefrunze1.cpp:49:28:   required from here
/usr/include/c++/4.8/bits/stl_algo.h:2159:29: error: could not convert '__comp((*(const int*)__i), (*(const int*)__first))' from 'void' to 'bool'
    if (__comp(*__i, *__first))
                             ^
/usr/include/c++/4.8/bits/stl_algo.h: In instantiation of 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = int*; _Compare = void (*)(const int&, const int&)]':
/usr/include/c++/4.8/bits/stl_algo.h:5349:59:   required from 'void std::partial_sort(_RAIter, _RAIter, _RAIter, _Compare) [with _RAIter = int*; _Compare = void (*)(const int&, const int&)]'
/usr/include/c++/4.8/bits/stl_algo.h:2332:68:   required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = int*; _Size = int; _Compare = void (*)(const int&, const int&)]'
/usr/include/c++/4.8/bits/stl_algo.h:5499:44:   required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = int*; _Compare = void (*)(const int&, const int&)]'
binefrunze1.cpp:49:28:   required from here
/usr/include/c++/4.8/bits/stl_algo.h:1948:27: error: could not convert '__comp((*(const int*)__i), (*(const int*)__first))' from 'void' to 'bool'
  if (__comp(*__i, *__first))
                           ^
/usr/include/c++/4.8/bits/stl_algo.h: In instantiation of 'void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = int*; _Compare = void (*)(const int&, const int&)]':
/usr/include/c++/4.8/bits/stl_algo.h:2295:13:   required from '_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = int*; _Compare = void (*)(const int&, const int&)]'
/usr/include/c++/4.8/bits/stl_algo.h:2337:62:   required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = int*; _Size = int; _Compare = void (*)(const int&, const int&)]'
/usr/include/c++/4.8/bits/stl_algo.h:5499:44:   required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = int*; _Compare = void (*)(const int&, const int&)]'
binefrunze1.cpp:49:28:   required from here
/usr/include/c++/4.8/bits/stl_algo.h:114:28: error: could not convert '__comp((*(const int*)__a), (*(const int*)__b))' from 'void' to 'bool'
       if (__comp(*__a, *__b))
                            ^
/usr/include/c++/4.8/bits/stl_algo.h:116:25: error: could not convert '__comp((*(const int*)__b), (*(const int*)__c))' from 'void' to 'bool'
    if (__comp(*__b, *__c))
                         ^
/usr/include/c++/4.8/bits/stl_algo.h:118:30: error: could not convert '__comp((*(const int*)__a), (*(const int*)__c))' from 'void' to 'bool'
    else if (__comp(*__a, *__c))
                              ^
/usr/include/c++/4.8/bits/stl_algo.h:123:33: error: could not convert '__comp((*(const int*)__a), (*(const int*)__c))' from 'void' to 'bool'
       else if (__comp(*__a, *__c))
                                 ^
/usr/include/c++/4.8/bits/stl_algo.h:125:33: error: could not convert '__comp((*(const int*)__b), (*(const int*)__c))' from 'void' to 'bool'
       else if (__comp(*__b, *__c))
                                 ^
/usr/include/c++/4.8/bits/stl_algo.h: In instantiation of '_RandomAccessIterator std::__unguarded_partition(_RandomAccessIterator, _RandomAccessIterator, const _Tp&, _Compare) [with _RandomAccessIterator = int*; _Tp = int; _Compare = void (*)(const int&, const int&)]':
/usr/include/c++/4.8/bits/stl_algo.h:2296:78:   required from '_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = int*; _Compare = void (*)(const int&, const int&)]'
/usr/include/c++/4.8/bits/stl_algo.h:2337:62:   required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = int*; _Size = int; _Compare = void (*)(const int&, const int&)]'
/usr/include/c++/4.8/bits/stl_algo.h:5499:44:   required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = int*; _Compare = void (*)(const int&, const int&)]'
binefrunze1.cpp:49:28:   required from here
/usr/include/c++/4.8/bits/stl_algo.h:2263:35: error: could not convert '__comp((*(const int*)__first), (* & __pivot))' from 'void' to 'bool'
    while (__comp(*__first, __pivot))
                                   ^
/usr/include/c++/4.8/bits/stl_algo.h:2266:34: error: could not convert '__comp((* & __pivot), (*(const int*)__last))' from 'void' to 'bool'
    while (__comp(__pivot, *__last))
                                  ^
In file included from /usr/include/c++/4.8/bits/stl_algo.h:61:0,
                 from /usr/include/c++/4.8/algorithm:62,
                 from binefrunze1.cpp:3:
/usr/include/c++/4.8/bits/stl_heap.h: In instantiation of 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = int*; _Distance = int; _Tp = int; _Compare = void (*)(const int&, const int&)]':
/usr/include/c++/4.8/bits/stl_heap.h:448:15:   required from 'void std::make_heap(_RAIter, _RAIter, _Compare) [with _RAIter = int*; _Compare = void (*)(const int&, const int&)]'
/usr/include/c++/4.8/bits/stl_algo.h:1946:47:   required from 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = int*; _Compare = void (*)(const int&, const int&)]'
/usr/include/c++/4.8/bits/stl_algo.h:5349:59:   required from 'void std::partial_sort(_RAIter, _RAIter, _RAIter, _Compare) [with _RAIter = int*; _Compare = void (*)(const int&, const int&)]'
/usr/include/c++/4.8/bits/stl_algo.h:2332:68:   required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = int*; _Size = int; _Compare = void (*)(const int&, const int&)]'
/usr/include/c++/4.8/bits/stl_algo.h:5499:44:   required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = int*; _Compare = void (*)(const int&, const int&)]'
binefrunze1.cpp:49:28:   required from here
/usr/include/c++/4.8/bits/stl_heap.h:313:40: error: could not convert '__comp((*(((const int*)__first) + ((sizetype)(((unsigned int)__secondChild) * 4u)))), (*(const int*)(__first + ((((sizetype)__secondChild) + 1073741823u) * 4u))))' from 'void' to 'bool'
        *(__first + (__secondChild - 1))))
                                        ^

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