0_0_19230892_27577.cpp: In function 'void solve(Card*, int)':
0_0_19230892_27577.cpp:34:263: error: reference to 'count' is ambiguous
int i=0; i<14; i++) if(value[i]>=4) solve_flag[1]=1; else if(value[i]==3) v++; else if(value[i]==2) y++; if(v&&y==1) solve_flag[2]=1; if(v&&!y) solve_flag[5]=1; if(!v&&y==2) solve_flag[6]=1; if(!v&&y==1) solve_flag[7]=1; if(x<count) for(
^
0_0_19230892_27577.cpp:22:14: note: candidates are: int count
int flag[15],count,value[15], solve_flag[10];
^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/algorithm:62:0,
from 0_0_19230892_27577.cpp:5:
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_algo.h:3947:5: note: template<class _IIter, class _Tp> typename std::iterator_traits<_Iterator>::difference_type std::count(_IIter, _IIter, const _Tp&)
count(_InputIterator __first, _InputIterator __last, const _Tp& __value)
^
0_0_19230892_27577.cpp: In function 'int main()':
0_0_19230892_27577.cpp:39:19: error: reference to 'count' is ambiguous
char c,s[100]; count=0; while(scanf("%c",&c)!=EOF) { if(c=='\n'||count>9) { if(c!='\n') gets(s); count=count-5; printf("Hand: "); for(
^
0_0_19230892_27577.cpp:22:14: note: candidates are: int count
int flag[15],count,value[15], solve_flag[10];
^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/algorithm:62:0,
from 0_0_19230892_27577.cpp:5:
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_algo.h:3947:5: note: template<class _IIter, class _Tp> typename std::iterator_traits<_Iterator>::difference_type std::count(_IIter, _IIter, const _Tp&)
count(_InputIterator __first, _InputIterator __last, const _Tp& __value)
^
0_0_19230892_27577.cpp:39:82: error: reference to 'count' is ambiguous
char c,s[100]; count=0; while(scanf("%c",&c)!=EOF) { if(c=='\n'||count>9) { if(c!='\n') gets(s); count=count-5; printf("Hand: "); for(
^
0_0_19230892_27577.cpp:22:14: note: candidates are: int count
int flag[15],count,value[15], solve_flag[10];
^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/algorithm:62:0,
from 0_0_19230892_27577.cpp:5:
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_algo.h:3947:5: note: template<class _IIter, class _Tp> typename std::iterator_traits<_Iterator>::difference_type std::count(_IIter, _IIter, const _Tp&)
count(_InputIterator __first, _InputIterator __last, const _Tp& __value)
^
0_0_19230892_27577.cpp:39:143: error: reference to 'count' is ambiguous
char c,s[100]; count=0; while(scanf("%c",&c)!=EOF) { if(c=='\n'||count>9) { if(c!='\n') gets(s); count=count-5; printf("Hand: "); for(
^
0_0_19230892_27577.cpp:22:14: note: candidates are: int count
int flag[15],count,value[15], solve_flag[10];
^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/algorithm:62:0,
from 0_0_19230892_27577.cpp:5:
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_algo.h:3947:5: note: template<class _IIter, class _Tp> typename std::iterator_traits<_Iterator>::difference_type std::count(_IIter, _IIter, const _Tp&)
count(_InputIterator __first, _InputIterator __last, const _Tp& __value)
^
0_0_19230892_27577.cpp:39:149: error: reference to 'count' is ambiguous
char c,s[100]; count=0; while(scanf("%c",&c)!=EOF) { if(c=='\n'||count>9) { if(c!='\n') gets(s); count=count-5; printf("Hand: "); for(
^
0_0_19230892_27577.cpp:22:14: note: candidates are: int count
int flag[15],count,value[15], solve_flag[10];
^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/algorithm:62:0,
from 0_0_19230892_27577.cpp:5:
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_algo.h:3947:5: note: template<class _IIter, class _Tp> typename std::iterator_traits<_Iterator>::difference_type std::count(_IIter, _IIter, const _Tp&)
count(_InputIterator __first, _InputIterator __last, const _Tp& __value)
^
0_0_19230892_27577.cpp:41:12: error: reference to 'count' is ambiguous
int i=0; i<count; i++) printf("%c%c ",q[i].num,q[i].flower); if(c!='\n') printf("%s ",s); printf("Best hand: "); memset(solve_flag,0,sizeof(solve_flag)); solve_flag[8]=1; solve(p,0); for(
^
0_0_19230892_27577.cpp:22:14: note: candidates are: int count
int flag[15],count,value[15], solve_flag[10];
^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/algorithm:62:0,
from 0_0_19230892_27577.cpp:5:
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_algo.h:3947:5: note: template<class _IIter, class _Tp> typename std::iterator_traits<_Iterator>::difference_type std::count(_IIter, _IIter, const _Tp&)
count(_InputIterator __first, _InputIterator __last, const _Tp& __value)
^
0_0_19230892_27577.cpp:42:166: error: reference to 'count' is ambiguous
int i=0; i<9; i++) if(solve_flag[i]) { cout<<s_name[i]<<endl; break; } count=0; } else if(c!=' ') { Card k; k.num=c; scanf("%c",&c); k.flower=c; k.num_flag=0; if(count<=4) p[count]=k; else q[count-5]=k; count++; } } return 0;}
^
0_0_19230892_27577.cpp:22:14: note: candidates are: int count
int flag[15],count,value[15], solve_flag[10];
^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/algorithm:62:0,
from 0_0_19230892_27577.cpp:5:
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_algo.h:3947:5: note: template<class _IIter, class _Tp> typename std::iterator_traits<_Iterator>::difference_type std::count(_IIter, _IIter, const _Tp&)
count(_InputIterator __first, _InputIterator __last, const _Tp& __value)
^
0_0_19230892_27577.cpp:42:344: error: reference to 'count' is ambiguous
int i=0; i<9; i++) if(solve_flag[i]) { cout<<s_name[i]<<endl; break; } count=0; } else if(c!=' ') { Card k; k.num=c; scanf("%c",&c); k.flower=c; k.num_flag=0; if(count<=4) p[count]=k; else q[count-5]=k; count++; } } return 0;}
^
0_0_19230892_27577.cpp:22:14: note: candidates are: int count
int flag[15],count,value[15], solve_flag[10];
^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/algorithm:62:0,
from 0_0_19230892_27577.cpp:5:
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_algo.h:3947:5: note: template<class _IIter, class _Tp> typename std::iterator_traits<_Iterator>::difference_type std::count(_IIter, _IIter, const _Tp&)
count(_InputIterator __first, _InputIterator __last, const _Tp& __value)
^
0_0_19230892_27577.cpp:42:356: error: reference to 'count' is ambiguous
int i=0; i<9; i++) if(solve_flag[i]) { cout<<s_name[i]<<endl; break; } count=0; } else if(c!=' ') { Card k; k.num=c; scanf("%c",&c); k.flower=c; k.num_flag=0; if(count<=4) p[count]=k; else q[count-5]=k; count++; } } return 0;}
^
0_0_19230892_27577.cpp:22:14: note: candidates are: int count
int flag[15],count,value[15], solve_flag[10];
^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/algorithm:62:0,
|
