Acest site foloseşte cookies. Navigând în continuare, vă exprimaţi acordul asupra folosirii cookie-urilor.
Detalii evaluare #65011437
Rezumat problemă
#3900
Sa se cripteze sau sa se decripteze un mesaj folosind cifrul Myszkowski.
cifrul Myszkowski
PARMI NOUS (traianflorianalin) Detalii
| Problema | Myszkowski | Operații I/O |
myszkowski.in/myszkowski.out
|
|---|---|---|---|
| Limita timp | 0.1 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
| Id soluție | #65011437 | Utilizator |
Neamt Stefan (StefanNeamt)
|
| Fișier | myszkowski.cpp | Dimensiune | 2.83 KB |
| Data încărcării | 13 Iulie 2026, 23:31 | Scor/rezultat | Eroare de compilare |
Evaluare
Mesaj compilare
myszkowski.cpp: In function ‘void solve_c1()’: myszkowski.cpp:35:61: error: use of ‘auto’ in lambda parameter declaration only available with ‘-std=c++14’ or ‘-std=gnu++14’ 35 | std::stable_sort(matrix.begin(), matrix.end(), [](const auto& a, const auto& b) { | ^~~~ myszkowski.cpp:35:76: error: use of ‘auto’ in lambda parameter declaration only available with ‘-std=c++14’ or ‘-std=gnu++14’ 35 | std::stable_sort(matrix.begin(), matrix.end(), [](const auto& a, const auto& b) { | ^~~~ myszkowski.cpp: In lambda function: myszkowski.cpp:36:17: error: invalid types ‘const int[int]’ for array subscript 36 | return a[0] < b[0]; | ^ myszkowski.cpp:36:24: error: invalid types ‘const int[int]’ for array subscript 36 | return a[0] < b[0]; | ^ myszkowski.cpp: In function ‘void solve_c2()’: myszkowski.cpp:66:61: error: use of ‘auto’ in lambda parameter declaration only available with ‘-std=c++14’ or ‘-std=gnu++14’ 66 | std::stable_sort(matrix.begin(), matrix.end(), [](const auto& a, const auto& b) { | ^~~~ myszkowski.cpp:66:76: error: use of ‘auto’ in lambda parameter declaration only available with ‘-std=c++14’ or ‘-std=gnu++14’ 66 | std::stable_sort(matrix.begin(), matrix.end(), [](const auto& a, const auto& b) { | ^~~~ myszkowski.cpp: In lambda function: myszkowski.cpp:67:17: error: invalid types ‘const int[int]’ for array subscript 67 | return a[0] < b[0]; | ^ myszkowski.cpp:67:24: error: invalid types ‘const int[int]’ for array subscript 67 | return a[0] < b[0]; | ^ In file included from /usr/include/c++/13/bits/stl_algobase.h:71, from /usr/include/c++/13/vector:62, from myszkowski.cpp:3: /usr/include/c++/13/bits/predefined_ops.h: In instantiation of ‘bool __gnu_cxx::__ops::_Iter_comp_iter<_Compare>::operator()(_Iterator1, _Iterator2) [with _Iterator1 = __gnu_cxx::__normal_iterator<std::vector<char>*, std::vector<std::vector<char> > >; _Iterator2 = __gnu_cxx::__normal_iterator<std::vector<char>*, std::vector<std::vector<char> > >; _Compare = solve_c1()::<lambda(const int&, const int&)>]’: /usr/include/c++/13/bits/stl_algo.h:1819:14: required from ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<vector<char>*, vector<vector<char> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<solve_c1()::<lambda(const int&, const int&)> >]’ /usr/include/c++/13/bits/stl_algo.h:2790:25: required from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<vector<char>*, vector<vector<char> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<solve_c1()::<lambda(const int&, const int&)> >]’ /usr/include/c++/13/bits/stl_algo.h:5045:28: required from ‘void std::__stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<vector<char>*, vector<vector<char> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<solve_c1()::<lambda(const int&, const int&)> >]’ /usr/include/c++/13/bits/stl_algo.h:5119:36: required from ‘void std::stable_sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<vector<char>*, vector<vector<char> > >; _Compare = solve_c1()::<lambda(const int&, const int&)>]’ myszkowski.cpp:35:21: required from here /usr/include/c++/13/bits/predefined_ops.h:158:30: error: no match for call to ‘(solve_c1()::<lambda(const int&, const int&)>) (std::vector<char>&, std::vector<char>&)’ 158 | { return bool(_M_comp(*__it1, *__it2)); } | ~~~~~~~^~~~~~~~~~~~~~~~ myszkowski.cpp:35:52: note: candidate: ‘solve_c1()::<lambda(const int&, const int&)>’ 35 | std::stable_sort(matrix.begin(), matrix.end(), [](const auto& a, const auto& b) { | ^ myszkowski.cpp:35:52: note: no known conversion for argument 1 from ‘std::vector<char>’ to ‘const int&’ /usr/include/c++/13/bits/predefined_ops.h: In instantiation of ‘bool __gnu_cxx::__ops::_Iter_comp_iter<_Compare>::operator()(_Iterator1, _Iterator2) [with _Iterator1 = __gnu_cxx::__normal_iterator<std::vector<char>*, std::vector<std::vector<char> > >; _Iterator2 = __gnu_cxx::__normal_iterator<std::vector<char>*, std::vector<std::vector<char> > >; _Compare = solve_c2()::<lambda(const int&, const int&)>]’: /usr/include/c++/13/bits/stl_algo.h:1819:14: required from ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<vector<char>*, vector<vector<char> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<solve_c2()::<lambda(const int&, const int&)> >]’ /usr/include/c++/13/bits/stl_algo.h:2790:25: required from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<vector<char>*, vector<vector<char> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<solve_c2()::<lambda(const int&, const int&)> >]’ /usr/include/c++/13/bits/stl_algo.h:5045:28: required from ‘void std::__stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<vector<char>*, vector<vector<char> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<solve_c2()::<lambda(const int&, const int&)> >]’ /usr/include/c++/13/bits/stl_algo.h:5119:36: required from ‘void std::stable_sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<vector<char>*, vector<vector<char> > >; _Compare = solve_c2()::<lambda(const int&, const int&)>]’ myszkowski.cpp:66:21: required from here /usr/include/c++/13/bits/predefined_ops.h:158:30: error: no match for call to ‘(solve_c2()::<lambda(const int&, const int&)>) (std::vector<char>&, std::vector<char>&)’ 158 | { return bool(_M_comp(*__it1, *__it2)); } | ~~~~~~~^~~~~~~~~~~~~~~~ myszkowski.cpp:66:52: note: candidate: ‘solve_c2()::<lambda(const int&, const int&)>’ 66 | std::stable_sort(matrix.begin(), matrix.end(), [](const auto& a, const auto& b) { | ^ myszkowski.cpp:66:52: note: no known conversion for argument 1 from ‘std::vector<char>’ to ‘const int&’ /usr/include/c++/13/bits/predefined_ops.h: In instantiation of ‘bool __gnu_cxx::__ops::_Iter_comp_iter<_Compare>::operator()(_Iterator1, _Iterator2) [with _Iterator1 = __gnu_cxx::__normal_iterator<std::vector<char>*, std::vector<std::vector<char> > >; _Iterator2 = std::vector<char>*; _Compare = solve_c1()::<lambda(const int&, const int&)>]’: /usr/include/c++/13/bits/stl_algo.h:2300:14: required from ‘void std::__move_merge_adaptive(_InputIterator1, _InputIterator1, _InputIterator2, _InputIterator2, _OutputIterator, _Compare) [with _InputIterator1 = vector<char>*; _InputIterator2 = __gnu_cxx::__normal_iterator<vector<char>*, vector<vector<char> > >; _OutputIterator = __gnu_cxx::__normal_iterator<vector<char>*, vector<vector<char> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<solve_c1()::<lambda(const int&, const int&)> >]’ /usr/include/c++/13/bits/stl_algo.h:2410:30: required from ‘void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<vector<char>*, vector<vector<char> > >; _Distance = long int; _Pointer = vector<char>*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<solve_c1()::<lambda(const int&, const int&)> >]’ /usr/include/c++/13/bits/stl_algo.h:2750:28: required from ‘void std::__stable_sort_adaptive(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Pointer, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<vector<char>*, vector<vector<char> > >; _Pointer = vector<char>*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<solve_c1()::<lambda(const int&, const int&)> >]’ /usr/include/c++/13/bits/stl_algo.h:5041:29: required from ‘void std::__stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<vector<char>*, vector<vector<char> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<solve_c1()::<lambda(const int&, const int&)> >]’ /usr/include/c++/13/bits/stl_algo.h:5119:36: required from ‘void std::stable_sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<vector<char>*, vector<vector<char> > >; _Compare = solve_c1()::<lambda(const int&, const int&)>]’ myszkowski.cpp:35:21: required from here /usr/include/c++/13/bits/predefined_ops.h:158:30: error: no match for call to ‘(solve_c1()::<lambda(const int&, const int&)>) (std::vector<char>&, std::vector<char>&)’ 158 | { return bool(_M_comp(*__it1, *__it2)); } | ~~~~~~~^~~~~~~~~~~~~~~~ myszkowski.cpp:35:52: note: candidate: ‘solve_c1()::<lambda(const int&, const int&)>’ 35 | std::stable_sort(matrix.begin(), matrix.end(), [](const auto& a, const auto& b) { | ^ myszkowski.cpp:35:52: note: no known conversion for argument 1 from ‘std::vector<char>’ to ‘const int&’ /usr/include/c++/13/bits/predefined_ops.h: In instantiation of ‘bool __gnu_cxx::__ops::_Iter_comp_iter<_Compare>::operator()(_Iterator1, _Iterator2) [with _Iterator1 = std::vector<char>*; _Iterator2 = __gnu_cxx::__normal_iterator<std::vector<char>*, std::vector<std::vector<char> > >; _Compare = solve_c1()::<lambda(const int&, const int&)>]’: /usr/include/c++/13/bits/stl_algo.h:2339:14: required from ‘void std::__move_merge_adaptive_backward(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator2, _BidirectionalIterator2, _BidirectionalIterator3, _Compare) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<vector<char>*, vector<vector<char> > >; _BidirectionalIterator2 = vector<char>*; _BidirectionalIterator3 = __gnu_cxx::__normal_iterator<vector<char>*, vector<vector<char> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<solve_c1()::<lambda(const int&, const int&)> >]’ /usr/include/c++/13/bits/stl_algo.h:2416:39: required from ‘void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<vector<char>*, vector<vector<char> > >; _Distance = long int; _Pointer = vector<char>*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<solve_c1()::<lambda(const int&, const int&)> >]’ /usr/include/c++/13/bits/stl_algo.h:2750:28: required from ‘void std::__stable_sort_adaptive(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Pointer, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<vector<char>*, vector<vector<char> > >; _Pointer = vector<char>*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<solve_c1()::<lambda(const int&, const int&)> >]’ /usr/include/c++/13/bits/stl_algo.h:5041:29: required from ‘void std::__stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<vector<char>*, vector<vector<char> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<solve_c1()::<lambda(const int&, const int&)> >]’ /usr/include/c++/13/bits/stl_algo.h:5119:36: required from ‘void std::stable_sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<vector<char>*, vector<vector<char> > >; _Compare = solve_c1()::<lambda(const int&, const int&)>]’ myszkowski.cpp:35:21: required from here /usr/include/c++/13/bits/predefined_ops.h:158:30: error: no match for call to ‘(solve_c1()::<lambda(const int&, const int&)>) (std::vector<char>&, std::vector<char>&)’ 158 | { return bool(_M_comp(*__it1, *__it2)); } | ~~~~~~~^~~~~~~~~~~~~~~~ myszkowski.cpp:35:52: note: candidate: ‘solve_c1()::<lambda(const int&, const int&)>’ 35 | std::stable_sort(matrix.begin(), matrix.end(), [](const auto& a, const auto& b) { | ^ myszkowski.cpp:35:52: note: no known conversion for argument 1 from ‘std::vector<char>’ to ‘const int&’ /usr/include/c++/13/bits/predefined_ops.h: In instantiation of ‘bool __gnu_cxx::__ops::_Val_comp_iter<_Compare>::operator()(_Value&, _Iterator) [with _Value = std::vector<char>; _Iterator = __gnu_cxx::__normal_iterator<std::vector<char>*, std::vector<std::vector<char> > >; _Compare = solve_c1()::<lambda(const int&, const int&)>]’: /usr/include/c++/13/bits/stl_algo.h:1799:20: required from ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<vector<char>*, vector<vector<char> > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<solve_c1()::<lambda(const int&, const int&)> >]’ /usr/include/c++/13/bits/stl_algo.h:1827:36: required from ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<vector<char>*, vector<vector<char> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<solve_c1()::<lambda(const int&, const int&)> >]’ /usr/include/c++/13/bits/stl_algo.h:2790:25: required from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<vector<char>*, vector<vector<char> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<solve_c1()::<lambda(const int&, const int&)> >]’ /usr/include/c++/13/bits/stl_algo.h:5045:28: required from ‘void std::__stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<vector<char>*, vector<vector<char> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<solve_c1()::<lambda(const int&, const int&)> >]’ /usr/include/c++/13/bits/stl_algo.h:5119:36: required from ‘void std::stable_sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<vector<char>*, vector<vector<char> > >; _Compare = solve_c1()::<lambda(const int&, const int&)>]’ myszkowski.cpp:35:21: required from here /usr/include/c++/13/bits/predefined_ops.h:240:30: error: no match for call to ‘(solve_c1()::<lambda(const int&, const int&)>) (std::vector<char>&, std::vector<char>&)’ 240 | { return bool(_M_comp(__val, *__it)); } | ~~~~~~~^~~~~~~~~~~~~~ myszkowski.cpp:35:52: note: candidate: ‘solve_c1()::<lambda(const int&, const int&)>’ 35 | std::stable_sort(matrix.begin(), matrix.end(), [](const auto& a, const auto& b) { | ^ myszkowski.cpp:35:52: note: no known conversion for argument 1 from ‘std::vector<char>’ to ‘const int&’ /usr/include/c++/13/bits/predefined_ops.h: In instantiation of ‘bool __gnu_cxx::__ops::_Iter_comp_val<_Compare>::operator()(_Iterator, _Value&) [with _Iterator = __gnu_cxx::__normal_iterator<std::vector<char>*, std::vector<std::vector<char> > >; _Value = const std::vector<char>; _Compare = solve_c1()::<lambda(const int&, const int&)>]’: /usr/include/c++/13/bits/stl_algobase.h:1472:14: required from ‘_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<vector<char>*, vector<vector<char> > >; _Tp = vector<char>; _Compare = __gnu_cxx::__ops::_Iter_comp_val<solve_c1()::<lambda(const int&, const int&)> >]’ /usr/include/c++/13/bits/stl_algo.h:2502:26: required from ‘void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<vector<char>*, vector<vector<char> > >; _Distance = long int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<solve_c1()::<lambda(const int&, const int&)> >]’ /usr/include/c++/13/bits/stl_algo.h:2796:34: required from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<vector<char>*, vector<vector<char> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<solve_c1()::<lambda(const int&, const int&)> >]’ /usr/include/c++/13/bits/stl_algo.h:5045:28: required from ‘void std::__stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<vector<char>*, vector<vector<char> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<solve_c1()::<lambda(const int&, const int&)> >]’ /usr/include/c++/13/bits/stl_algo.h:5119:36: required from ‘void std::stable_sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<vector<char>*, vector<vector<char> > >; _Compare = solve_c1()::<lambda(const int&, const int&)>]’ myszkowski.cpp:35:21: required from here /usr/include/c++/13/bits/predefined_ops.h:196:30: error: no match for call to ‘(solve_c1()::<lambda(const int&, const int&)>) (std::vector<char>&, const std::vector<char>&)’ 196 | { return bool(_M_comp(*__it, __val)); } | ~~~~~~~^~~~~~~~~~~~~~ myszkowski.cpp:35:52: note: candidate: ‘solve_c1()::<lambda(const int&, const int&)>’ 35 | std::stable_sort(matrix.begin(), matrix.end(), [](const auto& a, const auto& b) { | ^ myszkowski.cpp:35:52: note: no known conversion for argument 1 from ‘std::vector<char>’ to ‘const int&’ /usr/include/c++/13/bits/predefined_ops.h: In instantiation of ‘bool __gnu_cxx::__ops::_Val_comp_iter<_Compare>::operator()(_Value&, _Iterator) [with _Value = const std::vector<char>; _Iterator = __gnu_cxx::__normal_iterator<std::vector<char>*, std::vector<std::vector<char> > >; _Compare = solve_c1()::<lambda(const int&, const int&)>]’: /usr/include/c++/13/bits/stl_algo.h:2035:14: required from ‘_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<vector<char>*, vector<vector<char> > >; _Tp = vector<char>; _Compare = __gnu_cxx::__ops::_Val_comp_iter<solve_c1()::<lambda(const int&, const int&)> >]’ /usr/include/c++/13/bits/stl_algo.h:2511:26: required from ‘void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<vector<char>*, vector<vector<char> > >; _Distance = long int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<solve_c1()::<lambda(const int&, const int&)> >]’ /usr/include/c++/13/bits/stl_algo.h:2796:34: required from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<vector<char>*, vector<vector<char> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<solve_c1()::<lambda(const int&, const int&)> >]’ /usr/include/c++/13/bits/stl_algo.h:5045:28: required from ‘void std::__stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<vector<char>*, vector<vector<char> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<solve_c1()::<lambda(const int&, const int&)> >]’ /usr/include/c++/13/bits/stl_algo.h:5119:36: required from ‘void std::stable_sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<vector<char>*, vector<vector<char> > >; _Compare = solve_c1()::<lambda(const int&, const int&)>]’ myszkowski.cpp:35:21: required from here /usr/include/c++/13/bits/predefined_ops.h:240:30: error: no match for call to ‘(solve_c1()::<lambda(const int&, const int&)>) (const std::vector<char>&, std::vector<char>&)’ 240 | { return bool(_M_comp(__val, *__it)); } | ~~~~~~~^~~~~~~~~~~~~~ myszkowski.cpp:35:52: note: candidate: ‘solve_c1()::<lambda(const int&, const int&)>’ 35 | std::stable_sort(matrix.begin(), matrix.end(), [](const auto& a, const auto& b) { | ^ myszkowski.cpp:35:52: note: no known conversion for argument 1 from ‘const std::vector<char>’ to ‘const int&’ /usr/include/c++/13/bits/predefined_ops.h: In instantiation of ‘bool __gnu_cxx::__ops::_Iter_comp_iter<_Compare>::operator()(_Iterator1, _Iterator2) [with _Iterator1 = __gnu_cxx::__normal_iterator<std::vector<char>*, std::vector<std::vector<char> > >; _Iterator2 = std::vector<char>*; _Compare = solve_c2()::<lambda(const int&, const int&)>]’: /usr/include/c++/13/bits/stl_algo.h:2300:14: required from ‘void std::__move_merge_adaptive(_InputIterator1, _InputIterator1, _InputIterator2, _InputIterator2, _OutputIterator, _Compare) [with _InputIterator1 = vector<char>*; _InputIterator2 = __gnu_cxx::__normal_iterator<vector<char>*, vector<vector<char> > >; _OutputIterator = __gnu_cxx::__normal_iterator<vector<char>*, vector<vector<char> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<solve_c2()::<lambda(const int&, const int&)> >]’ /usr/include/c++/13/bits/stl_algo.h:2410:30: required from ‘void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<vector<char>*, vector<vector<char> > >; _Distance = long int; _Pointer = vector<char>*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<solve_c2()::<lambda(const int&, const int&)> >]’ /usr/include/c++/13/bits/stl_algo.h:2750:28: required from ‘void std::__stable_sort_adaptive(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Pointer, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<vector<char>*, vector<vector<char> > >; _Pointer = vector<char>*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<solve_c2()::<lambda(const int&, const int&)> >]’ /usr/include/c++/13/bits/stl_algo.h:5041:29: required from ‘void std::__stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<vector<char>*, vector<vector<char> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<solve_c2()::<lambda(const int&, const int&)> >]’ /usr/include/c++/13/bits/stl_algo.h:5119:36: required from ‘void std::stable_sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<vector<char>*, vector<vector<char> > >; _Compare = solve_c2()::<lambda(const int&, const int&)>]’ myszkowski.cpp:66:21: required from here /usr/include/c++/13/bits/predefined_ops.h:158:30: error: no match for call to ‘(solve_c2()::<lambda(const int&, const int&)>) (std::vector<char>&, std::vector<char>&)’ 158 | { return bool(_M_comp(*__it1, *__it2)); } | ~~~~~~~^~~~~~~~~~~~~~~~ myszkowski.cpp:66:52: note: candidate: ‘solve_c2()::<lambda(const int&, const int&)>’ 66 | std::stable_sort(matrix.begin(), matrix.end(), [](const auto& a, const auto& b) { | ^ myszkowski.cpp:66:52: note: no known conversion for argument 1 from ‘std::vector<char>’ to ‘const int&’ /usr/include/c++/13/bits/predefined_ops.h: In instantiation of ‘bool __gnu_cxx::__ops::_Iter_comp_iter<_Compare>::operator()(_Iterator1, _Iterator2) [with _Iterator1 = std::vector<char>*; _Iterator2 = __gnu_cxx::__normal_iterator<std::vector<char>*, std::vector<std::vector<char> > >; _Compare = solve_c2()::<lambda(const int&, const int&)>]’: /usr/include/c++/13/bits/stl_algo.h:2339:14: required from ‘void std::__move_merge_adaptive_backward(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator2, _BidirectionalIterator2, _BidirectionalIterator3, _Compare) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<vector<char>*, vector<vector<char> > >; _BidirectionalIterator2 = vector<char>*; _BidirectionalIterator3 = __gnu_cxx::__normal_iterator<vector<char>*, vector<vector<char> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<solve_c2()::<lambda(const int&, const int&)> >]’ /usr/include/c++/13/bits/stl_algo.h:2416:39: required from ‘void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<vector<char>*, vector<vector<char> > >; _Distance = long int; _Pointer = vector<char>*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<solve_c2()::<lambda(const int&, const int&)> >]’ /usr/include/c++/13/bits/stl_algo.h:2750:28: required from ‘void std::__stable_sort_adaptive(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Pointer, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<vector<char>*, vector<vector<char> > >; _Pointer = vector<char>*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<solve_c2()::<lambda(const int&, const int&)> >]’ /usr/include/c++/13/bits/stl_algo.h:5041:29: required from ‘void std::__stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<vector<char>*, vector<vector<char> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<solve_c2()::<lambda(const int&, const int&)> >]’ /usr/include/c++/13/bits/stl_algo.h:5119:36: required from ‘void std::stable_sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<vector<char>*, vector<vector<char> > >; _Compare = solve_c2()::<lambda(const int&, const int&)>]’ myszkowski.cpp:66:21: required from here /usr/include/c++/13/bits/predefined_ops.h:158:30: error: no match for call to ‘(solve_c2()::<lambda(const int&, const int&)>) (std::vector<char>&, std::vector<char>&)’ 158 | { return bool(_M_comp(*__it1, *__it2)); } | ~~~~~~~^~~~~~~~~~~~~~~~ myszkowski.cpp:66:52: note: candidate: ‘solve_c2()::<lambda(const int&, const int&)>’ 66 | std::stable_sort(matrix.begin(), matrix.end(), [](const auto& a, const auto& b) { | ^ myszkowski.cpp:66:52: note: no known conversion for argument 1 from ‘std::vector<char>’ to ‘const int&’ /usr/include/c++/13/bits/predefined_ops.h: In instantiation of ‘bool __gnu_cxx::__ops::_Val_comp_iter<_Compare>::operator()(_Value&, _Iterator) [with _Value = std::vector<char>; _Iterator = __gnu_cxx::__normal_iterator<std::vector<char>*, std::vector<std::vector<char> > >; _Compare = solve_c2()::<lambda(const int&, const int&)>]’: /usr/include/c++/13/bits/stl_algo.h:1799:20: required from ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<vector<char>*, vector<vector<char> > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<solve_c2()::<lambda(const int&, const int&)> >]’ /usr/include/c++/13/bits/stl_algo.h:1827:36: required from ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<vector<char>*, vector<vector<char> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<solve_c2()::<lambda(const int&, const int&)> >]’ /usr/include/c++/13/bits/stl_algo.h:2790:25: required from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<vector<char>*, vector<vector<char> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<solve_c2()::<lambda(const int&, const int&)> >]’ /usr/include/c++/13/bits/stl_algo.h:5045:28: required from ‘void std::__stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<vector<char>*, vector<vector<char> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<solve_c2()::<lambda(const int&, const int&)> >]’ /usr/include/c++/13/bits/stl_algo.h:5119:36: required from ‘void std::stable_sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<vector<char>*, vector<vector<char> > >; _Compare = solve_c2()::<lambda(const int&, const int&)>]’ myszkowski.cpp:66:21: required from here /usr/include/c++/13/bits/predefined_ops.h:240:30: error: no match for call to ‘(solve_c2()::<lambda(const int&, const int&)>) (std::vector<char>&, std::vector<char>&)’ 240 | { return bool(_M_comp(__val, *__it)); } | ~~~~~~~^~~~~~~~~~~~~~ myszkowski.cpp:66:52: note: candidate: ‘solve_c2()::<lambda(const int&, const int&)>’ 66 | std::stable_sort(matrix.begin(), matrix.end(), [](const auto& a, const auto& b) { | ^ myszkowski.cpp:66:52: note: no known conversion for argument 1 from ‘std::vector<char>’ to ‘const int&’ /usr/include/c++/13/bits/predefined_ops.h: In instantiation of ‘bool __gnu_cxx::__ops::_Iter_comp_val<_Compare>::operator()(_Iterator, _Value&) [with _Iterator = __gnu_cxx::__normal_iterator<std::vector<char>*, std::vector<std::vector<char> > >; _Value = const std::vector<char>; _Compare = solve_c2()::<lambda(const int&, const int&)>]’: /usr/include/c++/13/bits/stl_algobase.h:1472:14: required from ‘_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<vector<char>*, vector<vector<char> > >; _Tp = vector<char>; _Compare = __gnu_cxx::__ops::_Iter_comp_val<solve_c2()::<lambda(const int&, const int&)> >]’ /usr/include/c++/13/bits/stl_algo.h:2502:26: required from ‘void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<vector<char>*, vector<vector<char> > >; _Distance = long int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<solve_c2()::<lambda(const int&, const int&)> >]’ /usr/include/c++/13/bits/stl_algo.h:2796:34: required from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<vector<char>*, vector<vector<char> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<solve_c2()::<lambda(const int&, const int&)> >]’ /usr/include/c++/13/bits/stl_algo.h:5045:28: required from ‘void std::__stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<vector<char>*, vector<vector<char> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<solve_c2()::<lambda(const int&, const int&)> >]’ /usr/include/c++/13/bits/stl_algo.h:5119:36: required from ‘void std::stable_sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<vector<char>*, vector<vector<char> > >; _Compare = solve_c2()::<lambda(const int&, const int&)>]’ myszkowski.cpp:66:21: required from here /usr/include/c++/13/bits/predefined_ops.h:196:30: error: no match for call to ‘(solve_c2()::<lambda(const int&, const int&)>) (std::vector<char>&, const std::vector<char>&)’ 196 | { return bool(_M_comp(*__it, __val)); } | ~~~~~~~^~~~~~~~~~~~~~ myszkowski.cpp:66:52: note: candidate: ‘solve_c2()::<lambda(const int&, const int&)>’ 66 | std::stable_sort(matrix.begin(), matrix.end(), [](const auto& a, const auto& b) { | ^ myszkowski.cpp:66:52: note: no known conversion for argument 1 from ‘std::vector<char>’ to ‘const int&’ /usr/include/c++/13/bits/predefined_ops.h: In instantiation of ‘bool __gnu_cxx::__ops::_Val_comp_iter<_Compare>::operator()(_Value&, _Iterator) [with _Value = const std::vector<char>; _Iterator = __gnu_cxx::__normal_iterator<std::vector<char>*, std::vector<std::vector<char> > >; _Compare = solve_c2()::<lambda(const int&, const int&)>]’: /usr/include/c++/13/bits/stl_algo.h:2035:14: required from ‘_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<vector<char>*, vector<vector<char> > >; _Tp = vector<char>; _Compare = __gnu_cxx::__ops::_Val_comp_iter<solve_c2()::<lambda(const int&, const int&)> >]’ /usr/include/c++/13/bits/stl_algo.h:2511:26: required from ‘void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<vector<char>*, vector<vector<char> > >; _Distance = long int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<solve_c2()::<lambda(const int&, const int&)> >]’ /usr/include/c++/13/bits/stl_algo.h:2796:34: required from ‘void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<vector<char>*, vector<vector<char> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<solve_c2()::<lambda(const int&, const int&)> >]’ /usr/include/c++/13/bits/stl_algo.h:5045:28: required from ‘void std::__stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<vector<char>*, vector<vector<char> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<solve_c2()::<lambda(const int&, const int&)> >]’ /usr/include/c++/13/bits/stl_algo.h:5119:36: required from ‘void std::stable_sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<vector<char>*, vector<vector<char> > >; _Compare = solve_c2()::<lambda(const int&, const int&)>]’ myszkowski.cpp:66:21: required from here /usr/include/c++/13/bits/predefined_ops.h:240:30: error: no match for call to ‘(solve_c2()::<lambda(const int&, const int&)>) (const std::vector<char>&, std::vector<char>&)’ 240 | { return bool(_M_comp(__val, *__it)); } | ~~~~~~~^~~~~~~~~~~~~~ myszkowski.cpp:66:52: note: candidate: ‘solve_c2()::<lambda(const int&, const int&)>’ 66 | std::stable_sort(matrix.begin(), matrix.end(), [](const auto& a, const auto& b) { | ^ myszkowski.cpp:66:52: note: no known conversion for argument 1 from ‘const std::vector<char>’ to ‘const int&’ /usr/include/c++/13/bits/predefined_ops.h: In instantiation of ‘bool __gnu_cxx::__ops::_Iter_comp_iter<_Compare>::operator()(_Iterator1, _Iterator2) [with _Iterator1 = std::vector<char>*; _Iterator2 = std::vector<char>*; _Compare = solve_c1()::<lambda(const int&, const int&)>]’: /usr/include/c++/13/bits/stl_algo.h:2655:14: required from ‘_OutputIterator std::__move_merge(_InputIterator, _InputIterator, _InputIterator, _InputIterator, _OutputIterator, _Compare) [with _InputIterator = vector<char>*; _OutputIterator = __gnu_cxx::__normal_iterator<vector<char>*, vector<vector<char> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<solve_c1()::<lambda(const int&, const int&)> >]’ /usr/include/c++/13/bits/stl_algo.h:2684:32: required from ‘void std::__merge_sort_loop(_RandomAccessIterator1, _RandomAccessIterator1, _RandomAccessIterator2, _Distance, _Compare) [with _RandomAccessIterator1 = vector<char>*; _RandomAccessIterator2 = __gnu_cxx::__normal_iterator<vector<char>*, vector<vector<char> > >; _Distance = long int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<solve_c1()::<lambda(const int&, const int&)> >]’ /usr/include/c++/13/bits/stl_algo.h:2734:26: required from ‘void std::__merge_sort_with_buffer(_RandomAccessIterator, _RandomAccessIterator, _Pointer, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<vector<char>*, vector<vector<char> > >; _Pointer = vector<char>*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<solve_c1()::<lambda(const int&, const int&)> >]’ /usr/include/c++/13/bits/stl_algo.h:2747:36: required from ‘void std::__stable_sort_adaptive(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Pointer, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<vector<char>*, vector<vector<char> > >; _Pointer = vector<char>*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<solve_c1()::<lambda(const int&, const int&)> >]’ /usr/include/c++/13/bits/stl_algo.h:5041:29: required from ‘void std::__stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<vector<char>*, vector<vector<char> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<solve_c1()::<lambda(const int&, const int&)> >]’ /usr/include/c++/13/bits/stl_algo.h:5119:36: required from ‘void std::stable_sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<vector<char>*, vector<vector<char> > >; _Compare = solve_c1()::<lambda(const int&, const int&)>]’ myszkowski.cpp:35:21: required from here /usr/include/c++/13/bits/predefined_ops.h:158:30: error: no match for call to ‘(solve_c1()::<lambda(const int&, const int&)>) (std::vector<char>&, std::vector<char>&)’ 158 | { return bool(_M_comp(*__it1, *__it2)); } | ~~~~~~~^~~~~~~~~~~~~~~~ myszkowski.cpp:35:52: note: candidate: ‘solve_c1()::<lambda(const int&, const int&)>’ 35 | std::stable_sort(matrix.begin(), matrix.end(), [](const auto& a, const auto& b) { | ^ myszkowski.cpp:35:52: note: no known conversion for argument 1 from ‘std::vector<char>’ to ‘const int&’ /usr/include/c++/13/bits/predefined_ops.h: In instantiation of ‘bool __gnu_cxx::__ops::_Iter_comp_iter<_Compare>::operator()(_Iterator1, _Iterator2) [with _Iterator1 = std::vector<char>*; _Iterator2 = std::vector<char>*; _Compare = solve_c2()::<lambda(const int&, const int&)>]’: /usr/include/c++/13/bits/stl_algo.h:2655:14: required from ‘_OutputIterator std::__move_merge(_InputIterator, _InputIterator, _InputIterator, _InputIterator, _OutputIterator, _Compare) [with _InputIterator = vector<char>*; _OutputIterator = __gnu_cxx::__normal_iterator<vector<char>*, vector<vector<char> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<solve_c2()::<lambda(const int&, const int&)> >]’ /usr/include/c++/13/bits/stl_algo.h:2684:32: required from ‘void std::__merge_sort_loop(_RandomAccessIterator1, _RandomAccessIterator1, _RandomAccessIterator2, _Distance, _Compare) [with _RandomAccessIterator1 = vector<char>*; _RandomAccessIterator2 = __gnu_cxx::__normal_iterator<vector<char>*, vector<vector<char> > >; _Distance = long int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<solve_c2()::<lambda(const int&, const int&)> >]’ /usr/include/c++/13/bits/stl_algo.h:2734:26: required from ‘void std::__merge_sort_with_buffer(_RandomAccessIterator, _RandomAccessIterator, _Pointer, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<vector<char>*, vector<vector<char> > >; _Pointer = vector<char>*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<solve_c2()::<lambda(const int&, const int&)> >]’ /usr/include/c++/13/bits/stl_algo.h:2747:36: required from ‘void std::__stable_sort_adaptive(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Pointer, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<vector<char>*, vector<vector<char> > >; _Pointer = vector<char>*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<solve_c2()::<lambda(const int&, const int&)> >]’ /usr/include/c++/13/bits/stl_algo.h:5041:29: required from ‘void std::__stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<vector<char>*, vector<vector<char> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<solve_c2()::<lambda(const int&, const int&)> >]’ /usr/include/c++/13/bits/stl_algo.h:5119:36: required from ‘void std::stable_sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<vector<char>*, vector<vector<char> > >; _Compare = solve_c2()::<lambda(const int&, const int&)>]’ myszkowski.cpp:66:21: required from here /usr/include/c++/13/bits/predefined_ops.h:158:30: error: no match for call to ‘(solve_c2()::<lambda(const int&, const int&)>) (std::vector<char>&, std::vector<char>&)’ 158 | { return bool(_M_comp(*__it1, *__it2)); } | ~~~~~~~^~~~~~~~~~~~~~~~ myszkowski.cpp:66:52: note: candidate: ‘solve_c2()::<lambda(const int&, const int&)>’ 66 | std::stable_sort(matrix.begin(), matrix.end(), [](const auto& a, const auto& b) { | ^ myszkowski.cpp:66:52: note: no known conversion for argument 1 from ‘std::vector<char>’ to ‘const int&’ myszkowski.cpp: In function ‘void input()’: myszkowski.cpp:18:11: warning: ignoring return value of ‘int fscanf(FILE*, const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 18 | fscanf(f, "%d%s%s", &c, message, key); | ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
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 Myszkowski 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ă.