#2572
Se citește un număr n
și apoi n
numere naturale. Să se verifice pentru fiecare număr dacă este pătrat perfect.
Problema | Patrat Perfect | Operații I/O |
![]() |
---|---|---|---|
Limita timp | 0.2 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
Id soluție | #43668479 | Utilizator | |
Fișier | patrat_perfect.cpp | Dimensiune | 357 B |
Data încărcării | 09 Mai 2023, 13:17 | Scor / rezultat | Eroare de compilare |
patrat_perfect.cpp: In function 'int main()': patrat_perfect.cpp:10:10: warning: statement has no effect [-Wunused-value] for(i==1;i<=n;i++) ^ patrat_perfect.cpp: In lambda function: patrat_perfect.cpp:14:18: error: expected '{' before ')' token if((k-[k])==0) ^ patrat_perfect.cpp: In function 'int main()': patrat_perfect.cpp:14:14: error: no match for 'operator-' (operand types are 'float' and 'main()::__lambda0') if((k-[k])==0) ^ patrat_perfect.cpp:14:14: note: candidates are: In file included from /usr/include/c++/4.8/bits/stl_algobase.h:67: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 patrat_perfect.cpp:1: /usr/include/c++/4.8/bits/stl_iterator.h:327:5: note: template<class _Iterator> typename std::reverse_iterator<_Iterator>::difference_type std::operator-(const std::reverse_iterator<_Iterator>&, const std::reverse_iterator<_Iterator>&) operator-(const reverse_iterator<_Iterator>& __x, ^ /usr/include/c++/4.8/bits/stl_iterator.h:327:5: note: template argument deduction/substitution failed: patrat_perfect.cpp:14:18: note: mismatched types 'const std::reverse_iterator<_Iterator>' and 'float' if((k-[k])==0) ^ In file included from /usr/include/c++/4.8/bits/stl_algobase.h:67: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 patrat_perfect.cpp:1: /usr/include/c++/4.8/bits/stl_iterator.h:379:5: note: template<class _IteratorL, class _IteratorR> decltype ((__y.base() - __x.base())) std::operator-(const std::reverse_iterator<_Iterator>&, const std::reverse_iterator<_IteratorR>&) operator-(const reverse_iterator<_IteratorL>& __x, ^ /usr/include/c++/4.8/bits/stl_iterator.h:379:5: note: template argument deduction/substitution failed: patrat_perfect.cpp:14:18: note: mismatched types 'const std::reverse_iterator<_Iterator>' and 'float' if((k-[k])==0) ^ In file included from /usr/include/c++/4.8/bits/stl_algobase.h:67: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 patrat_perfect.cpp:1: /usr/include/c++/4.8/bits/stl_iterator.h:1104:5: note: template<class _IteratorL, class _IteratorR> decltype ((__x.base() - __y.base())) std::operator-(const std::move_iterator<_Iterator>&, const std::move_iterator<_IteratorR>&) operator-(const move_iterator<_IteratorL>& __x, ^ /usr/include/c++/4.8/bits/stl_iterator.h:1104:5: note: template argument deduction/substitution failed: patrat_perfect.cpp:14:18: note: mismatched types 'const std::move_iterator<_Iterator>' and 'float' if((k-[k])==0) ^ In file included from /usr/include/c++/4.8/bits/stl_algobase.h:67: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 patrat_perfect.cpp:1: /usr/include/c++/4.8/bits/stl_iterator.h:1111:5: note: template<class _Iterator> decltype ((__x.base() - __y.base())) std::operator-(const std::move_iterator<_Iterator>&, const std::move_iterator<_Iterator>&) operator-(const move_iterator<_Iterator>& __x, ^ /usr/include/c++/4.8/bits/stl_iterator.h:1111:5: note: template argument deduction/substitution failed: patrat_perfect.cpp:14:18: note: mismatched types 'const std::move_iterator<_Iterator>' and 'float' if((k-[k])==0) ^
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema Patrat Perfect 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ă.