Rezumat problemă

stergere2

#4385

Se dă un vector cu n elemente numere naturale. Să se șteargă din vector toate elementele egale cu cea mai mică valoare din vector.

Consola Candale Silviu (silviu) medie

Clasa 9 Tablouri unidimensionale (vectori) Ștergeri și inserări de elemente în vectori

Rezolvă

Detalii

Problema	stergere2	Operații I/O	tastatură/ecran
Limita timp	0.1 secunde	Limita memorie	Total: 64 MB / Stivă 8 MB
Id soluție	#56297524	Utilizator	Albita Maria Luiza (albitaluiza27)
Fișier	stergere2.cpp	Dimensiune	337 B
Data încărcării	12 Februarie 2025, 23:02	Scor / rezultat	Eroare de compilare

Evaluare

Mesaj compilare

stergere2.cpp: In function 'int main()':
stergere2.cpp:8:14: warning: left operand of comma operator has no effect [-Wunused-value]
     for(i=0;i<n,i++)cin>>x[i];

              ^
stergere2.cpp:8:20: error: expected ';' before ')' token
     for(i=0;i<n,i++)cin>>x[i];

                    ^
stergere2.cpp:10:10: error: reference to 'min' is ambiguous
     x[i]=min;

          ^
stergere2.cpp:3:20: note: candidates are: unsigned int min
 unsigned int p,n,i,min;

                    ^
In file included from /usr/include/c++/4.8/bits/char_traits.h:39:0,
                 from /usr/include/c++/4.8/ios:40,
                 from /usr/include/c++/4.8/ostream:38,
                 from /usr/include/c++/4.8/iostream:39,
                 from stergere2.cpp:1:
/usr/include/c++/4.8/bits/stl_algobase.h:239:5: note:                 template<class _Tp, class _Compare> const _Tp& std::min(const _Tp&, const _Tp&, _Compare)
     min(const _Tp& __a, const _Tp& __b, _Compare __comp)
     ^
/usr/include/c++/4.8/bits/stl_algobase.h:193:5: note:                 template<class _Tp> const _Tp& std::min(const _Tp&, const _Tp&)
     min(const _Tp& __a, const _Tp& __b)
     ^
stergere2.cpp:11:19: warning: operation on 'i' may be undefined [-Wsequence-point]
     if(x[i]>x[i++])

                   ^
stergere2.cpp:12:9: error: reference to 'min' is ambiguous
         min=x[i++];

         ^
stergere2.cpp:3:20: note: candidates are: unsigned int min
 unsigned int p,n,i,min;

                    ^
In file included from /usr/include/c++/4.8/bits/char_traits.h:39:0,
                 from /usr/include/c++/4.8/ios:40,
                 from /usr/include/c++/4.8/ostream:38,
                 from /usr/include/c++/4.8/iostream:39,
                 from stergere2.cpp:1:
/usr/include/c++/4.8/bits/stl_algobase.h:239:5: note:                 template<class _Tp, class _Compare> const _Tp& std::min(const _Tp&, const _Tp&, _Compare)
     min(const _Tp& __a, const _Tp& __b, _Compare __comp)
     ^
/usr/include/c++/4.8/bits/stl_algobase.h:193:5: note:                 template<class _Tp> const _Tp& std::min(const _Tp&, const _Tp&)
     min(const _Tp& __a, const _Tp& __b)
     ^
stergere2.cpp:13:8: error: reference to 'min' is ambiguous
     if(min=x[i])

        ^
stergere2.cpp:3:20: note: candidates are: unsigned int min
 unsigned int p,n,i,min;

                    ^
In file included from /usr/include/c++/4.8/bits/char_traits.h:39:0,
                 from /usr/include/c++/4.8/ios:40,
                 from /usr/include/c++/4.8/ostream:38,
                 from /usr/include/c++/4.8/iostream:39,
                 from stergere2.cpp:1:
/usr/include/c++/4.8/bits/stl_algobase.h:239:5: note:                 template<class _Tp, class _Compare> const _Tp& std::min(const _Tp&, const _Tp&, _Compare)
     min(const _Tp& __a, const _Tp& __b, _Compare __comp)
     ^
/usr/include/c++/4.8/bits/stl_algobase.h:193:5: note:                 template<class _Tp> const _Tp& std::min(const _Tp&, const _Tp&)
     min(const _Tp& __a, const _Tp& __b)
     ^
stergere2.cpp:14:39: warning: operation on 'i' may be undefined [-Wsequence-point]
         for(i=p;i<n-1;i++) x[i]=x[i++];

                                       ^

Cum funcționează evaluarea?