Detalii evaluare #64397102

Rezumat problemă

#4167

Să se scrie o funcție C++ care elimină toate nodurile cuprinse între cel mai din stânga nod care memorează un număr divizibil cu 3 și cel mai din dreapta nod care memorează un număr divizibil cu 3, inclusiv acestea.

Detalii

Problema FLsiElimina Operații I/O flsielimina.in/flsielimina.out
Limita timp 0.1 secunde Limita memorie Total: 1 MB / Stivă 1 MB
Id soluție #64397102 Utilizator Strat Eduard-Toma (Strat_Eduard)
Fișier flsielimina.cpp Dimensiune 872 B
Data încărcării 05 Mai 2026, 09:46 Scor/rezultat Eroare de compilare

Evaluare

Mesaj compilare

flsielimina.cpp: In function ‘void FLsiElimina(Nod*&)’:
flsielimina.cpp:27:19: error: no match for ‘operator=’ (operand types are ‘Nod’ and ‘Nod*’)
   27 |             ultim=p;
      |                   ^
flsielimina.cpp:4:8: note: candidate: ‘Nod& Nod::operator=(const Nod&)’
    4 | struct Nod
      |        ^~~
flsielimina.cpp:4:8: note:   no known conversion for argument 1 from ‘Nod*’ to ‘const Nod&’
flsielimina.cpp:4:8: note: candidate: ‘Nod& Nod::operator=(Nod&&)’
flsielimina.cpp:4:8: note:   no known conversion for argument 1 from ‘Nod*’ to ‘Nod&&’
flsielimina.cpp:35:21: error: no match for ‘operator!=’ (operand types are ‘Nod*’ and ‘Nod’)
   35 |         while(p->leg!=ultim)
      |               ~~~~~~^~~~~~~
      |                  |    |
      |                  Nod* Nod
In file included from /usr/include/c++/13/iosfwd:42,
                 from /usr/include/c++/13/ios:40,
                 from /usr/include/c++/13/istream:40,
                 from /usr/include/c++/13/fstream:40,
                 from flsielimina.cpp:1:
/usr/include/c++/13/bits/postypes.h:197:5: note: candidate: ‘template<class _StateT> bool std::operator!=(const fpos<_StateT>&, const fpos<_StateT>&)’
  197 |     operator!=(const fpos<_StateT>& __lhs, const fpos<_StateT>& __rhs)
      |     ^~~~~~~~
/usr/include/c++/13/bits/postypes.h:197:5: note:   template argument deduction/substitution failed:
flsielimina.cpp:35:23: note:   mismatched types ‘const std::fpos<_StateT>’ and ‘Nod*’
   35 |         while(p->leg!=ultim)
      |                       ^~~~~
In file included from /usr/include/c++/13/string:43,
                 from /usr/include/c++/13/bits/locale_classes.h:40,
                 from /usr/include/c++/13/bits/ios_base.h:41,
                 from /usr/include/c++/13/ios:44:
/usr/include/c++/13/bits/allocator.h:245:5: note: candidate: ‘template<class _T1, class _T2> bool std::operator!=(const allocator<_CharT>&, const allocator<_T2>&)’
  245 |     operator!=(const allocator<_T1>&, const allocator<_T2>&)
      |     ^~~~~~~~
/usr/include/c++/13/bits/allocator.h:245:5: note:   template argument deduction/substitution failed:
flsielimina.cpp:35:23: note:   mismatched types ‘const std::allocator<_CharT>’ and ‘Nod*’
   35 |         while(p->leg!=ultim)
      |                       ^~~~~
In file included from /usr/include/c++/13/string:48:
/usr/include/c++/13/bits/stl_iterator.h:462:5: note: candidate: ‘template<class _Iterator> bool std::operator!=(const reverse_iterator<_Iterator>&, const reverse_iterator<_Iterator>&)’
  462 |     operator!=(const reverse_iterator<_Iterator>& __x,
      |     ^~~~~~~~
/usr/include/c++/13/bits/stl_iterator.h:462:5: note:   template argument deduction/substitution failed:
flsielimina.cpp:35:23: note:   mismatched types ‘const std::reverse_iterator<_Iterator>’ and ‘Nod*’
   35 |         while(p->leg!=ultim)
      |                       ^~~~~
/usr/include/c++/13/bits/stl_iterator.h:507:5: note: candidate: ‘template<class _IteratorL, class _IteratorR> bool std::operator!=(const reverse_iterator<_Iterator>&, const reverse_iterator<_IteratorR>&)’
  507 |     operator!=(const reverse_iterator<_IteratorL>& __x,
      |     ^~~~~~~~
/usr/include/c++/13/bits/stl_iterator.h:507:5: note:   template argument deduction/substitution failed:
flsielimina.cpp:35:23: note:   mismatched types ‘const std::reverse_iterator<_Iterator>’ and ‘Nod*’
   35 |         while(p->leg!=ultim)
      |                       ^~~~~
/usr/include/c++/13/bits/stl_iterator.h:1697:5: note: candidate: ‘template<class _IteratorL, class _IteratorR> bool std::operator!=(const move_iterator<_IteratorL>&, const move_iterator<_IteratorR>&)’
 1697 |     operator!=(const move_iterator<_IteratorL>& __x,
      |     ^~~~~~~~
/usr/include/c++/13/bits/stl_iterator.h:1697:5: note:   template argument deduction/substitution failed:
flsielimina.cpp:35:23: note:   mismatched types ‘const std::move_iterator<_IteratorL>’ and ‘Nod*’
   35 |         while(p->leg!=ultim)
      |                       ^~~~~
/usr/include/c++/13/bits/stl_iterator.h:1763:5: note: candidate: ‘template<class _Iterator> bool std::operator!=(const move_iterator<_IteratorL>&, const move_iterator<_IteratorL>&)’
 1763 |     operator!=(const move_iterator<_Iterator>& __x,
      |     ^~~~~~~~
/usr/include/c++/13/bits/stl_iterator.h:1763:5: note:   template argument deduction/substitution failed:
flsielimina.cpp:35:23: note:   mismatched types ‘const std::move_iterator<_IteratorL>’ and ‘Nod*’
   35 |         while(p->leg!=ultim)
      |                       ^~~~~
In file included from /usr/include/c++/13/bits/stl_algobase.h:64,
                 from /usr/include/c++/13/string:51:
/usr/include/c++/13/bits/stl_pair.h:842:5: note: candidate: ‘template<class _T1, class _T2> constexpr bool std::operator!=(const pair<_T1, _T2>&, const pair<_T1, _T2>&)’
  842 |     operator!=(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
      |     ^~~~~~~~
/usr/include/c++/13/bits/stl_pair.h:842:5: note:   template argument deduction/substitution failed:
flsielimina.cpp:35:23: note:   mismatched types ‘const std::pair<_T1, _T2>’ and ‘Nod*’
   35 |         while(p->leg!=ultim)
      |                       ^~~~~
In file included from /usr/include/c++/13/string:54:
/usr/include/c++/13/bits/basic_string.h:3788:5: note: candidate: ‘template<class _CharT, class _Traits, class _Alloc> bool std::operator!=(const __cxx11::basic_string<_CharT, _Traits, _Alloc>&, const __cxx11::basic_string<_CharT, _Traits, _Alloc>&)’
 3788 |     operator!=(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
      |     ^~~~~~~~
/usr/include/c++/13/bits/basic_string.h:3788:5: note:   template argument deduction/substitution failed:
flsielimina.cpp:35:23: note:   mismatched types ‘const std::__cxx11::basic_string<_CharT, _Traits, _Alloc>’ and ‘Nod*’
   35 |         while(p->leg!=ultim)
      |                       ^~~~~
/usr/include/c++/13/bits/basic_string.h:3802:5: note: candidate: ‘template<class _CharT, class _Traits, class _Alloc> bool std::operator!=(const _CharT*, const __cxx11::basic_string<_CharT, _Traits, _Alloc>&)’
 3802 |     operator!=(const _CharT* __lhs,
      |     ^~~~~~~~
/usr/include/c++/13/bits/basic_string.h:3802:5: note:   template argument deduction/substitution failed:
flsielimina.cpp:35:23: note:   ‘Nod’ is not derived from ‘const std::__cxx11::basic_string<_CharT, _Traits, _Alloc>’
   35 |         while(p->leg!=ultim)
      |                       ^~~~~
/usr/include/c++/13/bits/basic_string.h:3815:5: note: candidate: ‘template<class _CharT, class _Traits, class _Alloc> bool std::operator!=(const __cxx11::basic_string<_CharT, _Traits, _Alloc>&, const _CharT*)’
 3815 |     operator!=(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
      |     ^~~~~~~~
/usr/include/c++/13/bits/basic_string.h:3815:5: note:   template argument deduction/substitution failed:
flsielimina.cpp:35:23: note:   mismatched types ‘const std::__cxx11::basic_string<_CharT, _Traits, _Alloc>’ and ‘Nod*’
   35 |         while(p->leg!=ultim)
      |                       ^~~~~
In file included from /usr/include/c++/13/bits/locale_facets.h:48,
                 from /usr/include/c++/13/bits/basic_ios.h:37,
                 from /usr/include/c++/13/ios:46:
/usr/include/c++/13/bits/streambuf_iterator.h:242:5: note: candidate: ‘template<class _CharT, class _Traits> bool std::operator!=(const istreambuf_iterator<_CharT, _Traits>&, const istreambuf_iterator<_CharT, _Traits>&)’
  242 |     operator!=(const istreambuf_iterator<_CharT, _Traits>& __a,
      |     ^~~~~~~~
/usr/include/c++/13/bits/streambuf_iterator.h:242:5: note:   template argument deduction/substitution failed:
flsielimina.cpp:35:23: note:   mismatched types ‘const std::istreambuf_iterator<_CharT, _Traits>’ and ‘Nod*’
   35 |         while(p->leg!=ultim)
      |                       ^~~~~
In file included from /usr/include/c++/13/bits/ios_base.h:46:
/usr/include/c++/13/system_error:525:3: note: candidate: ‘bool std::operator!=(const error_code&, const error_code&)’
  525 |   operator!=(const error_code& __lhs, const error_code& __rhs) noexcept
      |   ^~~~~~~~
/usr/include/c++/13/system_error:525:32: note:   no known conversion for argument 1 from ‘Nod*’ to ‘const std::error_code&’
  525 |   operator!=(const error_code& __lhs, const error_code& __rhs) noexcept
      |              ~~~~~~~~~~~~~~~~~~^~~~~
/usr/include/c++/13/system_error:530:3: note: candidate: ‘bool std::operator!=(const error_code&, const error_condition&)’
  530 |   operator!=(const error_code& __lhs, const error_condition& __rhs) noexcept
      |   ^~~~~~~~
/usr/include/c++/13/system_error:530:32: note:   no known conversion for argument 1 from ‘Nod*’ to ‘const std::error_code&’
  530 |   operator!=(const error_code& __lhs, const error_condition& __rhs) noexcept
      |              ~~~~~~~~~~~~~~~~~~^~~~~
/usr/include/c++/13/system_error:535:3: note: candidate: ‘bool std::operator!=(const error_condition&, const error_code&)’
  535 |   operator!=(const error_condition& __lhs, const error_code& __rhs) noexcept
      |   ^~~~~~~~
/usr/include/c++/13/system_error:535:37: note:   no known conversion for argument 1 from ‘Nod*’ to ‘const std::error_condition&’
  535 |   operator!=(const error_condition& __lhs, const error_code& __rhs) noexcept
      |              ~~~~~~~~~~~~~~~~~~~~~~~^~~~~
/usr/include/c++/13/system_error:540:3: note: candidate: ‘bool std::operator!=(const error_condition&, const error_condition&)’
  540 |   operator!=(const error_condition& __lhs,
      |   ^~~~~~~~
/usr/include/c++/13/system_error:540:37: note:   no known conversion for argument 1 from ‘Nod*’ to ‘const std::error_condition&’
  540 |   operator!=(const error_condition& __lhs,
      |              ~~~~~~~~~~~~~~~~~~~~~~~^~~~~
flsielimina.cpp:42:19: error: base operand of ‘->’ has non-pointer type ‘Nod’
   42 |         head=ultim->leg;
      |                   ^~
flsielimina.cpp:43:14: error: base operand of ‘->’ has non-pointer type ‘Nod’
   43 |         ultim->leg=NULL;
      |              ^~
flsielimina.cpp:45:16: error: type ‘struct Nod’ argument given to ‘delete’, expected pointer
   45 |         delete ultim;
      |                ^~~~~
flsielimina.cpp:49:32: error: base operand of ‘->’ has non-pointer type ‘Nod’
   49 |             while(p->leg!=ultim->leg)
      |                                ^~
flsielimina.cpp:51:17: error: ‘q’ was not declared in this scope
   51 |                 q=p->leg;
      |                 ^
flsielimina.cpp:53:17: error: type ‘<type error>’ argument given to ‘delete’, expected pointer
   53 |                 delete q;
      |                 ^~~~~~~~

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 FLsiElimina face parte din a doua categorie. Pentru aceste probleme se folosește un program suport, furnizat de propunătorul problemei. Soluția propusă de tine va fi evaluată astfel:

  • Soluția propusă de tine este inclusă în programul suport, apoi acesta este compilat. Dacă în urma compilării se obțin erori sau avertismente, acestea sunt afișate în această pagină.
  • Datorită existenței programului suport, la compilare pot să apară erori sau avertismente care să nu se refere la instrucțiunile scrise de tine, dar care sunt datorate faptului că soluția ta nu este corectă.
  • Dacă programul suport 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!