Detalii evaluare #58099880

Rezumat problemă

Să se calculeze suma a două matrice rare .

Detalii

Problema Matrice_Rara Operații I/O matrice_rara.in/matrice_rara.out
Limita timp 1 secunde Limita memorie Total: 64 MB / Stivă 8 MB
Id soluție #58099880 Utilizator 6BSigartau Stefan (0742102052)
Fișier matrice_rara.cpp Dimensiune 1.01 KB
Data încărcării 14 Mai 2025, 09:26 Scor / rezultat Eroare de compilare

Evaluare

Mesaj compilare

matrice_rara.cpp:14:11: error: 'sd' was not declared in this scope
 bool cmp (sd x,sd y)

           ^
matrice_rara.cpp:14:16: error: 'sd' was not declared in this scope
 bool cmp (sd x,sd y)

                ^
matrice_rara.cpp:14:20: error: expression list treated as compound expression in initializer [-fpermissive]
 bool cmp (sd x,sd y)

                    ^
matrice_rara.cpp:15:1: error: expected ',' or ';' before '{' token
 {

 ^
matrice_rara.cpp: In function 'int main()':
matrice_rara.cpp:49:20: error: expected primary-expression before ']' token
             v[j]=a[]

                    ^
matrice_rara.cpp:50:9: error: expected ';' before '}' token
         }

         ^
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64,
                 from matrice_rara.cpp:1:
/usr/include/c++/4.8/bits/stl_algo.h: In instantiation of 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = mr*; _Compare = bool]':
/usr/include/c++/4.8/bits/stl_algo.h:2226:70:   required from 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = mr*; _Compare = bool]'
/usr/include/c++/4.8/bits/stl_algo.h:5500:55:   required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = mr*; _Compare = bool]'
matrice_rara.cpp:36:24:   required from here
/usr/include/c++/4.8/bits/stl_algo.h:2159:29: error: '__comp' cannot be used as a function
    if (__comp(*__i, *__first))
                             ^
/usr/include/c++/4.8/bits/stl_algo.h: In instantiation of 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = mr*; _Compare = bool]':
/usr/include/c++/4.8/bits/stl_algo.h:5349:59:   required from 'void std::partial_sort(_RAIter, _RAIter, _RAIter, _Compare) [with _RAIter = mr*; _Compare = bool]'
/usr/include/c++/4.8/bits/stl_algo.h:2332:68:   required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = mr*; _Size = int; _Compare = bool]'
/usr/include/c++/4.8/bits/stl_algo.h:5499:44:   required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = mr*; _Compare = bool]'
matrice_rara.cpp:36:24:   required from here
/usr/include/c++/4.8/bits/stl_algo.h:1948:27: error: '__comp' cannot be used as a function
  if (__comp(*__i, *__first))
                           ^
/usr/include/c++/4.8/bits/stl_algo.h: In instantiation of 'void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = mr*; _Compare = bool]':
/usr/include/c++/4.8/bits/stl_algo.h:2295:13:   required from '_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = mr*; _Compare = bool]'
/usr/include/c++/4.8/bits/stl_algo.h:2337:62:   required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = mr*; _Size = int; _Compare = bool]'
/usr/include/c++/4.8/bits/stl_algo.h:5499:44:   required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = mr*; _Compare = bool]'
matrice_rara.cpp:36:24:   required from here
/usr/include/c++/4.8/bits/stl_algo.h:114:28: error: '__comp' cannot be used as a function
       if (__comp(*__a, *__b))
                            ^
/usr/include/c++/4.8/bits/stl_algo.h:116:25: error: '__comp' cannot be used as a function
    if (__comp(*__b, *__c))
                         ^
/usr/include/c++/4.8/bits/stl_algo.h:118:30: error: '__comp' cannot be used as a function
    else if (__comp(*__a, *__c))
                              ^
/usr/include/c++/4.8/bits/stl_algo.h:123:33: error: '__comp' cannot be used as a function
       else if (__comp(*__a, *__c))
                                 ^
/usr/include/c++/4.8/bits/stl_algo.h:125:33: error: '__comp' cannot be used as a function
       else if (__comp(*__b, *__c))
                                 ^
/usr/include/c++/4.8/bits/stl_algo.h: In instantiation of '_RandomAccessIterator std::__unguarded_partition(_RandomAccessIterator, _RandomAccessIterator, const _Tp&, _Compare) [with _RandomAccessIterator = mr*; _Tp = mr; _Compare = bool]':
/usr/include/c++/4.8/bits/stl_algo.h:2296:78:   required from '_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = mr*; _Compare = bool]'
/usr/include/c++/4.8/bits/stl_algo.h:2337:62:   required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = mr*; _Size = int; _Compare = bool]'
/usr/include/c++/4.8/bits/stl_algo.h:5499:44:   required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = mr*; _Compare = bool]'
matrice_rara.cpp:36:24:   required from here
/usr/include/c++/4.8/bits/stl_algo.h:2263:35: error: '__comp' cannot be used as a function
    while (__comp(*__first, __pivot))
                                   ^
/usr/include/c++/4.8/bits/stl_algo.h:2266:34: error: '__comp' cannot be used as a function
    while (__comp(__pivot, *__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 /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64,
                 from matrice_rara.cpp:1:
/usr/include/c++/4.8/bits/stl_heap.h: In instantiation of 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = mr*; _Distance = int; _Tp = mr; _Compare = bool]':
/usr/include/c++/4.8/bits/stl_heap.h:448:15:   required from 'void std::make_heap(_RAIter, _RAIter, _Compare) [with _RAIter = mr*; _Compare = bool]'
/usr/include/c++/4.8/bits/stl_algo.h:1946:47:   required from 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = mr*; _Compare = bool]'
/usr/include/c++/4.8/bits/stl_algo.h:5349:59:   required from 'void std::partial_sort(_RAIter, _RAIter, _RAIter, _Compare) [with _RAIter = mr*; _Compare = bool]'
/usr/include/c++/4.8/bits/stl_algo.h:2332:68:   required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = mr*; _Size = int; _Compare = bool]'
/usr/include/c++/4.8/bits/stl_algo.h:5499:44:   required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = mr*; _Compare = bool]'
matrice_rara.cpp:36:24:   required from here
/usr/include/c++/4.8/bits/stl_heap.h:313:40: error: '__comp' cannot be used as a function
        *(__first + (__secondChild - 1))))
                                        ^

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

Du-te sus!