#56
Se citesc numere de la tastatură până la apariția lui zero. Să se determine câte perechi de elemente citite consecutiv se termină cu aceeași cifră.
| Problema | NumararePerechi | Operații I/O |
tastatură/ecran
|
|---|---|---|---|
| Limita timp | 0.1 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
| Id soluție | #59607217 | Utilizator | |
| Fișier | numarareperechi.cpp | Dimensiune | 320 B |
| Data încărcării | 04 Octombrie 2025, 16:52 | Scor/rezultat | Eroare de compilare |
numarareperechi.cpp: In function 'int main()': numarareperechi.cpp:7:12: error: reference to 'prev' is ambiguous cin >> prev; ^ numarareperechi.cpp:4:8: note: candidates are: int prev int x, prev, c, a, b; ^ In file included from /usr/include/c++/4.8/bits/stl_algobase.h:66:0, 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/ostream:38, from /usr/include/c++/4.8/iostream:39, from numarareperechi.cpp:1: /usr/include/c++/4.8/bits/stl_iterator_base_funcs.h:193:5: note: template<class _BidirectionalIterator> _BidirectionalIterator std::prev(_BidirectionalIterator, typename std::iterator_traits<_Iter>::difference_type) prev(_BidirectionalIterator __x, typename ^ numarareperechi.cpp:10:13: error: reference to 'prev' is ambiguous a = prev % 10; if (a < 0) a = -a; ^ numarareperechi.cpp:4:8: note: candidates are: int prev int x, prev, c, a, b; ^ In file included from /usr/include/c++/4.8/bits/stl_algobase.h:66:0, 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/ostream:38, from /usr/include/c++/4.8/iostream:39, from numarareperechi.cpp:1: /usr/include/c++/4.8/bits/stl_iterator_base_funcs.h:193:5: note: template<class _BidirectionalIterator> _BidirectionalIterator std::prev(_BidirectionalIterator, typename std::iterator_traits<_Iter>::difference_type) prev(_BidirectionalIterator __x, typename ^ numarareperechi.cpp:13:9: error: reference to 'prev' is ambiguous prev = x; ^ numarareperechi.cpp:4:8: note: candidates are: int prev int x, prev, c, a, b; ^ In file included from /usr/include/c++/4.8/bits/stl_algobase.h:66:0, 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/ostream:38, from /usr/include/c++/4.8/iostream:39, from numarareperechi.cpp:1: /usr/include/c++/4.8/bits/stl_iterator_base_funcs.h:193:5: note: template<class _BidirectionalIterator> _BidirectionalIterator std::prev(_BidirectionalIterator, typename std::iterator_traits<_Iter>::difference_type) prev(_BidirectionalIterator __x, typename ^
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema NumararePerechi 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ă.