#130
Să se scrie un program care ordonează elementele unui vector crescător după suma cifrelor.
Problema | SortCif | Operații I/O |
![]() sortcif.in /sortcif.out
|
---|---|---|---|
Limita timp | 0.1 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
Id soluție | #57531831 | Utilizator | |
Fișier | sortcif.cpp | Dimensiune | 623 B |
Data încărcării | 03 Aprilie 2025, 14:51 | Scor / rezultat | Eroare de compilare |
sortcif.cpp: In function 'int main()': sortcif.cpp:11:15: warning: left operand of comma operator has no effect [-Wunused-value] for(i=1; i<=n,i++) ^ sortcif.cpp:11:22: error: expected ';' before ')' token for(i=1; i<=n,i++) ^ sortcif.cpp:23:12: error: invalid types 'int[int]' for array subscript a[i]=s; ^ sortcif.cpp:28:19: error: invalid types 'int[int]' for array subscript if(a[i]>a[j]) ^ sortcif.cpp:28:24: error: invalid types 'int[int]' for array subscript if(a[i]>a[j]) ^ sortcif.cpp:30:26: error: invalid types 'int[int]' for array subscript swap (a[i],a[j]); ^ sortcif.cpp:30:31: error: invalid types 'int[int]' for array subscript swap (a[i],a[j]); ^ sortcif.cpp:31:30: warning: left operand of comma operator has no effect [-Wunused-value] swap (v[i,v[j]); ^ sortcif.cpp:31:31: error: expected ']' before ')' token swap (v[i,v[j]); ^ sortcif.cpp:31:31: error: no matching function for call to 'swap(int&)' sortcif.cpp:31:31: note: candidates are: 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 sortcif.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: sortcif.cpp:31:31: note: candidate expects 2 arguments, 1 provided swap (v[i,v[j]); ^ 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 sortcif.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: sortcif.cpp:31:31: note: mismatched types '_Tp [_Nm]' and 'int' swap (v[i,v[j]); ^ 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 sortcif.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: sortcif.cpp:31:31: note: mismatched types 'std::pair<_T1, _T2>' and 'int' swap (v[i,v[j]); ^ 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 sortcif.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: sortcif.cpp:31:31: note: mismatched types 'std::basic_string<_CharT, _Traits, _Alloc>' and 'int' swap (v[i,v[j]); ^
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema SortCif 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ă.