Borderou de evaluare (job #2910631)
Utilizator | Data | 23 iunie 2022 02:41:00 | |
---|---|---|---|
Problema | Taxa | Status | done |
Runda | Arhiva de probleme | Compilator | cpp-64 | Vezi sursa |
Scor | 0 |
Raport evaluator
Eroare de compilare:
main.cpp:14:1: error: expected unqualified-id before 'const'
14 | const int dy[]={1,-1,0,0,1,-1,1,-1};
| ^~~~~
main.cpp: In function 'int main()':
main.cpp:47:33: error: 'dy' was not declared in this scope; did you mean 'y'?
47 | if (check(x+dx[i],y+dy[i]))
| ^~
| y
main.cpp:57:30: error: no matching function for call to 'std::queue<std::pair<int, int> >::push(<brace-enclosed initializer list>)'
57 | q.push({x+dx[i],y+dy[i]});
| ^
In file included from /usr/include/c++/10/queue:64,
from main.cpp:2:
/usr/include/c++/10/bits/stl_queue.h:265:7: note: candidate: 'void std::queue<_Tp, _Sequence>::push(const value_type&) [with _Tp = std::pair<int, int>; _Sequence = std::deque<std::pair<int, int>, std::allocator<std::pair<int, int> > >; std::queue<_Tp, _Sequence>::value_type = std::pair<int, int>]'
265 | push(const value_type& __x)
| ^~~~
/usr/include/c++/10/bits/stl_queue.h:265:30: note: no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'const value_type&' {aka 'const std::pair<int, int>&'}
265 | push(const value_type& __x)
| ~~~~~~~~~~~~~~~~~~^~~
/usr/include/c++/10/bits/stl_queue.h:270:7: note: candidate: 'void std::queue<_Tp, _Sequence>::push(std::queue<_Tp, _Sequence>::value_type&&) [with _Tp = std::pair<int, int>; _Sequence = std::deque<std::pair<int, int>, std::allocator<std::pair<int, int> > >; std::queue<_Tp, _Sequence>::value_type = std::pair<int, int>]'
270 | push(value_type&& __x)
| ^~~~
/usr/include/c++/10/bits/stl_queue.h:270:25: note: no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'std::queue<std::pair<int, int> >::value_type&&' {aka 'std::pair<int, int>&&'}
270 | push(value_type&& __x)
| ~~~~~~~~~~~~~^~~
Non zero exit status: 1
Ceva nu functioneaza?
- Citeste despre borderoul de evaluare.
- Daca tot nu e bine, contacteaza-ne pe forum !