Rezumat problemă

sum00

#939

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

Consola Candale Silviu (silviu) ușoară

Clasa 9 Elemente de baza ale limbajului Operatori și expresii

Rezolvă

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	#63429070	Utilizator	Pirvan Maria (printelus)
Fișier	sum00.cpp	Dimensiune	2.59 KB
Data încărcării	03 Martie 2026, 11:31	Scor/rezultat	Eroare de compilare

Evaluare

Mesaj compilare

sum00.cpp:18:19: error: expected type-specifier before '(' token
     bool operator (> (int x, int y){

                   ^
sum00.cpp: In function 'void citire()':
sum00.cpp:50:29: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (j=0; j<strlen(s); j++){

                             ^
sum00.cpp: In function 'bool sortare_topologica()':
sum00.cpp:104:35: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int j=0; j<G[x].size(); j++){

                                   ^
In file included from /usr/include/c++/4.8/queue:62:0,
                 from sum00.cpp:4:
/usr/include/c++/4.8/bits/stl_heap.h: In instantiation of 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<int*, std::vector<int> >; _Distance = int; _Tp = int; _Compare = comp]':
/usr/include/c++/4.8/bits/stl_heap.h:448:15:   required from 'void std::make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<int*, std::vector<int> >; _Compare = comp]'
/usr/include/c++/4.8/bits/stl_queue.h:411:48:   required from 'std::priority_queue<_Tp, _Sequence, _Compare>::priority_queue(const _Compare&, _Sequence&&) [with _Tp = int; _Sequence = std::vector<int>; _Compare = comp]'
sum00.cpp:22:43:   required from here
/usr/include/c++/4.8/bits/stl_heap.h:313:40: error: no match for call to '(comp) (int&, int&)'
        *(__first + (__secondChild - 1))))
                                        ^
/usr/include/c++/4.8/bits/stl_heap.h: In instantiation of 'void std::__push_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<int*, std::vector<int> >; _Distance = int; _Tp = int; _Compare = comp]':
/usr/include/c++/4.8/bits/stl_heap.h:222:58:   required from 'void std::push_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<int*, std::vector<int> >; _Compare = comp]'
/usr/include/c++/4.8/bits/stl_queue.h:499:41:   required from 'void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = int; _Sequence = std::vector<int>; _Compare = comp; std::priority_queue<_Tp, _Sequence, _Compare>::value_type = int]'
sum00.cpp:90:31:   required from here
/usr/include/c++/4.8/bits/stl_heap.h:183:47: error: no match for call to '(comp) (int&, int&)'
       && __comp(*(__first + __parent), __value))
                                               ^

Cum funcționează evaluarea?