Acest site foloseşte cookies. Navigând în continuare, vă exprimaţi acordul asupra folosirii cookie-urilor.

Detalii evaluare #48604639

Rezumat problemă

#1477 amplasare_cuvinte

Scrieţi un program care încrucişează o mulţime de cuvinte într-un careu.

Admitere Informatica Iasi, 2013

Rezolvă

Detalii

Problema amplasare_cuvinte Operații I/O cuvinte.in/cuvinte.out
Limita timp 0.5 secunde Limita memorie Total: 64 MB / Stivă 8 MB
Id soluție #48604639 Utilizator Ciobanu Alexio Patrick (CiobanuAlexio)
Fișier amplasare_cuvinte.cpp Dimensiune 4.04 KB
Data încărcării 30 Ianuarie 2024, 20:30 Scor / rezultat Eroare de compilare

Evaluare


Mesaj compilare

amplasare_cuvinte.cpp: In function 'bool backtracking(char (*)[30], const char (*)[30], int, int, int)':
amplasare_cuvinte.cpp:70:58: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 for (int k = 0; k < strlen(cuvinte[index]); ++k) {

                                                          ^
amplasare_cuvinte.cpp:83:58: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 for (int k = 0; k < strlen(cuvinte[index]); ++k) {

                                                          ^
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 amplasare_cuvinte.cpp:1:
/usr/include/c++/4.8/bits/stl_algo.h: In instantiation of 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = char (*)[30]; _Compare = main()::__lambda0]':
/usr/include/c++/4.8/bits/stl_algo.h:2226:70:   required from 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = char (*)[30]; _Compare = main()::__lambda0]'
/usr/include/c++/4.8/bits/stl_algo.h:5500:55:   required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = char (*)[30]; _Compare = main()::__lambda0]'
amplasare_cuvinte.cpp:108:6:   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 amplasare_cuvinte.cpp:4:
/usr/include/c++/4.8/bits/stl_algo.h:2164:17: error: invalid array assignment
        *__first = _GLIBCXX_MOVE(__val);
                 ^
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 amplasare_cuvinte.cpp:1:
/usr/include/c++/4.8/bits/stl_heap.h: In instantiation of 'void std::make_heap(_RAIter, _RAIter, _Compare) [with _RAIter = char (*)[30]; _Compare = main()::__lambda0]':
/usr/include/c++/4.8/bits/stl_algo.h:1946:47:   required from 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = char (*)[30]; _Compare = main()::__lambda0]'
/usr/include/c++/4.8/bits/stl_algo.h:5349:59:   required from 'void std::partial_sort(_RAIter, _RAIter, _RAIter, _Compare) [with _RAIter = char (*)[30]; _Compare = main()::__lambda0]'
/usr/include/c++/4.8/bits/stl_algo.h:2332:68:   required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = char (*)[30]; _Size = int; _Compare = main()::__lambda0]'
/usr/include/c++/4.8/bits/stl_algo.h:5499:44:   required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = char (*)[30]; _Compare = main()::__lambda0]'
amplasare_cuvinte.cpp:108:6:   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 (*)[30]; _Compare = main()::__lambda0]':
/usr/include/c++/4.8/bits/stl_algo.h:1949:50:   required from 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = char (*)[30]; _Compare = main()::__lambda0]'
/usr/include/c++/4.8/bits/stl_algo.h:5349:59:   required from 'void std::partial_sort(_RAIter, _RAIter, _RAIter, _Compare) [with _RAIter = char (*)[30]; _Compare = main()::__lambda0]'
/usr/include/c++/4.8/bits/stl_algo.h:2332:68:   required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = char (*)[30]; _Size = int; _Compare = main()::__lambda0]'
/usr/include/c++/4.8/bits/stl_algo.h:5499:44:   required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = char (*)[30]; _Compare = main()::__lambda0]'
amplasare_cuvinte.cpp:108:6:   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 amplasare_cuvinte.cpp:4:
/usr/include/c++/4.8/bits/stl_heap.h:340:17: error: invalid array assignment
       *__result = _GLIBCXX_MOVE(*__first);
                 ^
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from amplasare_cuvinte.cpp:4:
/usr/include/c++/4.8/bits/stl_algo.h: At global scope:
/usr/include/c++/4.8/bits/stl_algo.h:2110:5: error: 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = char (*)[30]; _Compare = main()::__lambda0]', declared using local type 'main()::__lambda0', is used but never defined [-fpermissive]
     __unguarded_linear_insert(_RandomAccessIterator __last,
     ^
In file included from /usr/include/c++/4.8/bits/stl_algo.h:61:0,
                 from /usr/include/c++/4.8/algorithm:62,
                 from amplasare_cuvinte.cpp:4:
/usr/include/c++/4.8/bits/stl_heap.h:304:5: error: 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = char (*)[30]; _Distance = int; _Tp = char*; _Compare = main()::__lambda0]', declared using local type 'main()::__lambda0', is used but never defined [-fpermissive]
     __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
     ^

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 amplasare_cuvinte 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ă.