Acest site foloseşte cookies. Navigând în continuare, vă exprimaţi acordul asupra folosirii cookie-urilor.
Detalii evaluare #64745758
Rezumat problemă
FLdiAdInainte
C++#4175
Să se scrie o funcție C++ care va insera înainte de nodul care memorează informația minimă un nou nod care va reține valoarea x.
Pracsiu Dan (dnprx) Detalii
| Problema | FLdiAdInainte | Operații I/O |
fldiadinainte.in/fldiadinainte.out
|
|---|---|---|---|
| Limita timp | 0.1 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
| Id soluție | #64745758 | Utilizator |
David Minzicu (Sunt_cineva_nush_cine)
|
| Fișier | fldiadinainte.cpp | Dimensiune | 470 B |
| Data încărcării | 27 Mai 2026, 13:17 | Scor/rezultat | Eroare de compilare |
Evaluare
Mesaj compilare
fldiadinainte.cpp: In function ‘void FLdiAdInainte(nod*&, nod*&, int)’: fldiadinainte.cpp:18:14: error: conversion from ‘nod*’ to non-scalar type ‘nod’ requested 18 | nod amin=prim; | ^~~~ fldiadinainte.cpp:20:43: error: no match for ‘operator=’ (operand types are ‘nod’ and ‘nod*’) 20 | if(p->info<minx)minx=p->info,amin=p; | ^ fldiadinainte.cpp:4:8: note: candidate: ‘nod& nod::operator=(const nod&)’ 4 | struct nod | ^~~ fldiadinainte.cpp:4:8: note: no known conversion for argument 1 from ‘nod*’ to ‘const nod&’ fldiadinainte.cpp:4:8: note: candidate: ‘nod& nod::operator=(nod&&)’ fldiadinainte.cpp:4:8: note: no known conversion for argument 1 from ‘nod*’ to ‘nod&&’ fldiadinainte.cpp:22:12: error: no match for ‘operator==’ (operand types are ‘nod’ and ‘nod*’) 22 | if(amin==prim) | ~~~~^~~~~~ | | | | nod nod* In file included from /usr/include/c++/13/regex:68, from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:181, from fldiadinainte.cpp:1: /usr/include/c++/13/bits/regex.h:1103:5: note: candidate: ‘template<class _BiIter> bool std::__cxx11::operator==(const sub_match<_BiIter>&, const sub_match<_BiIter>&)’ 1103 | operator==(const sub_match<_BiIter>& __lhs, const sub_match<_BiIter>& __rhs) | ^~~~~~~~ /usr/include/c++/13/bits/regex.h:1103:5: note: template argument deduction/substitution failed: fldiadinainte.cpp:22:14: note: ‘nod’ is not derived from ‘const std::__cxx11::sub_match<_BiIter>’ 22 | if(amin==prim) | ^~~~ /usr/include/c++/13/bits/regex.h:1199:5: note: candidate: ‘template<class _Bi_iter, class _Ch_traits, class _Ch_alloc> bool std::__cxx11::operator==(__sub_match_string<_Bi_iter, _Ch_traits, _Ch_alloc>&, const sub_match<_BiIter>&)’ 1199 | operator==(const __sub_match_string<_Bi_iter, _Ch_traits, _Ch_alloc>& __lhs, | ^~~~~~~~ /usr/include/c++/13/bits/regex.h:1199:5: note: template argument deduction/substitution failed: fldiadinainte.cpp:22:14: note: ‘nod’ is not derived from ‘std::__cxx11::__sub_match_string<_Bi_iter, _Ch_traits, _Ch_alloc>’ 22 | if(amin==prim) | ^~~~ /usr/include/c++/13/bits/regex.h:1274:5: note: candidate: ‘template<class _Bi_iter, class _Ch_traits, class _Ch_alloc> bool std::__cxx11::operator==(const sub_match<_BiIter>&, __sub_match_string<_Bi_iter, _Ch_traits, _Ch_alloc>&)’ 1274 | operator==(const sub_match<_Bi_iter>& __lhs, | ^~~~~~~~ /usr/include/c++/13/bits/regex.h:1274:5: note: template argument deduction/substitution failed: fldiadinainte.cpp:22:14: note: ‘nod’ is not derived from ‘const std::__cxx11::sub_match<_BiIter>’ 22 | if(amin==prim) | ^~~~ /usr/include/c++/13/bits/regex.h:1366:5: note: candidate: ‘template<class _Bi_iter> bool std::__cxx11::operator==(const typename std::iterator_traits<_Iter>::value_type*, const sub_match<_BiIter>&)’ 1366 | operator==(typename iterator_traits<_Bi_iter>::value_type const* __lhs, | ^~~~~~~~ /usr/include/c++/13/bits/regex.h:1366:5: note: template argument deduction/substitution failed: fldiadinainte.cpp:22:14: note: mismatched types ‘const std::__cxx11::sub_match<_BiIter>’ and ‘nod*’ 22 | if(amin==prim) | ^~~~ /usr/include/c++/13/bits/regex.h:1441:5: note: candidate: ‘template<class _Bi_iter> bool std::__cxx11::operator==(const sub_match<_BiIter>&, const typename std::iterator_traits<_Iter>::value_type*)’ 1441 | operator==(const sub_match<_Bi_iter>& __lhs, | ^~~~~~~~ /usr/include/c++/13/bits/regex.h:1441:5: note: template argument deduction/substitution failed: fldiadinainte.cpp:22:14: note: ‘nod’ is not derived from ‘const std::__cxx11::sub_match<_BiIter>’ 22 | if(amin==prim) | ^~~~ /usr/include/c++/13/bits/regex.h:1534:5: note: candidate: ‘template<class _Bi_iter> bool std::__cxx11::operator==(const typename std::iterator_traits<_Iter>::value_type&, const sub_match<_BiIter>&)’ 1534 | operator==(typename iterator_traits<_Bi_iter>::value_type const& __lhs, | ^~~~~~~~ /usr/include/c++/13/bits/regex.h:1534:5: note: template argument deduction/substitution failed: fldiadinainte.cpp:22:14: note: mismatched types ‘const std::__cxx11::sub_match<_BiIter>’ and ‘nod*’ 22 | if(amin==prim) | ^~~~ /usr/include/c++/13/bits/regex.h:1613:5: note: candidate: ‘template<class _Bi_iter> bool std::__cxx11::operator==(const sub_match<_BiIter>&, const typename std::iterator_traits<_Iter>::value_type&)’ 1613 | operator==(const sub_match<_Bi_iter>& __lhs, | ^~~~~~~~ /usr/include/c++/13/bits/regex.h:1613:5: note: template argument deduction/substitution failed: fldiadinainte.cpp:22:14: note: ‘nod’ is not derived from ‘const std::__cxx11::sub_match<_BiIter>’ 22 | if(amin==prim) | ^~~~ /usr/include/c++/13/bits/regex.h:2186:5: note: candidate: ‘template<class _Bi_iter, class _Alloc> bool std::__cxx11::operator==(const match_results<_BiIter, _Alloc>&, const match_results<_BiIter, _Alloc>&)’ 2186 | operator==(const match_results<_Bi_iter, _Alloc>& __m1, | ^~~~~~~~ /usr/include/c++/13/bits/regex.h:2186:5: note: template argument deduction/substitution failed: fldiadinainte.cpp:22:14: note: ‘nod’ is not derived from ‘const std::__cxx11::match_results<_BiIter, _Alloc>’ 22 | if(amin==prim) | ^~~~ In file included from /usr/include/c++/13/bits/stl_algobase.h:64, from /usr/include/c++/13/algorithm:60, from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:51: /usr/include/c++/13/bits/stl_pair.h:812:5: note: candidate: ‘template<class _T1, class _T2> constexpr bool std::operator==(const pair<_T1, _T2>&, const pair<_T1, _T2>&)’ 812 | operator==(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) | ^~~~~~~~ /usr/include/c++/13/bits/stl_pair.h:812:5: note: template argument deduction/substitution failed: fldiadinainte.cpp:22:14: note: ‘nod’ is not derived from ‘const std::pair<_T1, _T2>’ 22 | if(amin==prim) | ^~~~ In file included from /usr/include/c++/13/bits/stl_algobase.h:67: /usr/include/c++/13/bits/stl_iterator.h:448:5: note: candidate: ‘template<class _Iterator> bool std::operator==(const reverse_iterator<_Iterator>&, const reverse_iterator<_Iterator>&)’ 448 | operator==(const reverse_iterator<_Iterator>& __x, | ^~~~~~~~ /usr/include/c++/13/bits/stl_iterator.h:448:5: note: template argument deduction/substitution failed: fldiadinainte.cpp:22:14: note: ‘nod’ is not derived from ‘const std::reverse_iterator<_Iterator>’ 22 | if(amin==prim) | ^~~~ /usr/include/c++/13/bits/stl_iterator.h:493:5: note: candidate: ‘template<class _IteratorL, class _IteratorR> bool std::operator==(const reverse_iterator<_Iterator>&, const reverse_iterator<_IteratorR>&)’ 493 | operator==(const reverse_iterator<_IteratorL>& __x, | ^~~~~~~~ /usr/include/c++/13/bits/stl_iterator.h:493:5: note: template argument deduction/substitution failed: fldiadinainte.cpp:22:14: note: ‘nod’ is not derived from ‘const std::reverse_iterator<_Iterator>’ 22 | if(amin==prim) | ^~~~ /usr/include/c++/13/bits/stl_iterator.h:1678:5: note: candidate: ‘template<class _IteratorL, class _IteratorR> bool std::operator==(const move_iterator<_IteratorL>&, const move_iterator<_IteratorR>&)’ 1678 | operator==(const move_iterator<_IteratorL>& __x, | ^~~~~~~~ /usr/include/c++/13/bits/stl_iterator.h:1678:5: note: template argument deduction/substitution failed: fldiadinainte.cpp:22:14: note: ‘nod’ is not derived from ‘const std::move_iterator<_IteratorL>’ 22 | if(amin==prim) | ^~~~ /usr/include/c++/13/bits/stl_iterator.h:1748:5: note: candidate: ‘template<class _Iterator> bool std::operator==(const move_iterator<_IteratorL>&, const move_iterator<_IteratorL>&)’ 1748 | operator==(const move_iterator<_Iterator>& __x, | ^~~~~~~~ /usr/include/c++/13/bits/stl_iterator.h:1748:5: note: template argument deduction/substitution failed: fldiadinainte.cpp:22:14: note: ‘nod’ is not derived from ‘const std::move_iterator<_IteratorL>’ 22 | if(amin==prim) | ^~~~ In file included from /usr/include/c++/13/bits/char_traits.h:42, from /usr/include/c++/13/string:42, from /usr/include/c++/13/bitset:52, from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:52: /usr/include/c++/13/bits/postypes.h:192:5: note: candidate: ‘template<class _StateT> bool std::operator==(const fpos<_StateT>&, const fpos<_StateT>&)’ 192 | operator==(const fpos<_StateT>& __lhs, const fpos<_StateT>& __rhs) | ^~~~~~~~ /usr/include/c++/13/bits/postypes.h:192:5: note: template argument deduction/substitution failed: fldiadinainte.cpp:22:14: note: ‘nod’ is not derived from ‘const std::fpos<_StateT>’ 22 | if(amin==prim) | ^~~~ In file included from /usr/include/c++/13/string:43: /usr/include/c++/13/bits/allocator.h:237:5: note: candidate: ‘template<class _T1, class _T2> bool std::operator==(const allocator<_CharT>&, const allocator<_T2>&)’ 237 | operator==(const allocator<_T1>&, const allocator<_T2>&) | ^~~~~~~~ /usr/include/c++/13/bits/allocator.h:237:5: note: template argument deduction/substitution failed: fldiadinainte.cpp:22:14: note: ‘nod’ is not derived from ‘const std::allocator<_CharT>’ 22 | if(amin==prim) | ^~~~ In file included from /usr/include/c++/13/string:54: /usr/include/c++/13/bits/basic_string.h:3710: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>&)’ 3710 | operator==(const basic_string<_CharT, _Traits, _Alloc>& __lhs, | ^~~~~~~~ /usr/include/c++/13/bits/basic_string.h:3710:5: note: template argument deduction/substitution failed: fldiadinainte.cpp:22:14: note: ‘nod’ is not derived from ‘const std::__cxx11::basic_string<_CharT, _Traits, _Alloc>’ 22 | if(amin==prim) | ^~~~ /usr/include/c++/13/bits/basic_string.h:3727:5: note: candidate: ‘template<class _CharT, class _Traits, class _Alloc> bool std::operator==(const __cxx11::basic_string<_CharT, _Traits, _Alloc>&, const _CharT*)’ 3727 | operator==(const basic_string<_CharT, _Traits, _Alloc>& __lhs, | ^~~~~~~~ /usr/include/c++/13/bits/basic_string.h:3727:5: note: template argument deduction/substitution failed: fldiadinainte.cpp:22:14: note: ‘nod’ is not derived from ‘const std::__cxx11::basic_string<_CharT, _Traits, _Alloc>’ 22 | if(amin==prim) | ^~~~ /usr/include/c++/13/bits/basic_string.h:3774:5: note: candidate: ‘template<class _CharT, class _Traits, class _Alloc> bool std::operator==(const _CharT*, const __cxx11::basic_string<_CharT, _Traits, _Alloc>&)’ 3774 | operator==(const _CharT* __lhs, | ^~~~~~~~ /usr/include/c++/13/bits/basic_string.h:3774:5: note: template argument deduction/substitution failed: fldiadinainte.cpp:22:14: note: mismatched types ‘const _CharT*’ and ‘nod’ 22 | if(amin==prim) | ^~~~ In file included from /usr/include/c++/13/functional:53, from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:53: /usr/include/c++/13/tuple:1919:5: note: candidate: ‘template<class ... _TElements, class ... _UElements> constexpr bool std::operator==(const tuple<_Elements ...>&, const tuple<_Types ...>&)’ 1919 | operator==(const tuple<_TElements...>& __t, | ^~~~~~~~ /usr/include/c++/13/tuple:1919:5: note: template argument deduction/substitution failed: fldiadinainte.cpp:22:14: note: ‘nod’ is not derived from ‘const std::tuple<_Elements ...>’ 22 | if(amin==prim) | ^~~~ In file included from /usr/include/c++/13/functional:59: /usr/include/c++/13/bits/std_function.h:737:5: note: candidate: ‘template<class _Res, class ... _Args> bool std::operator==(const function<_Res(_ArgTypes ...)>&, nullptr_t)’ 737 | operator==(const function<_Res(_Args...)>& __f, nullptr_t) noexcept | ^~~~~~~~ /usr/include/c++/13/bits/std_function.h:737:5: note: template argument deduction/substitution failed: fldiadinainte.cpp:22:14: note: ‘nod’ is not derived from ‘const std::function<_Res(_ArgTypes ...)>’ 22 | if(amin==prim) | ^~~~ /usr/include/c++/13/bits/std_function.h:744:5: note: candidate: ‘template<class _Res, class ... _Args> bool std::operator==(nullptr_t, const function<_Res(_ArgTypes ...)>&)’ 744 | operator==(nullptr_t, const function<_Res(_Args...)>& __f) noexcept | ^~~~~~~~ /usr/include/c++/13/bits/std_function.h:744:5: note: template argument deduction/substitution failed: fldiadinainte.cpp:22:14: note: mismatched types ‘const std::function<_Res(_ArgTypes ...)>’ and ‘nod*’ 22 | if(amin==prim) | ^~~~ In file included from /usr/include/c++/13/iterator:66, from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:54: /usr/include/c++/13/bits/streambuf_iterator.h:234:5: note: candidate: ‘template<class _CharT, class _Traits> bool std::operator==(const istreambuf_iterator<_CharT, _Traits>&, const istreambuf_iterator<_CharT, _Traits>&)’ 234 | operator==(const istreambuf_iterator<_CharT, _Traits>& __a, | ^~~~~~~~ /usr/include/c++/13/bits/streambuf_iterator.h:234:5: note: template argument deduction/substitution failed: fldiadinainte.cpp:22:14: note: ‘nod’ is not derived from ‘const std::istreambuf_iterator<_CharT, _Traits>’ 22 | if(amin==prim) | ^~~~ In file included from /usr/include/c++/13/memory:78, from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:56: /usr/include/c++/13/bits/unique_ptr.h:829:5: note: candidate: ‘template<class _Tp, class _Dp, class _Up, class _Ep> bool std::operator==(const unique_ptr<_Tp, _Dp>&, const unique_ptr<_Up, _Ep>&)’ 829 | operator==(const unique_ptr<_Tp, _Dp>& __x, | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:829:5: note: template argument deduction/substitution failed: fldiadinainte.cpp:22:14: note: ‘nod’ is not derived from ‘const std::unique_ptr<_Tp, _Dp>’ 22 | if(amin==prim) | ^~~~ /usr/include/c++/13/bits/unique_ptr.h:837:5: note: candidate: ‘template<class _Tp, class _Dp> bool std::operator==(const unique_ptr<_Tp, _Dp>&, nullptr_t)’ 837 | operator==(const unique_ptr<_Tp, _Dp>& __x, nullptr_t) noexcept | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:837:5: note: template argument deduction/substitution failed: fldiadinainte.cpp:22:14: note: ‘nod’ is not derived from ‘const std::unique_ptr<_Tp, _Dp>’ 22 | if(amin==prim) | ^~~~ /usr/include/c++/13/bits/unique_ptr.h:845:5: note: candidate: ‘template<class _Tp, class _Dp> bool std::operator==(nullptr_t, const unique_ptr<_Tp, _Dp>&)’ 845 | operator==(nullptr_t, const unique_ptr<_Tp, _Dp>& __x) noexcept | ^~~~~~~~ /usr/include/c++/13/bits/unique_ptr.h:845:5: note: template argument deduction/substitution failed: fldiadinainte.cpp:22:14: note: mismatched types ‘const std::unique_ptr<_Tp, _Dp>’ and ‘nod*’ 22 | if(amin==prim) | ^~~~ In file included from /usr/include/c++/13/bits/shared_ptr.h:53, from /usr/include/c++/13/memory:80: /usr/include/c++/13/bits/shared_ptr_base.h:1793:5: note: candidate: ‘template<class _Tp1, class _Tp2, __gnu_cxx::_Lock_policy _Lp> bool std::operator==(const __shared_ptr<_Tp1, _Lp>&, const __shared_ptr<_Tp2, _Lp>&)’ 1793 | operator==(const __shared_ptr<_Tp1, _Lp>& __a, | ^~~~~~~~ /usr/include/c++/13/bits/shared_ptr_base.h:1793:5: note: template argument deduction/substitution failed: fldiadinainte.cpp:22:14: note: ‘nod’ is not derived from ‘const std::__shared_ptr<_Tp1, _Lp>’ 22 | if(amin==prim) | ^~~~ /usr/include/c++/13/bits/shared_ptr_base.h:1799:5: note: candidate: ‘template<class _Tp, __gnu_cxx::_Lock_policy _Lp> bool std::operator==(const __shared_ptr<_Tp, _Lp>&, nullptr_t)’ 1799 | operator==(const __shared_ptr<_Tp, _Lp>& __a, nullptr_t) noexcept | ^~~~~~~~ /usr/include/c++/13/bits/shared_ptr_base.h:1799:5: note: template argument deduction/substitution failed: fldiadinainte.cpp:22:14: note: ‘nod’ is not derived from ‘const std::__shared_ptr<_Tp, _Lp>’ 22 | if(amin==prim) | ^~~~ /usr/include/c++/13/bits/shared_ptr_base.h:1819:5: note: candidate: ‘template<class _Tp, __gnu_cxx::_Lock_policy _Lp> bool std::operator==(nullptr_t, const __shared_ptr<_Tp, _Lp>&)’ 1819 | operator==(nullptr_t, const __shared_ptr<_Tp, _Lp>& __a) noexcept | ^~~~~~~~ /usr/include/c++/13/bits/shared_ptr_base.h:1819:5: note: template argument deduction/substitution failed: fldiadinainte.cpp:22:14: note: mismatched types ‘const std::__shared_ptr<_Tp, _Lp>’ and ‘nod*’ 22 | if(amin==prim) | ^~~~ /usr/include/c++/13/bits/shared_ptr.h:555:5: note: candidate: ‘template<class _Tp, class _Up> bool std::operator==(const shared_ptr<_Tp>&, const shared_ptr<_Tp>&)’ 555 | operator==(const shared_ptr<_Tp>& __a, const shared_ptr<_Up>& __b) noexcept | ^~~~~~~~ /usr/include/c++/13/bits/shared_ptr.h:555:5: note: template argument deduction/substitution failed: fldiadinainte.cpp:22:14: note: ‘nod’ is not derived from ‘const std::shared_ptr<_Tp>’ 22 | if(amin==prim) | ^~~~ /usr/include/c++/13/bits/shared_ptr.h:561:5: note: candidate: ‘template<class _Tp> bool std::operator==(const shared_ptr<_Tp>&, nullptr_t)’ 561 | operator==(const shared_ptr<_Tp>& __a, nullptr_t) noexcept | ^~~~~~~~ /usr/include/c++/13/bits/shared_ptr.h:561:5: note: template argument deduction/substitution failed: fldiadinainte.cpp:22:14: note: ‘nod’ is not derived from ‘const std::shared_ptr<_Tp>’ 22 | if(amin==prim) | ^~~~ /usr/include/c++/13/bits/shared_ptr.h:582:5: note: candidate: ‘template<class _Tp> bool std::operator==(nullptr_t, const shared_ptr<_Tp>&)’ 582 | operator==(nullptr_t, const shared_ptr<_Tp>& __a) noexcept | ^~~~~~~~ /usr/include/c++/13/bits/shared_ptr.h:582:5: note: template argument deduction/substitution failed: fldiadinainte.cpp:22:14: note: mismatched types ‘const std::shared_ptr<_Tp>’ and ‘nod*’ 22 | if(amin==prim) | ^~~~ In file included from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:63: /usr/include/c++/13/array:297:5: note: candidate: ‘template<class _Tp, long unsigned int _Nm> bool std::operator==(const array<_Tp, _Nm>&, const array<_Tp, _Nm>&)’ 297 | operator==(const array<_Tp, _Nm>& __one, const array<_Tp, _Nm>& __two) | ^~~~~~~~ /usr/include/c++/13/array:297:5: note: template argument deduction/substitution failed: fldiadinainte.cpp:22:14: note: ‘nod’ is not derived from ‘const std::array<_Tp, _Nm>’ 22 | if(amin==prim) | ^~~~ In file included from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:67: /usr/include/c++/13/scoped_allocator:505:5: note: candidate: ‘template<class _OutA1, class _OutA2, class ... _InA> bool std::operator==(const scoped_allocator_adaptor<_OutA1, _InA ...>&, const scoped_allocator_adaptor<_InnerHead, _InnerTail ...>&)’ 505 | operator==(const scoped_allocator_adaptor<_OutA1, _InA...>& __a, | ^~~~~~~~ /usr/include/c++/13/scoped_allocator:505:5: note: template argument deduction/substitution failed: fldiadinainte.cpp:22:14: note: ‘nod’ is not derived from ‘const std::scoped_allocator_adaptor<_OutA1, _InA ...>’ 22 | if(amin==prim) | ^~~~ In file included from /usr/include/c++/13/ccomplex:39, from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:127: /usr/include/c++/13/complex:467:5: note: candidate: ‘template<class _Tp> constexpr bool std::operator==(const complex<_Tp>&, const complex<_Tp>&)’ 467 | operator==(const complex<_Tp>& __x, const complex<_Tp>& __y) | ^~~~~~~~ /usr/include/c++/13/complex:467:5: note: template argument deduction/substitution failed: fldiadinainte.cpp:22:14: note: ‘nod’ is not derived from ‘const std::complex<_Tp>’ 22 | if(amin==prim) | ^~~~ /usr/include/c++/13/complex:472:5: note: candidate: ‘template<class _Tp> constexpr bool std::operator==(const complex<_Tp>&, const _Tp&)’ 472 | operator==(const complex<_Tp>& __x, const _Tp& __y) | ^~~~~~~~ /usr/include/c++/13/complex:472:5: note: template argument deduction/substitution failed: fldiadinainte.cpp:22:14: note: ‘nod’ is not derived from ‘const std::complex<_Tp>’ 22 | if(amin==prim) | ^~~~ /usr/include/c++/13/complex:478:5: note: candidate: ‘template<class _Tp> constexpr bool std::operator==(const _Tp&, const complex<_Tp>&)’ 478 | operator==(const _Tp& __x, const complex<_Tp>& __y) | ^~~~~~~~ /usr/include/c++/13/complex:478:5: note: template argument deduction/substitution failed: fldiadinainte.cpp:22:14: note: mismatched types ‘const std::complex<_Tp>’ and ‘nod*’ 22 | if(amin==prim) | ^~~~ In file included from /usr/include/c++/13/deque:66, from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:139: /usr/include/c++/13/bits/stl_deque.h:2290:5: note: candidate: ‘template<class _Tp, class _Alloc> bool std::operator==(const deque<_Tp, _Alloc>&, const deque<_Tp, _Alloc>&)’ 2290 | operator==(const deque<_Tp, _Alloc>& __x, const deque<_Tp, _Alloc>& __y) | ^~~~~~~~ /usr/include/c++/13/bits/stl_deque.h:2290:5: note: template argument deduction/substitution failed: fldiadinainte.cpp:22:14: note: ‘nod’ is not derived from ‘const std::deque<_Tp, _Alloc>’ 22 | if(amin==prim) | ^~~~ In file included from /usr/include/c++/13/list:65, from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:150: /usr/include/c++/13/bits/stl_list.h:2123:5: note: candidate: ‘template<class _Tp, class _Alloc> bool std::operator==(const __cxx11::list<_Tp, _Alloc>&, const __cxx11::list<_Tp, _Alloc>&)’ 2123 | operator==(const list<_Tp, _Alloc>& __x, const list<_Tp, _Alloc>& __y) | ^~~~~~~~ /usr/include/c++/13/bits/stl_list.h:2123:5: note: template argument deduction/substitution failed: fldiadinainte.cpp:22:14: note: ‘nod’ is not derived from ‘const std::__cxx11::list<_Tp, _Alloc>’ 22 | if(amin==prim) | ^~~~ In file included from /usr/include/c++/13/map:63, from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:152: /usr/include/c++/13/bits/stl_map.h:1513:5: note: candidate: ‘template<class _Key, class _Tp, class _Compare, class _Alloc> bool std::operator==(const map<_Key, _Tp, _Compare, _Alloc>&, const map<_Key, _Tp, _Compare, _Alloc>&)’ 1513 | operator==(const map<_Key, _Tp, _Compare, _Alloc>& __x, | ^~~~~~~~ /usr/include/c++/13/bits/stl_map.h:1513:5: note: template argument deduction/substitution failed: fldiadinainte.cpp:22:14: note: ‘nod’ is not derived from ‘const std::map<_Key, _Tp, _Compare, _Alloc>’ 22 | if(amin==prim) | ^~~~ In file included from /usr/include/c++/13/map:64: /usr/include/c++/13/bits/stl_multimap.h:1134:5: note: candidate: ‘template<class _Key, class _Tp, class _Compare, class _Alloc> bool std::operator==(const multimap<_Key, _Tp, _Compare, _Alloc>&, const multimap<_Key, _Tp, _Compare, _Alloc>&)’ 1134 | operator==(const multimap<_Key, _Tp, _Compare, _Alloc>& __x, | ^~~~~~~~ /usr/include/c++/13/bits/stl_multimap.h:1134:5: note: template argument deduction/substitution failed: fldiadinainte.cpp:22:14: note: ‘nod’ is not derived from ‘const std::multimap<_Key, _Tp, _Compare, _Alloc>’ 22 | if(amin==prim) | ^~~~ In file included from /usr/include/c++/13/vector:66, from /usr/include/c++/13/queue:63, from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:157: /usr/include/c++/13/bits/stl_vector.h:2040:5: note: candidate: ‘template<class _Tp, class _Alloc> bool std::operator==(const vector<_Tp, _Alloc>&, const vector<_Tp, _Alloc>&)’ 2040 | operator==(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y) | ^~~~~~~~ /usr/include/c++/13/bits/stl_vector.h:2040:5: note: template argument deduction/substitution failed: fldiadinainte.cpp:22:14: note: ‘nod’ is not derived from ‘const std::vector<_Tp, _Alloc>’ 22 | if(amin==prim) | ^~~~ In file included from /usr/include/c++/13/queue:66: /usr/include/c++/13/bits/stl_queue.h:380:5: note: candidate: ‘template<class _Tp, class _Seq> bool std::operator==(const queue<_Tp, _Seq>&, const queue<_Tp, _Seq>&)’ 380 | operator==(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y) | ^~~~~~~~ /usr/include/c++/13/bits/stl_queue.h:380:5: note: template argument deduction/substitution failed: fldiadinainte.cpp:22:14: note: ‘nod’ is not derived from ‘const std::queue<_Tp, _Seq>’ 22 | if(amin==prim) | ^~~~ In file included from /usr/include/c++/13/set:63, from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:158: /usr/include/c++/13/bits/stl_set.h:987:5: note: candidate: ‘template<class _Key, class _Compare, class _Alloc> bool std::operator==(const set<_Key, _Compare, _Alloc>&, const set<_Key, _Compare, _Alloc>&)’ 987 | operator==(const set<_Key, _Compare, _Alloc>& __x, | ^~~~~~~~ /usr/include/c++/13/bits/stl_set.h:987:5: note: template argument deduction/substitution failed: fldiadinainte.cpp:22:14: note: ‘nod’ is not derived from ‘const std::set<_Key, _Compare, _Alloc>’ 22 | if(amin==prim) | ^~~~ In file included from /usr/include/c++/13/set:64: /usr/include/c++/13/bits/stl_multiset.h:973:5: note: candidate: ‘template<class _Key, class _Compare, class _Alloc> bool std::operator==(const multiset<_Key, _Compare, _Alloc>&, const multiset<_Key, _Compare, _Alloc>&)’ 973 | operator==(const multiset<_Key, _Compare, _Alloc>& __x, | ^~~~~~~~ /usr/include/c++/13/bits/stl_multiset.h:973:5: note: template argument deduction/substitution failed: fldiadinainte.cpp:22:14: note: ‘nod’ is not derived from ‘const std::multiset<_Key, _Compare, _Alloc>’ 22 | if(amin==prim) | ^~~~ In file included from /usr/include/c++/13/stack:63, from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:160: /usr/include/c++/13/bits/stl_stack.h:356:5: note: candidate: ‘template<class _Tp, class _Seq> bool std::operator==(const stack<_Tp, _Seq>&, const stack<_Tp, _Seq>&)’ 356 | operator==(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y) | ^~~~~~~~ /usr/include/c++/13/bits/stl_stack.h:356:5: note: template argument deduction/substitution failed: fldiadinainte.cpp:22:14: note: ‘nod’ is not derived from ‘const std::stack<_Tp, _Seq>’ 22 | if(amin==prim) | ^~~~ In file included from /usr/include/c++/13/valarray:605, from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:166: /usr/include/c++/13/bits/valarray_after.h:417:5: note: candidate: ‘template<class _Dom1, class _Dom2> std::_Expr<std::__detail::_BinClos<std::__equal_to, std::_Expr, std::_Expr, _Dom1, _Dom2>, typename std::__fun<std::__equal_to, typename _Dom1::value_type>::result_type> std::operator==(const _Expr<_Dom1, typename _Dom1::value_type>&, const _Expr<_Dom2, typename _Dom2::value_type>&)’ 417 | _DEFINE_EXPR_BINARY_OPERATOR(==, struct std::__equal_to) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13/bits/valarray_after.h:417:5: note: template argument deduction/substitution failed: fldiadinainte.cpp:22:14: note: ‘nod’ is not derived from ‘const std::_Expr<_Dom1, typename _Dom1::value_type>’ 22 | if(amin==prim) | ^~~~ /usr/include/c++/13/bits/valarray_after.h:417:5: note: candidate: ‘template<class _Dom> std::_Expr<std::__detail::_BinClos<std::__equal_to, std::_Expr, std::_Constant, _Dom, typename _Dom::value_type>, typename std::__fun<std::__equal_to, typename _Dom1::value_type>::result_type> std::operator==(const _Expr<_Dom1, typename _Dom1::value_type>&, const typename _Dom::value_type&)’ 417 | _DEFINE_EXPR_BINARY_OPERATOR(==, struct std::__equal_to) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13/bits/valarray_after.h:417:5: note: template argument deduction/substitution failed: fldiadinainte.cpp:22:14: note: ‘nod’ is not derived from ‘const std::_Expr<_Dom1, typename _Dom1::value_type>’ 22 | if(amin==prim) | ^~~~ /usr/include/c++/13/bits/valarray_after.h:417:5: note: candidate: ‘template<class _Dom> std::_Expr<std::__detail::_BinClos<std::__equal_to, std::_Constant, std::_Expr, typename _Dom::value_type, _Dom>, typename std::__fun<std::__equal_to, typename _Dom1::value_type>::result_type> std::operator==(const typename _Dom::value_type&, const _Expr<_Dom1, typename _Dom1::value_type>&)’ 417 | _DEFINE_EXPR_BINARY_OPERATOR(==, struct std::__equal_to) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13/bits/valarray_after.h:417:5: note: template argument deduction/substitution failed: fldiadinainte.cpp:22:14: note: mismatched types ‘const std::_Expr<_Dom1, typename _Dom1::value_type>’ and ‘nod*’ 22 | if(amin==prim) | ^~~~ /usr/include/c++/13/bits/valarray_after.h:417:5: note: candidate: ‘template<class _Dom> std::_Expr<std::__detail::_BinClos<std::__equal_to, std::_Expr, std::_ValArray, _Dom, typename _Dom::value_type>, typename std::__fun<std::__equal_to, typename _Dom1::value_type>::result_type> std::operator==(const _Expr<_Dom1, typename _Dom1::value_type>&, const valarray<typename _Dom::value_type>&)’ 417 | _DEFINE_EXPR_BINARY_OPERATOR(==, struct std::__equal_to) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13/bits/valarray_after.h:417:5: note: template argument deduction/substitution failed: fldiadinainte.cpp:22:14: note: ‘nod’ is not derived from ‘const std::_Expr<_Dom1, typename _Dom1::value_type>’ 22 | if(amin==prim) | ^~~~ /usr/include/c++/13/bits/valarray_after.h:417:5: note: candidate: ‘template<class _Dom> std::_Expr<std::__detail::_BinClos<std::__equal_to, std::_ValArray, std::_Expr, typename _Dom::value_type, _Dom>, typename std::__fun<std::__equal_to, typename _Dom1::value_type>::result_type> std::operator==(const valarray<typename _Dom::value_type>&, const _Expr<_Dom1, typename _Dom1::value_type>&)’ 417 | _DEFINE_EXPR_BINARY_OPERATOR(==, struct std::__equal_to) | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13/bits/valarray_after.h:417:5: note: template argument deduction/substitution failed: fldiadinainte.cpp:22:14: note: mismatched types ‘const std::_Expr<_Dom1, typename _Dom1::value_type>’ and ‘nod*’ 22 | if(amin==prim) | ^~~~ /usr/include/c++/13/valarray:1208:1: note: candidate: ‘template<class _Tp> std::_Expr<std::__detail::_BinClos<std::__equal_to, std::_ValArray, std::_ValArray, _Tp, _Tp>, typename std::__fun<std::__equal_to, _Tp>::result_type> std::operator==(const valarray<_Tp>&, const valarray<_Tp>&)’ 1208 | _DEFINE_BINARY_OPERATOR(==, __equal_to) | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13/valarray:1208:1: note: template argument deduction/substitution failed: fldiadinainte.cpp:22:14: note: ‘nod’ is not derived from ‘const std::valarray<_Tp>’ 22 | if(amin==prim) | ^~~~ /usr/include/c++/13/valarray:1208:1: note: candidate: ‘template<class _Tp> std::_Expr<std::__detail::_BinClos<std::__equal_to, std::_ValArray, std::_Constant, _Tp, _Tp>, typename std::__fun<std::__equal_to, _Tp>::result_type> std::operator==(const valarray<_Tp>&, const typename valarray<_Tp>::value_type&)’ 1208 | _DEFINE_BINARY_OPERATOR(==, __equal_to) | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13/valarray:1208:1: note: template argument deduction/substitution failed: fldiadinainte.cpp:22:14: note: ‘nod’ is not derived from ‘const std::valarray<_Tp>’ 22 | if(amin==prim) | ^~~~ /usr/include/c++/13/valarray:1208:1: note: candidate: ‘template<class _Tp> std::_Expr<std::__detail::_BinClos<std::__equal_to, std::_Constant, std::_ValArray, _Tp, _Tp>, typename std::__fun<std::__equal_to, _Tp>::result_type> std::operator==(const typename valarray<_Tp>::value_type&, const valarray<_Tp>&)’ 1208 | _DEFINE_BINARY_OPERATOR(==, __equal_to) | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/13/valarray:1208:1: note: template argument deduction/substitution failed: fldiadinainte.cpp:22:14: note: mismatched types ‘const std::valarray<_Tp>’ and ‘nod*’ 22 | if(amin==prim) | ^~~~ In file included from /usr/include/c++/13/forward_list:42, from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:175: /usr/include/c++/13/bits/forward_list.tcc:393:5: note: candidate: ‘template<class _Tp, class _Alloc> bool std::operator==(const forward_list<_Tp, _Alloc>&, const forward_list<_Tp, _Alloc>&)’ 393 | operator==(const forward_list<_Tp, _Alloc>& __lx, | ^~~~~~~~ /usr/include/c++/13/bits/forward_list.tcc:393:5: note: template argument deduction/substitution failed: fldiadinainte.cpp:22:14: note: ‘nod’ is not derived from ‘const std::forward_list<_Tp, _Alloc>’ 22 | if(amin==prim) | ^~~~ In file included from /usr/include/c++/13/random:53, from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:179: /usr/include/c++/13/bits/random.tcc:1908:5: note: candidate: ‘template<class _RealType1> bool std::operator==(const normal_distribution<_RealType>&, const normal_distribution<_RealType>&)’ 1908 | operator==(const std::normal_distribution<_RealType>& __d1, | ^~~~~~~~ /usr/include/c++/13/bits/random.tcc:1908:5: note: template argument deduction/substitution failed: fldiadinainte.cpp:22:14: note: ‘nod’ is not derived from ‘const std::normal_distribution<_RealType>’ 22 | if(amin==prim) | ^~~~ In file included from /usr/include/c++/13/unordered_map:41, from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:188: /usr/include/c++/13/bits/unordered_map.h:2143:5: note: candidate: ‘template<class _Key, class _Tp, class _Hash, class _Pred, class _Alloc> bool std::operator==(const unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>&, const unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>&)’ 2143 | operator==(const unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __x, | ^~~~~~~~ /usr/include/c++/13/bits/unordered_map.h:2143:5: note: template argument deduction/substitution failed: fldiadinainte.cpp:22:14: note: ‘nod’ is not derived from ‘const std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>’ 22 | if(amin==prim) | ^~~~ /usr/include/c++/13/bits/unordered_map.h:2157:5: note: candidate: ‘template<class _Key, class _Tp, class _Hash, class _Pred, class _Alloc> bool std::operator==(const unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>&, const unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>&)’ 2157 | operator==(const unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __x, | ^~~~~~~~ /usr/include/c++/13/bits/unordered_map.h:2157:5: note: template argument deduction/substitution failed: fldiadinainte.cpp:22:14: note: ‘nod’ is not derived from ‘const std::unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>’ 22 | if(amin==prim) | ^~~~ In file included from /usr/include/c++/13/unordered_set:41, from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:189: /usr/include/c++/13/bits/unordered_set.h:1813:5: note: candidate: ‘template<class _Value, class _Hash, class _Pred, class _Alloc> bool std::operator==(const unordered_set<_Value, _Hash, _Pred, _Alloc>&, const unordered_set<_Value, _Hash, _Pred, _Alloc>&)’ 1813 | operator==(const unordered_set<_Value, _Hash, _Pred, _Alloc>& __x, | ^~~~~~~~ /usr/include/c++/13/bits/unordered_set.h:1813:5: note: template argument deduction/substitution failed: fldiadinainte.cpp:22:14: note: ‘nod’ is not derived from ‘const std::unordered_set<_Value, _Hash, _Pred, _Alloc>’ 22 | if(amin==prim) | ^~~~ /usr/include/c++/13/bits/unordered_set.h:1827:5: note: candidate: ‘template<class _Value, class _Hash, class _Pred, class _Alloc> bool std::operator==(const unordered_multiset<_Value, _Hash, _Pred, _Alloc>&, const unordered_multiset<_Value, _Hash, _Pred, _Alloc>&)’ 1827 | operator==(const unordered_multiset<_Value, _Hash, _Pred, _Alloc>& __x, | ^~~~~~~~ /usr/include/c++/13/bits/unordered_set.h:1827:5: note: template argument deduction/substitution failed: fldiadinainte.cpp:22:14: note: ‘nod’ is not derived from ‘const std::unordered_multiset<_Value, _Hash, _Pred, _Alloc>’ 22 | if(amin==prim) | ^~~~ In file included from /usr/include/c++/13/bits/ios_base.h:46, from /usr/include/c++/13/streambuf:43, from /usr/include/c++/13/bits/streambuf_iterator.h:35: /usr/include/c++/13/system_error:449:3: note: candidate: ‘bool std::operator==(const error_code&, const error_code&)’ 449 | operator==(const error_code& __lhs, const error_code& __rhs) noexcept | ^~~~~~~~ /usr/include/c++/13/system_error:449:32: note: no known conversion for argument 1 from ‘nod’ to ‘const std::error_code&’ 449 | operator==(const error_code& __lhs, const error_code& __rhs) noexcept | ~~~~~~~~~~~~~~~~~~^~~~~ /usr/include/c++/13/system_error:465:3: note: candidate: ‘bool std::operator==(const error_code&, const error_condition&)’ 465 | operator==(const error_code& __lhs, const error_condition& __rhs) noexcept | ^~~~~~~~ /usr/include/c++/13/system_error:465:32: note: no known conversion for argument 1 from ‘nod’ to ‘const std::error_code&’ 465 | operator==(const error_code& __lhs, const error_condition& __rhs) noexcept | ~~~~~~~~~~~~~~~~~~^~~~~ /usr/include/c++/13/system_error:480:3: note: candidate: ‘bool std::operator==(const error_condition&, const error_condition&)’ 480 | operator==(const error_condition& __lhs, | ^~~~~~~~ /usr/include/c++/13/system_error:480:37: note: no known conversion for argument 1 from ‘nod’ to ‘const std::error_condition&’ 480 | operator==(const error_condition& __lhs, | ~~~~~~~~~~~~~~~~~~~~~~~^~~~~ /usr/include/c++/13/system_error:517:3: note: candidate: ‘bool std::operator==(const error_condition&, const error_code&)’ 517 | operator==(const error_condition& __lhs, const error_code& __rhs) noexcept | ^~~~~~~~ /usr/include/c++/13/system_error:517:37: note: no known conversion for argument 1 from ‘nod’ to ‘const std::error_condition&’ 517 | operator==(const error_condition& __lhs, const error_code& __rhs) noexcept | ~~~~~~~~~~~~~~~~~~~~~~~^~~~~ In file included from /usr/include/c++/13/future:51, from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:176: /usr/include/c++/13/bits/std_thread.h:324:3: note: candidate: ‘bool std::operator==(thread::id, thread::id)’ 324 | operator==(thread::id __x, thread::id __y) noexcept | ^~~~~~~~ /usr/include/c++/13/bits/std_thread.h:324:25: note: no known conversion for argument 1 from ‘nod’ to ‘std::thread::id’ 324 | operator==(thread::id __x, thread::id __y) noexcept | ~~~~~~~~~~~^~~ fldiadinainte.cpp:33:20: error: base operand of ‘->’ has non-pointer type ‘nod’ 33 | q->ant=amin->ant; | ^~ fldiadinainte.cpp:34:17: error: cannot convert ‘nod’ to ‘nod*’ in assignment 34 | q->urm =amin; | ^~~~ | | | nod fldiadinainte.cpp:35:13: error: base operand of ‘->’ has non-pointer type ‘nod’ 35 | amin->ant=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 FLdiAdInainte 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ă.