#3292
CountPal
Orice șir de caractere poate fi descompus în palindromuri într-unul sau mai multe moduri. Dându-se un șir de caractere format numai din litere mici, să se determine numărul de moduri de a descompune șirul în palindromuri.
Folclorul informatic
Problema | CountPal | Operații I/O | tastatură/ecran |
---|---|---|---|
Limita timp | 0.1 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
Id soluție | #51619274 | Utilizator | |
Fișier | countpal.cpp | Dimensiune | 1.12 KB |
Data încărcării | 22 Iulie 2024, 17:43 | Scor / rezultat | Eroare de compilare |
countpal.cpp: In function 'int main()': countpal.cpp:9:28: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(int j=1; j<=s.size(); j++){ ^ countpal.cpp:11:35: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(int i=0; i<s.size(); i++) ^ countpal.cpp:15:35: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(int i=0; i<s.size(); i++){ ^ countpal.cpp:16:33: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] if(j+i-1<s.size()){ ^ countpal.cpp:19:78: error: no matching function for call to 'max(short int&, int)' dp[i][i+j-1]=max(dp[i][i+j-1], doi+dp[i+1][i+j-2]); ^ countpal.cpp:19:78: note: candidates are: 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/sstream:38, from /usr/include/c++/4.8/complex:45, from /usr/include/c++/4.8/ccomplex:38, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:52, from countpal.cpp:1: /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) ^ /usr/include/c++/4.8/bits/stl_algobase.h:216:5: note: template argument deduction/substitution failed: countpal.cpp:19:78: note: deduced conflicting types for parameter 'const _Tp' ('short int' and 'int') dp[i][i+j-1]=max(dp[i][i+j-1], doi+dp[i+1][i+j-2]); ^ 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/sstream:38, from /usr/include/c++/4.8/complex:45, from /usr/include/c++/4.8/ccomplex:38, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:52, from countpal.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:260:5: note: template argument deduction/substitution failed: countpal.cpp:19:78: note: deduced conflicting types for parameter 'const _Tp' ('short int' and 'int') dp[i][i+j-1]=max(dp[i][i+j-1], doi+dp[i+1][i+j-2]); ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from countpal.cpp:1: /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) ^ /usr/include/c++/4.8/bits/stl_algo.h:4231:5: note: template argument deduction/substitution failed: countpal.cpp:19:78: note: mismatched types 'std::initializer_list<_Tp>' and 'short int' dp[i][i+j-1]=max(dp[i][i+j-1], doi+dp[i+1][i+j-2]); ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from countpal.cpp:1: /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:4236:5: note: template argument deduction/substitution failed: countpal.cpp:19:78: note: mismatched types 'std::initializer_list<_Tp>' and 'short int' dp[i][i+j-1]=max(dp[i][i+j-1], doi+dp[i+1][i+j-2]); ^ countpal.cpp:29:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(int i=1; i<s.size(); i++){ ^
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema CountPal 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ă.