#1515
gradina
Păcală a reușit să ducă la bun sfârșit înțelegerea cu boierul căruia-i fusese slugă și, conform învoielii, boierul trebuie să-l răsplătească dându-i o parte din livada sa cu pomi fructiferi. Boierul este un om foarte ordonat, așa că livada sa este un pătrat cu latura de N
metri unde, pe vremuri, fuseseră plantate N
rânduri cu câte N
pomi fiecare. Orice pom fructifer putea fi identificat cunoscând numărul rândului pe care se află și poziția sa în cadrul rândului respectiv. Cu timpul, unii pomi s-au uscat şi acum mai sunt doar P
pomi. Păcală trebuie să-și delimiteze în livadă o grădină pătrată cu latura de K
metri.
ONI 2013, Clasa a IX-a
Problema | gradina | Operații I/O |
gradina.in /gradina.out
|
---|---|---|---|
Limita timp | 0.5 secunde | Limita memorie |
Total: 16 MB
/
Stivă 8 MB
|
Id soluție | #50101999 | Utilizator | |
Fișier | gradina.cpp | Dimensiune | 692 B |
Data încărcării | 27 Martie 2024, 09:38 | Scor / rezultat | Eroare de compilare |
gradina.cpp: In function 'int main()': gradina.cpp:24:53: error: reference to 'max' is ambiguous if (v[i][j]-v[i-k][j]-v[i][j-k]+v[i-k][j-k]>max) {max=v[i][j]-v[i-k][j]-v[i][j-k]+v[i-k][j-k]; cnt=1;} ^ gradina.cpp:9:29: note: candidates are: int max int n,p,k,v[1001][1001],x,y,max=0,cnt=1; ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from gradina.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h:4236:5: note: template<class _Tp, class _Compare> _Tp std::max(std::initializer_list<_Tp>, _Compare) max(initializer_list<_Tp> __l, _Compare __comp) ^ /usr/include/c++/4.8/bits/stl_algo.h:4231:5: note: template<class _Tp> _Tp std::max(std::initializer_list<_Tp>) max(initializer_list<_Tp> __l) ^ In file included from /usr/include/c++/4.8/bits/char_traits.h:39:0, 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 gradina.cpp:1: /usr/include/c++/4.8/bits/stl_algobase.h:260:5: note: template<class _Tp, class _Compare> const _Tp& std::max(const _Tp&, const _Tp&, _Compare) max(const _Tp& __a, const _Tp& __b, _Compare __comp) ^ /usr/include/c++/4.8/bits/stl_algobase.h:216:5: note: template<class _Tp> const _Tp& std::max(const _Tp&, const _Tp&) max(const _Tp& __a, const _Tp& __b) ^ gradina.cpp:24:59: error: reference to 'max' is ambiguous if (v[i][j]-v[i-k][j]-v[i][j-k]+v[i-k][j-k]>max) {max=v[i][j]-v[i-k][j]-v[i][j-k]+v[i-k][j-k]; cnt=1;} ^ gradina.cpp:9:29: note: candidates are: int max int n,p,k,v[1001][1001],x,y,max=0,cnt=1; ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from gradina.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h:4236:5: note: template<class _Tp, class _Compare> _Tp std::max(std::initializer_list<_Tp>, _Compare) max(initializer_list<_Tp> __l, _Compare __comp) ^ /usr/include/c++/4.8/bits/stl_algo.h:4231:5: note: template<class _Tp> _Tp std::max(std::initializer_list<_Tp>) max(initializer_list<_Tp> __l) ^ In file included from /usr/include/c++/4.8/bits/char_traits.h:39:0, 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 gradina.cpp:1: /usr/include/c++/4.8/bits/stl_algobase.h:260:5: note: template<class _Tp, class _Compare> const _Tp& std::max(const _Tp&, const _Tp&, _Compare) max(const _Tp& __a, const _Tp& __b, _Compare __comp) ^ /usr/include/c++/4.8/bits/stl_algobase.h:216:5: note: template<class _Tp> const _Tp& std::max(const _Tp&, const _Tp&) max(const _Tp& __a, const _Tp& __b) ^ gradina.cpp:25:16: error: 'w' was not declared in this scope else if(w[i][j]-w[i-k][j]-w[i][j-k]+w[i-k][j-k]==max) cnt++; ^ gradina.cpp:25:57: error: reference to 'max' is ambiguous else if(w[i][j]-w[i-k][j]-w[i][j-k]+w[i-k][j-k]==max) cnt++; ^ gradina.cpp:9:29: note: candidates are: int max int n,p,k,v[1001][1001],x,y,max=0,cnt=1; ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from gradina.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h:4236:5: note: template<class _Tp, class _Compare> _Tp std::max(std::initializer_list<_Tp>, _Compare) max(initializer_list<_Tp> __l, _Compare __comp) ^ /usr/include/c++/4.8/bits/stl_algo.h:4231:5: note: template<class _Tp> _Tp std::max(std::initializer_list<_Tp>) max(initializer_list<_Tp> __l) ^ In file included from /usr/include/c++/4.8/bits/char_traits.h:39:0, 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 gradina.cpp:1: /usr/include/c++/4.8/bits/stl_algobase.h:260:5: note: template<class _Tp, class _Compare> const _Tp& std::max(const _Tp&, const _Tp&, _Compare) max(const _Tp& __a, const _Tp& __b, _Compare __comp) ^ /usr/include/c++/4.8/bits/stl_algobase.h:216:5: note: template<class _Tp> const _Tp& std::max(const _Tp&, const _Tp&) max(const _Tp& __a, const _Tp& __b) ^ gradina.cpp:28:9: error: reference to 'max' is ambiguous cout<<max<<endl<<cnt; ^ gradina.cpp:9:29: note: candidates are: int max int n,p,k,v[1001][1001],x,y,max=0,cnt=1; ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from gradina.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h:4236:5: note: template<class _Tp, class _Compare> _Tp std::max(std::initializer_list<_Tp>, _Compare) max(initializer_list<_Tp> __l, _Compare __comp) ^ /usr/include/c++/4.8/bits/stl_algo.h:4231:5: note: template<class _Tp> _Tp std::max(std::initializer_list<_Tp>) max(initializer_list<_Tp> __l) ^ In file included from /usr/include/c++/4.8/bits/char_traits.h:39:0, 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 gradina.cpp:1: /usr/include/c++/4.8/bits/stl_algobase.h:260:5: note: template<class _Tp, class _Compare> const _Tp& std::max(const _Tp&, const _Tp&, _Compare) max(const _Tp& __a, const _Tp& __b, _Compare __comp) ^ /usr/include/c++/4.8/bits/stl_algobase.h:216:5: note: template<class _Tp> const _Tp& std::max(const _Tp&, const _Tp&) max(const _Tp& __a, const _Tp& __b) ^
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema gradina face parte din prima categorie. Soluția propusă de tine va fi evaluată astfel:
Suma punctajelor acordate pe testele utilizate pentru verificare este 100. Astfel, soluția ta poate obține cel mult 100 de puncte, caz în care se poate considera corectă.