Borderou de evaluare (job #1882130)
Utilizator | Data | 16 februarie 2017 23:07:22 | |
---|---|---|---|
Problema | Sortare prin comparare | Status | done |
Runda | Arhiva educationala | Compilator | cpp | Vezi sursa |
Scor | 0 |
Raport evaluator
Eroare de compilare:
user.cpp: In function ‘int Part(int, int)’:
user.cpp:11:13: error: reference to ‘array’ is ambiguous
pivot = array[index];
^
user.cpp:5:8: note: candidates are: int array [500004]
int N, array[500004];
^
In file included from /usr/include/c++/4.8/tuple:39:0,
from /usr/include/c++/4.8/functional:55,
from /usr/include/c++/4.8/bits/stl_algo.h:66,
from /usr/include/c++/4.8/algorithm:62,
from user.cpp:2:
/usr/include/c++/4.8/array:81:12: note: template<class _Tp, unsigned int _Nm> struct std::array
struct array
^
user.cpp:15:24: error: reference to ‘array’ is ambiguous
do {++i;}while(array[i] < pivot);
^
user.cpp:5:8: note: candidates are: int array [500004]
int N, array[500004];
^
In file included from /usr/include/c++/4.8/tuple:39:0,
from /usr/include/c++/4.8/functional:55,
from /usr/include/c++/4.8/bits/stl_algo.h:66,
from /usr/include/c++/4.8/algorithm:62,
from user.cpp:2:
/usr/include/c++/4.8/array:81:12: note: template<class _Tp, unsigned int _Nm> struct std::array
struct array
^
user.cpp:16:24: error: reference to ‘array’ is ambiguous
do {--j;}while(array[j] > pivot);
^
user.cpp:5:8: note: candidates are: int array [500004]
int N, array[500004];
^
In file included from /usr/include/c++/4.8/tuple:39:0,
from /usr/include/c++/4.8/functional:55,
from /usr/include/c++/4.8/bits/stl_algo.h:66,
from /usr/include/c++/4.8/algorithm:62,
from user.cpp:2:
/usr/include/c++/4.8/array:81:12: note: template<class _Tp, unsigned int _Nm> struct std::array
struct array
^
user.cpp:18:18: error: reference to ‘array’ is ambiguous
swap(array[i], array[j]);
^
user.cpp:5:8: note: candidates are: int array [500004]
int N, array[500004];
^
In file included from /usr/include/c++/4.8/tuple:39:0,
Ceva nu functioneaza?
- Citeste despre borderoul de evaluare.
- Daca tot nu e bine, contacteaza-ne pe forum !