#3909
Permutari6
Se citesc două numere a
și b
. Să se afișeze, în ordine lexicografică, permutările mulțimii {a, a + 1, ..., b}
.
Problema | Permutari6 | Operații I/O |
![]() |
---|---|---|---|
Limita timp | 0.5 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
Id soluție | #51342360 | Utilizator | |
Fișier | permutari6.cpp | Dimensiune | 1.64 KB |
Data încărcării | 09 Iunie 2024, 09:05 | Scor / rezultat | Eroare de compilare |
permutari6.cpp: In function 'void bubbleSort(int*, int, int)': permutari6.cpp:48:49: error: no matching function for call to 'swap(bool)' swap(matrice[j] > matrice[j + 1]) ^ permutari6.cpp:48:49: note: candidates are: permutari6.cpp:6:6: note: void swap(int&, int&) void swap(int &x, int &y) ^ permutari6.cpp:6:6: note: candidate expects 2 arguments, 1 provided In file included from /usr/include/c++/4.8/string:52:0, from /usr/include/c++/4.8/bits/locale_classes.h:40, from /usr/include/c++/4.8/bits/ios_base.h:41, from /usr/include/c++/4.8/ios:42, from /usr/include/c++/4.8/ostream:38, from /usr/include/c++/4.8/iostream:39, from permutari6.cpp:1: /usr/include/c++/4.8/bits/basic_string.h:2717:5: note: template<class _CharT, class _Traits, class _Alloc> void std::swap(std::basic_string<_CharT, _Traits, _Alloc>&, std::basic_string<_CharT, _Traits, _Alloc>&) swap(basic_string<_CharT, _Traits, _Alloc>& __lhs, ^ /usr/include/c++/4.8/bits/basic_string.h:2717:5: note: template argument deduction/substitution failed: permutari6.cpp:48:49: note: mismatched types 'std::basic_string<_CharT, _Traits, _Alloc>' and 'bool' swap(matrice[j] > matrice[j + 1]) ^ In file included from /usr/include/c++/4.8/bits/stl_algobase.h:64:0, from /usr/include/c++/4.8/bits/char_traits.h:39, 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 permutari6.cpp:1: /usr/include/c++/4.8/bits/stl_pair.h:254:5: note: template<class _T1, class _T2> void std::swap(std::pair<_T1, _T2>&, std::pair<_T1, _T2>&) swap(pair<_T1, _T2>& __x, pair<_T1, _T2>& __y) ^ /usr/include/c++/4.8/bits/stl_pair.h:254:5: note: template argument deduction/substitution failed: permutari6.cpp:48:49: note: mismatched types 'std::pair<_T1, _T2>' and 'bool' swap(matrice[j] > matrice[j + 1]) ^ In file included from /usr/include/c++/4.8/bits/stl_pair.h:59:0, from /usr/include/c++/4.8/bits/stl_algobase.h:64, from /usr/include/c++/4.8/bits/char_traits.h:39, 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 permutari6.cpp:1: /usr/include/c++/4.8/bits/move.h:185:5: note: template<class _Tp, unsigned int _Nm> void std::swap(_Tp (&)[_Nm], _Tp (&)[_Nm]) swap(_Tp (&__a)[_Nm], _Tp (&__b)[_Nm]) ^ /usr/include/c++/4.8/bits/move.h:185:5: note: template argument deduction/substitution failed: permutari6.cpp:48:49: note: mismatched types '_Tp [_Nm]' and 'bool' swap(matrice[j] > matrice[j + 1]) ^ In file included from /usr/include/c++/4.8/bits/stl_pair.h:59:0, from /usr/include/c++/4.8/bits/stl_algobase.h:64, from /usr/include/c++/4.8/bits/char_traits.h:39, 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 permutari6.cpp:1: /usr/include/c++/4.8/bits/move.h:166:5: note: template<class _Tp> void std::swap(_Tp&, _Tp&) swap(_Tp& __a, _Tp& __b) ^ /usr/include/c++/4.8/bits/move.h:166:5: note: template argument deduction/substitution failed: permutari6.cpp:48:49: note: candidate expects 2 arguments, 1 provided swap(matrice[j] > matrice[j + 1]) ^ permutari6.cpp:49:13: error: expected ';' before '}' token } ^ permutari6.cpp: In function 'int main()': permutari6.cpp:66:27: error: too few arguments to function 'void bubbleSort(int*, int, int)' bubbleSort(nr, lungime); ^ permutari6.cpp:40:6: note: declared here void bubbleSort(int matrice[], int n, int temp) ^
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema Permutari6 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ă.