Detalii evaluare #55875141

Rezumat problemă

sum00

#939

Să se scrie un program care citeşte de la tastatura două numere naturale şi determină suma lor.

Detalii

Problema sum00 Operații I/O tastatură/ecran
Limita timp 0.1 secunde Limita memorie Total: 64 MB / Stivă 8 MB
Id soluție #55875141 Utilizator Rusnac Stefan (Troll_Romania)
Fișier sum00.cpp Dimensiune 1.15 KB
Data încărcării 29 Ianuarie 2025, 11:02 Scor / rezultat Eroare de compilare

Evaluare

Mesaj compilare

sum00.cpp:10:19: error: 'n' was not declared in this scope
      bool cmp(v,v+n){

                   ^
sum00.cpp:10:20: error: expression list treated as compound expression in initializer [-fpermissive]
      bool cmp(v,v+n){

                    ^
sum00.cpp:10:21: error: expected ',' or ';' before '{' token
      bool cmp(v,v+n){

                     ^
sum00.cpp: In function 'int main()':
sum00.cpp:32:18: warning: statement has no effect [-Wunused-value]
             sir[i];

                  ^
sum00.cpp:14:18: warning: unused variable 'm' [-Wunused-variable]
         int n,nr,m,q,maxi=-1,p,nrl,cmp,i;

                  ^
sum00.cpp:14:20: warning: unused variable 'q' [-Wunused-variable]
         int n,nr,m,q,maxi=-1,p,nrl,cmp,i;

                    ^
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from sum00.cpp:2:
/usr/include/c++/4.8/bits/stl_algo.h: In instantiation of 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = ura*; _Compare = int]':
/usr/include/c++/4.8/bits/stl_algo.h:2226:70:   required from 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = ura*; _Compare = int]'
/usr/include/c++/4.8/bits/stl_algo.h:5500:55:   required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = ura*; _Compare = int]'
sum00.cpp:40:23:   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 = ura*; _Compare = int]':
/usr/include/c++/4.8/bits/stl_algo.h:5349:59:   required from 'void std::partial_sort(_RAIter, _RAIter, _RAIter, _Compare) [with _RAIter = ura*; _Compare = int]'
/usr/include/c++/4.8/bits/stl_algo.h:2332:68:   required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = ura*; _Size = int; _Compare = int]'
/usr/include/c++/4.8/bits/stl_algo.h:5499:44:   required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = ura*; _Compare = int]'
sum00.cpp:40:23:   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 = ura*; _Compare = int]':
/usr/include/c++/4.8/bits/stl_algo.h:2295:13:   required from '_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = ura*; _Compare = int]'
/usr/include/c++/4.8/bits/stl_algo.h:2337:62:   required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = ura*; _Size = int; _Compare = int]'
/usr/include/c++/4.8/bits/stl_algo.h:5499:44:   required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = ura*; _Compare = int]'
sum00.cpp:40:23:   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 = ura*; _Tp = ura; _Compare = int]':
/usr/include/c++/4.8/bits/stl_algo.h:2296:78:   required from '_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = ura*; _Compare = int]'
/usr/include/c++/4.8/bits/stl_algo.h:2337:62:   required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = ura*; _Size = int; _Compare = int]'
/usr/include/c++/4.8/bits/stl_algo.h:5499:44:   required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = ura*; _Compare = int]'
sum00.cpp:40:23:   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 sum00.cpp:2:
/usr/include/c++/4.8/bits/stl_heap.h: In instantiation of 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = ura*; _Distance = int; _Tp = ura; _Compare = int]':
/usr/include/c++/4.8/bits/stl_heap.h:448:15:   required from 'void std::make_heap(_RAIter, _RAIter, _Compare) [with _RAIter = ura*; _Compare = int]'
/usr/include/c++/4.8/bits/stl_algo.h:1946:47:   required from 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = ura*; _Compare = int]'
/usr/include/c++/4.8/bits/stl_algo.h:5349:59:   required from 'void std::partial_sort(_RAIter, _RAIter, _RAIter, _Compare) [with _RAIter = ura*; _Compare = int]'
/usr/include/c++/4.8/bits/stl_algo.h:2332:68:   required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = ura*; _Size = int; _Compare = int]'
/usr/include/c++/4.8/bits/stl_algo.h:5499:44:   required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = ura*; _Compare = int]'
sum00.cpp:40:23:   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 sum00 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!