#2262
scrabble
n
piese speciale de scrabble. Fiecare piesă are inscripționate două litere mari ale alfabetului englez A...Z
, una dintre litere fiind consoană, cealaltă fiind vocală. Jucătorul poate forma cuvinte prin alăturarea pieselor pe orizontală.
Un cuvânt este considerat valid dacă respectă următoarele condiții:
Cuvântul este cu atât mai valoros cu cât folosește mai multe piese de scrabble.
Problema | scrabble | Operații I/O |
scrabble.in /scrabble.out
|
---|---|---|---|
Limita timp | 0.7 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
Id soluție | #48821238 | Utilizator | |
Fișier | scrabble.cpp | Dimensiune | 1.30 KB |
Data încărcării | 06 Februarie 2024, 17:28 | Scor / rezultat | Eroare de compilare |
In file included from /usr/include/c++/4.8/bits/stl_pair.h:59:0, from /usr/include/c++/4.8/utility:70, from /usr/include/c++/4.8/algorithm:60, from scrabble.cpp:1: /usr/include/c++/4.8/bits/stl_algo.h: In instantiation of 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = char (*)[3]; _Compare = bool (*)(char*, char*)]': /usr/include/c++/4.8/bits/stl_algo.h:2226:70: required from 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = char (*)[3]; _Compare = bool (*)(char*, char*)]' /usr/include/c++/4.8/bits/stl_algo.h:5500:55: required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = char (*)[3]; _Compare = bool (*)(char*, char*)]' scrabble.cpp:53:36: required from here /usr/include/c++/4.8/bits/stl_algo.h:2162:11: error: array must be initialized with a brace-enclosed initializer __val = _GLIBCXX_MOVE(*__i); ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from scrabble.cpp:1: /usr/include/c++/4.8/bits/stl_algo.h:2164:17: error: invalid array assignment *__first = _GLIBCXX_MOVE(__val); ^ /usr/include/c++/4.8/bits/stl_algo.h: In instantiation of '_RandomAccessIterator std::__unguarded_partition(_RandomAccessIterator, _RandomAccessIterator, const _Tp&, _Compare) [with _RandomAccessIterator = char (*)[3]; _Tp = char [3]; _Compare = bool (*)(char*, char*)]': /usr/include/c++/4.8/bits/stl_algo.h:2296:78: required from '_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = char (*)[3]; _Compare = bool (*)(char*, char*)]' /usr/include/c++/4.8/bits/stl_algo.h:2337:62: required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = char (*)[3]; _Size = int; _Compare = bool (*)(char*, char*)]' /usr/include/c++/4.8/bits/stl_algo.h:5499:44: required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = char (*)[3]; _Compare = bool (*)(char*, char*)]' scrabble.cpp:53:36: required from here /usr/include/c++/4.8/bits/stl_algo.h:2263:35: error: invalid conversion from 'const char*' to 'char*' [-fpermissive] while (__comp(*__first, __pivot)) ^ /usr/include/c++/4.8/bits/stl_algo.h:2266:34: error: invalid conversion from 'const char*' to 'char*' [-fpermissive] while (__comp(__pivot, *__last)) ^ In file included from /usr/include/c++/4.8/bits/stl_pair.h:59:0, from /usr/include/c++/4.8/utility:70, from /usr/include/c++/4.8/algorithm:60, from scrabble.cpp:1: /usr/include/c++/4.8/bits/stl_heap.h: In instantiation of 'void std::make_heap(_RAIter, _RAIter, _Compare) [with _RAIter = char (*)[3]; _Compare = bool (*)(char*, char*)]': /usr/include/c++/4.8/bits/stl_algo.h:1946:47: required from 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = char (*)[3]; _Compare = bool (*)(char*, char*)]' /usr/include/c++/4.8/bits/stl_algo.h:5349:59: required from 'void std::partial_sort(_RAIter, _RAIter, _RAIter, _Compare) [with _RAIter = char (*)[3]; _Compare = bool (*)(char*, char*)]' /usr/include/c++/4.8/bits/stl_algo.h:2332:68: required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = char (*)[3]; _Size = int; _Compare = bool (*)(char*, char*)]' /usr/include/c++/4.8/bits/stl_algo.h:5499:44: required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = char (*)[3]; _Compare = bool (*)(char*, char*)]' scrabble.cpp:53:36: required from here /usr/include/c++/4.8/bits/stl_heap.h:446:25: error: array must be initialized with a brace-enclosed initializer _ValueType __value = _GLIBCXX_MOVE(*(__first + __parent)); ^ /usr/include/c++/4.8/bits/stl_heap.h: In instantiation of 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = char (*)[3]; _Compare = bool (*)(char*, char*)]': /usr/include/c++/4.8/bits/stl_algo.h:1949:50: required from 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = char (*)[3]; _Compare = bool (*)(char*, char*)]' /usr/include/c++/4.8/bits/stl_algo.h:5349:59: required from 'void std::partial_sort(_RAIter, _RAIter, _RAIter, _Compare) [with _RAIter = char (*)[3]; _Compare = bool (*)(char*, char*)]' /usr/include/c++/4.8/bits/stl_algo.h:2332:68: required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = char (*)[3]; _Size = int; _Compare = bool (*)(char*, char*)]' /usr/include/c++/4.8/bits/stl_algo.h:5499:44: required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = char (*)[3]; _Compare = bool (*)(char*, char*)]' scrabble.cpp:53:36: required from here /usr/include/c++/4.8/bits/stl_heap.h:339:28: error: array must be initialized with a brace-enclosed initializer _ValueType __value = _GLIBCXX_MOVE(*__result); ^ In file included from /usr/include/c++/4.8/bits/stl_algo.h:61:0, from /usr/include/c++/4.8/algorithm:62, from scrabble.cpp:1: /usr/include/c++/4.8/bits/stl_heap.h:340:17: error: invalid array assignment *__result = _GLIBCXX_MOVE(*__first); ^
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema scrabble 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ă.