Borderou de evaluare (job #2238826)
Utilizator | Data | 7 septembrie 2018 20:04:21 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Status | done |
Runda | Arhiva educationala | Compilator | cpp | Vezi sursa |
Scor | 0 |
Raport evaluator
Eroare de compilare:
user.cpp: In function ‘int main()’:
user.cpp:38:26: error: no matching function for call to ‘std::priority_queue<std::pair<long long int, int> >::push(ll, int&)’
q.push(-best[i],i);
^
In file included from /usr/include/c++/6/queue:64:0,
from /usr/include/x86_64-linux-gnu/c++/6/32/bits/stdc++.h:86,
from user.cpp:1:
/usr/include/c++/6/bits/stl_queue.h:558:7: note: candidate: void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = std::pair<long long int, int>; _Sequence = std::vector<std::pair<long long int, int>, std::allocator<std::pair<long long int, int> > >; _Compare = std::less<std::pair<long long int, int> >; std::priority_queue<_Tp, _Sequence, _Compare>::value_type = std::pair<long long int, int>]
push(const value_type& __x)
^~~~
/usr/include/c++/6/bits/stl_queue.h:558:7: note: candidate expects 1 argument, 2 provided
/usr/include/c++/6/bits/stl_queue.h:566:7: note: candidate: void std::priority_queue<_Tp, _Sequence, _Compare>::push(std::priority_queue<_Tp, _Sequence, _Compare>::value_type&&) [with _Tp = std::pair<long long int, int>; _Sequence = std::vector<std::pair<long long int, int>, std::allocator<std::pair<long long int, int> > >; _Compare = std::less<std::pair<long long int, int> >; std::priority_queue<_Tp, _Sequence, _Compare>::value_type = std::pair<long long int, int>]
push(value_type&& __x)
^~~~
/usr/include/c++/6/bits/stl_queue.h:566:7: note: candidate expects 1 argument, 2 provided
user.cpp:50:26: error: expected primary-expression before ‘)’ token
if(best[nod]+)
^
user.cpp:51:9: error: expected primary-expression before ‘}’ token
}
^
user.cpp:49:17: warning: unused variable ‘nou’ [-Wunused-variable]
int nou=it.nod;
^~~
Ceva nu functioneaza?
- Citeste despre borderoul de evaluare.
- Daca tot nu e bine, contacteaza-ne pe forum !