Borderou de evaluare (job #1880837)
Utilizator | Data | 15 februarie 2017 22:31:46 | |
---|---|---|---|
Problema | Elementul majoritar | Status | done |
Runda | Arhiva educationala | Compilator | cpp | Vezi sursa |
Scor | 0 |
Raport evaluator
Eroare de compilare:
user.cpp: In function ‘int Majority()’:
user.cpp:31:11: error: reference to ‘array’ is ambiguous
QuickSort(array, 0, N - 1);
^
user.cpp:7:5: note: candidates are: int array [1000000]
int array[1000000];
^
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:3:
/usr/include/c++/4.8/array:81:12: note: template<class _Tp, unsigned int _Nm> struct std::array
struct array
^
user.cpp:36:20: error: reference to ‘array’ is ambiguous
while(j < N && array[j + 1] == array[i]) j++;
^
user.cpp:7:5: note: candidates are: int array [1000000]
int array[1000000];
^
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:3:
/usr/include/c++/4.8/array:81:12: note: template<class _Tp, unsigned int _Nm> struct std::array
struct array
^
user.cpp:36:36: error: reference to ‘array’ is ambiguous
while(j < N && array[j + 1] == array[i]) j++;
^
user.cpp:7:5: note: candidates are: int array [1000000]
int array[1000000];
^
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:3:
/usr/include/c++/4.8/array:81:12: note: template<class _Tp, unsigned int _Nm> struct std::array
struct array
^
user.cpp:39:16: error: reference to ‘array’ is ambiguous
return array[i];
^
user.cpp:7:5: note: candidates are: int array [1000000]
int array[1000000];
^
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 !