Borderou de evaluare (job #1107700)
Utilizator | Data | 14 februarie 2014 09:40:00 | |
---|---|---|---|
Problema | Memcpy | Status | done |
Runda | Arhiva de probleme | Compilator | cpp | Vezi sursa |
Scor | 0 |
Raport evaluator
Eroare de compilare:
user.cpp: In function ‘int main()’:
user.cpp:33:5: error: reference to ‘hash’ is ambiguous
hash=0; mod=1e9+7;
^
user.cpp:6:31: note: candidates are: int hash
int n,m,x,y,nx,ny,dx,dy,i,j,k,hash,mod;
^
In file included from /usr/local/include/c++/4.8.0/bits/stl_bvector.h:1134:0,
from /usr/local/include/c++/4.8.0/vector:65,
from user.cpp:3:
/usr/local/include/c++/4.8.0/bits/functional_hash.h:58:12: note: template<class _Tp> struct std::hash
struct hash;
^
user.cpp:36:9: error: reference to ‘hash’ is ambiguous
hash+=1LL*(i+1)*v[i].first*v[i].second%mod;
^
user.cpp:6:31: note: candidates are: int hash
int n,m,x,y,nx,ny,dx,dy,i,j,k,hash,mod;
^
In file included from /usr/local/include/c++/4.8.0/bits/stl_bvector.h:1134:0,
from /usr/local/include/c++/4.8.0/vector:65,
from user.cpp:3:
/usr/local/include/c++/4.8.0/bits/functional_hash.h:58:12: note: template<class _Tp> struct std::hash
struct hash;
^
user.cpp:37:9: error: reference to ‘hash’ is ambiguous
hash%=mod;
^
user.cpp:6:31: note: candidates are: int hash
int n,m,x,y,nx,ny,dx,dy,i,j,k,hash,mod;
^
In file included from /usr/local/include/c++/4.8.0/bits/stl_bvector.h:1134:0,
from /usr/local/include/c++/4.8.0/vector:65,
from user.cpp:3:
/usr/local/include/c++/4.8.0/bits/functional_hash.h:58:12: note: template<class _Tp> struct std::hash
struct hash;
^
user.cpp:39:19: error: reference to ‘hash’ is ambiguous
printf("%d\n",hash);
^
user.cpp:6:31: note: candidates are: int hash
int n,m,x,y,nx,ny,dx,dy,i,j,k,hash,mod;
^
In file included from /usr/local/include/c++/4.8.0/bits/stl_bvector.h:1134:0,
from /usr/local/include/c++/4.8.0/vector:65,
from user.cpp:3:
/usr/local/include/c++/4.8.0/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 !