Acest site foloseşte cookies. Navigând în continuare, vă exprimaţi acordul asupra folosirii cookie-urilor.
Detalii evaluare #64215049
Rezumat problemă
#3161
Se citește o multime cu n numere naturale. Afișați toate permutările mulțimii citite în care elementul minim nu își schimbă poziția.
Muresan Ciprian (mcip1977) Detalii
| Problema | permutari5 | Operații I/O |
 tastatură/ecran
|
|---|---|---|---|
| Limita timp | 0.1 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
| Id soluție | #64215049 | Utilizator |
Afilipoae Teodor (Afilipoae_Teodor)
|
| Fișier | permutari5.cpp | Dimensiune | 1.12 KB |
| Data încărcării | 23 Aprilie 2026, 11:34 | Scor/rezultat | Eroare de compilare |
Evaluare
Mesaj compilare
permutari5.cpp: In function ‘int OK(int)’: permutari5.cpp:18:21: error: reference to ‘min’ is ambiguous 18 | {if(v[stiva[imin]]!=min){ | ^~~ In file included from /usr/include/c++/13/algorithm:61, from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:51, from permutari5.cpp:1: /usr/include/c++/13/bits/stl_algo.h:5785:5: note: candidates are: ‘template<class _Tp, class _Compare> _Tp std::min(initializer_list<_Tp>, _Compare)’ 5785 | min(initializer_list<_Tp> __l, _Compare __comp) | ^~~ /usr/include/c++/13/bits/stl_algo.h:5775:5: note: ‘template<class _Tp> _Tp std::min(initializer_list<_Tp>)’ 5775 | min(initializer_list<_Tp> __l) | ^~~ In file included from /usr/include/c++/13/algorithm:60: /usr/include/c++/13/bits/stl_algobase.h:281:5: note: ‘template<class _Tp, class _Compare> const _Tp& std::min(const _Tp&, const _Tp&, _Compare)’ 281 | min(const _Tp& __a, const _Tp& __b, _Compare __comp) | ^~~ /usr/include/c++/13/bits/stl_algobase.h:233:5: note: ‘template<class _Tp> const _Tp& std::min(const _Tp&, const _Tp&)’ 233 | min(const _Tp& __a, const _Tp& __b) | ^~~ permutari5.cpp:11:5: note: ‘int min’ 11 | int min; | ^~~ permutari5.cpp: In function ‘int main()’: permutari5.cpp:63:1: error: reference to ‘min’ is ambiguous 63 | min=1000000001; | ^~~ /usr/include/c++/13/bits/stl_algo.h:5785:5: note: candidates are: ‘template<class _Tp, class _Compare> _Tp std::min(initializer_list<_Tp>, _Compare)’ 5785 | min(initializer_list<_Tp> __l, _Compare __comp) | ^~~ /usr/include/c++/13/bits/stl_algo.h:5775:5: note: ‘template<class _Tp> _Tp std::min(initializer_list<_Tp>)’ 5775 | min(initializer_list<_Tp> __l) | ^~~ /usr/include/c++/13/bits/stl_algobase.h:281:5: note: ‘template<class _Tp, class _Compare> const _Tp& std::min(const _Tp&, const _Tp&, _Compare)’ 281 | min(const _Tp& __a, const _Tp& __b, _Compare __comp) | ^~~ /usr/include/c++/13/bits/stl_algobase.h:233:5: note: ‘template<class _Tp> const _Tp& std::min(const _Tp&, const _Tp&)’ 233 | min(const _Tp& __a, const _Tp& __b) | ^~~ permutari5.cpp:11:5: note: ‘int min’ 11 | int min; | ^~~ permutari5.cpp:67:9: error: reference to ‘min’ is ambiguous 67 | if(v[i]<min) | ^~~ /usr/include/c++/13/bits/stl_algo.h:5785:5: note: candidates are: ‘template<class _Tp, class _Compare> _Tp std::min(initializer_list<_Tp>, _Compare)’ 5785 | min(initializer_list<_Tp> __l, _Compare __comp) | ^~~ /usr/include/c++/13/bits/stl_algo.h:5775:5: note: ‘template<class _Tp> _Tp std::min(initializer_list<_Tp>)’ 5775 | min(initializer_list<_Tp> __l) | ^~~ /usr/include/c++/13/bits/stl_algobase.h:281:5: note: ‘template<class _Tp, class _Compare> const _Tp& std::min(const _Tp&, const _Tp&, _Compare)’ 281 | min(const _Tp& __a, const _Tp& __b, _Compare __comp) | ^~~ /usr/include/c++/13/bits/stl_algobase.h:233:5: note: ‘template<class _Tp> const _Tp& std::min(const _Tp&, const _Tp&)’ 233 | min(const _Tp& __a, const _Tp& __b) | ^~~ permutari5.cpp:11:5: note: ‘int min’ 11 | int min; | ^~~ permutari5.cpp:68:3: error: reference to ‘min’ is ambiguous 68 | { min=v[i]; | ^~~ /usr/include/c++/13/bits/stl_algo.h:5785:5: note: candidates are: ‘template<class _Tp, class _Compare> _Tp std::min(initializer_list<_Tp>, _Compare)’ 5785 | min(initializer_list<_Tp> __l, _Compare __comp) | ^~~ /usr/include/c++/13/bits/stl_algo.h:5775:5: note: ‘template<class _Tp> _Tp std::min(initializer_list<_Tp>)’ 5775 | min(initializer_list<_Tp> __l) | ^~~ /usr/include/c++/13/bits/stl_algobase.h:281:5: note: ‘template<class _Tp, class _Compare> const _Tp& std::min(const _Tp&, const _Tp&, _Compare)’ 281 | min(const _Tp& __a, const _Tp& __b, _Compare __comp) | ^~~ /usr/include/c++/13/bits/stl_algobase.h:233:5: note: ‘template<class _Tp> const _Tp& std::min(const _Tp&, const _Tp&)’ 233 | min(const _Tp& __a, const _Tp& __b) | ^~~ permutari5.cpp:11:5: note: ‘int min’ 11 | int min; | ^~~ permutari5.cpp:77:21: error: reference to ‘min’ is ambiguous 77 | if(v[i]>v[j]&&v[i]!=min&&v[j]!=min) swap(v[i],v[j]); | ^~~ /usr/include/c++/13/bits/stl_algo.h:5785:5: note: candidates are: ‘template<class _Tp, class _Compare> _Tp std::min(initializer_list<_Tp>, _Compare)’ 5785 | min(initializer_list<_Tp> __l, _Compare __comp) | ^~~ /usr/include/c++/13/bits/stl_algo.h:5775:5: note: ‘template<class _Tp> _Tp std::min(initializer_list<_Tp>)’ 5775 | min(initializer_list<_Tp> __l) | ^~~ /usr/include/c++/13/bits/stl_algobase.h:281:5: note: ‘template<class _Tp, class _Compare> const _Tp& std::min(const _Tp&, const _Tp&, _Compare)’ 281 | min(const _Tp& __a, const _Tp& __b, _Compare __comp) | ^~~ /usr/include/c++/13/bits/stl_algobase.h:233:5: note: ‘template<class _Tp> const _Tp& std::min(const _Tp&, const _Tp&)’ 233 | min(const _Tp& __a, const _Tp& __b) | ^~~ permutari5.cpp:11:5: note: ‘int min’ 11 | int min; | ^~~ permutari5.cpp:77:32: error: reference to ‘min’ is ambiguous 77 | if(v[i]>v[j]&&v[i]!=min&&v[j]!=min) swap(v[i],v[j]); | ^~~ /usr/include/c++/13/bits/stl_algo.h:5785:5: note: candidates are: ‘template<class _Tp, class _Compare> _Tp std::min(initializer_list<_Tp>, _Compare)’ 5785 | min(initializer_list<_Tp> __l, _Compare __comp) | ^~~ /usr/include/c++/13/bits/stl_algo.h:5775:5: note: ‘template<class _Tp> _Tp std::min(initializer_list<_Tp>)’ 5775 | min(initializer_list<_Tp> __l) | ^~~ /usr/include/c++/13/bits/stl_algobase.h:281:5: note: ‘template<class _Tp, class _Compare> const _Tp& std::min(const _Tp&, const _Tp&, _Compare)’ 281 | min(const _Tp& __a, const _Tp& __b, _Compare __comp) | ^~~ /usr/include/c++/13/bits/stl_algobase.h:233:5: note: ‘template<class _Tp> const _Tp& std::min(const _Tp&, const _Tp&)’ 233 | min(const _Tp& __a, const _Tp& __b) | ^~~ permutari5.cpp:11:5: note: ‘int min’ 11 | int min; | ^~~
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 permutari5 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ă.