Borderou de evaluare (job #1437415)
Utilizator | Data | 17 mai 2015 17:25:16 | |
---|---|---|---|
Problema | Bile | Status | done |
Runda | Arhiva de probleme | Compilator | cpp | Vezi sursa |
Scor | 0 |
Raport evaluator
Eroare de compilare:
user.cpp: In function ‘void init()’:
user.cpp:19:4: error: reference to ‘rank’ is ambiguous
rank[i][j] = 0;
^
user.cpp:8:5: note: candidates are: int rank [251][251]
int rank[nmax + 1][nmax + 1];
^
In file included from /usr/include/c++/4.8/bits/move.h:57:0,
from /usr/include/c++/4.8/bits/stl_pair.h:59,
from /usr/include/c++/4.8/bits/stl_algobase.h:64,
from /usr/include/c++/4.8/bits/char_traits.h:39,
from /usr/include/c++/4.8/ios:40,
from /usr/include/c++/4.8/istream:38,
from /usr/include/c++/4.8/fstream:38,
from user.cpp:1:
/usr/include/c++/4.8/type_traits:1243:12: note: template<class> struct std::rank
struct rank
^
user.cpp: In function ‘void unite(int, int, int, int)’:
user.cpp:64:5: error: reference to ‘rank’ is ambiguous
if(rank[l1][c1] < rank[l2][c2])
^
user.cpp:8:5: note: candidates are: int rank [251][251]
int rank[nmax + 1][nmax + 1];
^
In file included from /usr/include/c++/4.8/bits/move.h:57:0,
from /usr/include/c++/4.8/bits/stl_pair.h:59,
from /usr/include/c++/4.8/bits/stl_algobase.h:64,
from /usr/include/c++/4.8/bits/char_traits.h:39,
from /usr/include/c++/4.8/ios:40,
from /usr/include/c++/4.8/istream:38,
from /usr/include/c++/4.8/fstream:38,
from user.cpp:1:
/usr/include/c++/4.8/type_traits:1243:12: note: template<class> struct std::rank
struct rank
^
user.cpp:64:20: error: reference to ‘rank’ is ambiguous
if(rank[l1][c1] < rank[l2][c2])
^
user.cpp:8:5: note: candidates are: int rank [251][251]
int rank[nmax + 1][nmax + 1];
^
In file included from /usr/include/c++/4.8/bits/move.h:57:0,
from /usr/include/c++/4.8/bits/stl_pair.h:59,
from /usr/include/c++/4.8/bits/stl_algobase.h:64,
from /usr/include/c++/4.8/bits/char_traits.h:39,
from /usr/include/c++/4.8/ios:40,
from /usr/include/c++/4.8/istream:38,
from /usr/include/c++/4.8/fstream:38,
from user.cpp:1:
Ceva nu functioneaza?
- Citeste despre borderoul de evaluare.
- Daca tot nu e bine, contacteaza-ne pe forum !