Borderou de evaluare (job #1318604)
Utilizator | Data | 16 ianuarie 2015 10:14:07 | |
---|---|---|---|
Problema | Hashuri | Status | done |
Runda | Arhiva educationala | Compilator | cpp | Vezi sursa |
Scor | 0 |
Raport evaluator
Eroare de compilare:
user.cpp: In function ‘void insert(int)’:
user.cpp:9:5: error: reference to ‘hash’ is ambiguous
hash[val%key].push_back(val);
^
user.cpp:5:14: note: candidates are: std::vector<int> hash [666013]
vector <int> hash[key];
^
In file included from /usr/include/c++/4.8/bits/stl_bvector.h:1134:0,
from /usr/include/c++/4.8/vector:65,
from user.cpp:2:
/usr/include/c++/4.8/bits/functional_hash.h:58:12: note: template<class _Tp> struct std::hash
struct hash;
^
user.cpp: In function ‘void clear(int)’:
user.cpp:15:14: error: reference to ‘hash’ is ambiguous
int nrel=hash[poz].size();
^
user.cpp:5:14: note: candidates are: std::vector<int> hash [666013]
vector <int> hash[key];
^
In file included from /usr/include/c++/4.8/bits/stl_bvector.h:1134:0,
from /usr/include/c++/4.8/vector:65,
from user.cpp:2:
/usr/include/c++/4.8/bits/functional_hash.h:58:12: note: template<class _Tp> struct std::hash
struct hash;
^
user.cpp:18:12: error: reference to ‘hash’ is ambiguous
if(hash[poz][i]==val)
^
user.cpp:5:14: note: candidates are: std::vector<int> hash [666013]
vector <int> hash[key];
^
In file included from /usr/include/c++/4.8/bits/stl_bvector.h:1134:0,
from /usr/include/c++/4.8/vector:65,
from user.cpp:2:
/usr/include/c++/4.8/bits/functional_hash.h:58:12: note: template<class _Tp> struct std::hash
struct hash;
^
user.cpp:19:13: error: reference to ‘hash’ is ambiguous
hash[poz][i]=-1;
^
user.cpp:5:14: note: candidates are: std::vector<int> hash [666013]
vector <int> hash[key];
^
In file included from /usr/include/c++/4.8/bits/stl_bvector.h:1134:0,
from /usr/include/c++/4.8/vector:65,
from user.cpp:2:
/usr/include/c++/4.8/bits/functional_hash.h:58:12: note: template<class _Tp> struct std::hash
struct hash;
^
Ceva nu functioneaza?
- Citeste despre borderoul de evaluare.
- Daca tot nu e bine, contacteaza-ne pe forum !