#3156
perm_min_max
Se citește o mulțime cu n
numere naturale. Afișați în ordine lexicografică toate permutările mulțimii citite în care elementul minim și cel maxim nu își schimbă poziția.
Problema | perm_min_max | Operații I/O | tastatură/ecran |
---|---|---|---|
Limita timp | 0.1 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
Id soluție | #42496847 | Utilizator | |
Fișier | perm_min_max.cpp | Dimensiune | 1.21 KB |
Data încărcării | 08 Martie 2023, 09:34 | Scor / rezultat | Eroare de compilare |
perm_min_max.cpp: In function 'void mini()': perm_min_max.cpp:13:17: error: reference to 'min' is ambiguous if(v[i]<min) ^ perm_min_max.cpp:3:16: note: candidates are: int min int x[100], n, min=1000000000, p1, p2, v[15], max=0; ^ 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 perm_min_max.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) ^ perm_min_max.cpp:15:9: error: reference to 'min' is ambiguous min=v[i]; ^ perm_min_max.cpp:3:16: note: candidates are: int min int x[100], n, min=1000000000, p1, p2, v[15], max=0; ^ 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 perm_min_max.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) ^ perm_min_max.cpp: In function 'void maxi()': perm_min_max.cpp:22:17: error: reference to 'max' is ambiguous if(v[i]>max) ^ perm_min_max.cpp:3:47: note: candidates are: int max int x[100], n, min=1000000000, p1, p2, v[15], max=0; ^ 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 perm_min_max.cpp:1: /usr/include/c++/4.8/bits/stl_algobase.h:260:5: note: template<class _Tp, class _Compare> const _Tp& std::max(const _Tp&, const _Tp&, _Compare) max(const _Tp& __a, const _Tp& __b, _Compare __comp) ^ /usr/include/c++/4.8/bits/stl_algobase.h:216:5: note: template<class _Tp> const _Tp& std::max(const _Tp&, const _Tp&) max(const _Tp& __a, const _Tp& __b) ^ perm_min_max.cpp:24:9: error: reference to 'max' is ambiguous max=v[i]; ^ perm_min_max.cpp:3:47: note: candidates are: int max int x[100], n, min=1000000000, p1, p2, v[15], max=0; ^ 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 perm_min_max.cpp:1: /usr/include/c++/4.8/bits/stl_algobase.h:260:5: note: template<class _Tp, class _Compare> const _Tp& std::max(const _Tp&, const _Tp&, _Compare) max(const _Tp& __a, const _Tp& __b, _Compare __comp) ^ /usr/include/c++/4.8/bits/stl_algobase.h:216:5: note: template<class _Tp> const _Tp& std::max(const _Tp&, const _Tp&) max(const _Tp& __a, const _Tp& __b) ^ perm_min_max.cpp: In function 'bool valid(int)': perm_min_max.cpp:39:18: warning: suggest parentheses around '&&' within '||' [-Wparentheses] if(k==p1 && x[k]!=p1 || k==p2 && x[k]!= p2) ^ perm_min_max.cpp: In function 'void Back(int)': perm_min_max.cpp:52:11: warning: suggest explicit braces to avoid ambiguous 'else' [-Wparentheses] if(valid(k)) ^
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema perm_min_max face parte din prima categorie. Soluția propusă de tine va fi evaluată astfel:
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ă.