#4580
progresii
Se dau N
progresii aritmetice. Pentru fiecare se cunoaşte valoarea primului element şi raţia. Se mai dă o valoare X
.
Determinaţi numărul de şiruri strict crescătoare care au următoarele proprietăţi: primul termen are valoarea 0
, ultimul termen are valoarea X
, oricare doi termeni consecutivi sunt termeni consecutivi în cel puțin una dintre progresiile date.
Problema | progresii | Operații I/O |
progresii.in /progresii.out
|
---|---|---|---|
Limita timp | 0.1 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
Id soluție | #49142187 | Utilizator | |
Fișier | progresii.cpp | Dimensiune | 1.05 KB |
Data încărcării | 16 Februarie 2024, 17:25 | Scor / rezultat | Eroare de compilare |
progresii.cpp: In function 'int main()': progresii.cpp:35:50: error: no matching function for call to 'find(std::vector<int>::iterator, std::vector<int>::iterator)' if(find(g[next].begin(),g[next].end()),src)==g[next].end()) ^ progresii.cpp:35:50: note: candidates are: In file included from /usr/include/c++/4.8/bits/locale_facets.h:48:0, from /usr/include/c++/4.8/bits/basic_ios.h:37, from /usr/include/c++/4.8/ios:44, 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 progresii.cpp:1: /usr/include/c++/4.8/bits/streambuf_iterator.h:369:5: note: template<class _CharT2> typename __gnu_cxx::__enable_if<std::__is_char<_CharT2>::__value, std::istreambuf_iterator<_CharT> >::__type std::find(std::istreambuf_iterator<_CharT>, std::istreambuf_iterator<_CharT>, const _CharT2&) find(istreambuf_iterator<_CharT> __first, ^ /usr/include/c++/4.8/bits/streambuf_iterator.h:369:5: note: template argument deduction/substitution failed: progresii.cpp:35:50: note: '__gnu_cxx::__normal_iterator<int*, std::vector<int> >' is not derived from 'std::istreambuf_iterator<_CharT>' if(find(g[next].begin(),g[next].end()),src)==g[next].end()) ^ 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 progresii.cpp:1: /usr/include/c++/4.8/bits/stl_algo.h:4432:5: note: template<class _IIter, class _Tp> _IIter std::find(_IIter, _IIter, const _Tp&) find(_InputIterator __first, _InputIterator __last, ^ /usr/include/c++/4.8/bits/stl_algo.h:4432:5: note: template argument deduction/substitution failed: progresii.cpp:35:50: note: candidate expects 3 arguments, 2 provided if(find(g[next].begin(),g[next].end()),src)==g[next].end()) ^ progresii.cpp:35:56: error: expected primary-expression before '==' token if(find(g[next].begin(),g[next].end()),src)==g[next].end()) ^ progresii.cpp:35:71: error: expected ';' before ')' token if(find(g[next].begin(),g[next].end()),src)==g[next].end()) ^
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema progresii 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ă.