Rezumat problemă

SortareUnghi

#931

Se dau puncte distincte în plan. Asociem fiecărui punct semidreapta care pornește din originea sistemului de coordonate și trece prin acel punct. Să se afișeze punctele în ordine crescătoare a unghiului pe care semidreapta asociată îl face cu semidreapta spre plus infinit a axei OX. Dacă două unghiuri sunt egale se va afișa punctul cel mai apropiat de origine.

Fișiere Marius Nicoli (mariusn) Marius Nicoli medie

Clasa 10 Probleme diverse Geometrie

Rezolvă

Detalii

Problema	SortareUnghi	Operații I/O	sortareunghi.in/sortareunghi.out
Limita timp	0.1 secunde	Limita memorie	Total: 64 MB / Stivă 8 MB
Id soluție	#57291442	Utilizator	Raul Minzicu (RaulRaul12345432)
Fișier	sortareunghi.cpp	Dimensiune	902 B
Data încărcării	24 Martie 2025, 16:19	Scor / rezultat	Eroare de compilare

Evaluare

Mesaj compilare

sortareunghi.cpp: In function 'int main()':
sortareunghi.cpp:36:69: error: no matching function for call to 'make_pair(<brace-enclosed initializer list>, std::pair<double, double>)'
         v[i] = make_pair({x, y}, make_pair(atan2(x, y), hypot(x, y)));

                                                                     ^
sortareunghi.cpp:36:69: note: candidate is:
In file included from /usr/include/c++/4.8/bits/stl_algobase.h:64: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/istream:38,
                 from /usr/include/c++/4.8/fstream:38,
                 from sortareunghi.cpp:1:
/usr/include/c++/4.8/bits/stl_pair.h:276:5: note: template<class _T1, class _T2> constexpr std::pair<typename std::__decay_and_strip<_Tp>::__type, typename std::__decay_and_strip<_T2>::__type> std::make_pair(_T1&&, _T2&&)
     make_pair(_T1&& __x, _T2&& __y)
     ^
/usr/include/c++/4.8/bits/stl_pair.h:276:5: note:   template argument deduction/substitution failed:
sortareunghi.cpp:36:69: note:   couldn't deduce template parameter '_T1'
         v[i] = make_pair({x, y}, make_pair(atan2(x, y), hypot(x, y)));

                                                                     ^
In file included from /usr/include/c++/4.8/bits/stl_algobase.h:64: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/istream:38,
                 from /usr/include/c++/4.8/fstream:38,
                 from sortareunghi.cpp:1:
/usr/include/c++/4.8/bits/stl_pair.h: In instantiation of 'constexpr std::pair<_T1, _T2>::pair() [with _T1 = p; _T2 = std::pair<double, double>]':
/usr/include/c++/4.8/bits/stl_construct.h:75:7:   required from 'void std::_Construct(_T1*, _Args&& ...) [with _T1 = std::pair<p, std::pair<double, double> >; _Args = {}]'
/usr/include/c++/4.8/bits/stl_uninitialized.h:495:43:   required from 'static void std::__uninitialized_default_n_1<_TrivialValueType>::__uninit_default_n(_ForwardIterator, _Size) [with _ForwardIterator = std::pair<p, std::pair<double, double> >*; _Size = unsigned int; bool _TrivialValueType = false]'
/usr/include/c++/4.8/bits/stl_uninitialized.h:544:33:   required from 'void std::__uninitialized_default_n(_ForwardIterator, _Size) [with _ForwardIterator = std::pair<p, std::pair<double, double> >*; _Size = unsigned int]'
/usr/include/c++/4.8/bits/stl_uninitialized.h:605:50:   required from 'void std::__uninitialized_default_n_a(_ForwardIterator, _Size, std::allocator<_Tp>&) [with _ForwardIterator = std::pair<p, std::pair<double, double> >*; _Size = unsigned int; _Tp = std::pair<p, std::pair<double, double> >]'
/usr/include/c++/4.8/bits/stl_vector.h:1225:28:   required from 'void std::vector<_Tp, _Alloc>::_M_default_initialize(std::vector<_Tp, _Alloc>::size_type) [with _Tp = std::pair<p, std::pair<double, double> >; _Alloc = std::allocator<std::pair<p, std::pair<double, double> > >; std::vector<_Tp, _Alloc>::size_type = unsigned int]'
/usr/include/c++/4.8/bits/stl_vector.h:271:34:   required from 'std::vector<_Tp, _Alloc>::vector(std::vector<_Tp, _Alloc>::size_type, const allocator_type&) [with _Tp = std::pair<p, std::pair<double, double> >; _Alloc = std::allocator<std::pair<p, std::pair<double, double> > >; std::vector<_Tp, _Alloc>::size_type = unsigned int; std::vector<_Tp, _Alloc>::allocator_type = std::allocator<std::pair<p, std::pair<double, double> > >]'
sortareunghi.cpp:33:24:   required from here
/usr/include/c++/4.8/bits/stl_pair.h:109:25: error: no matching function for call to 'p::p()'
       : first(), second() { }
                         ^
/usr/include/c++/4.8/bits/stl_pair.h:109:25: note: candidates are:
sortareunghi.cpp:13:5: note: p::p(int, int)
     p(int a, int o)

     ^
sortareunghi.cpp:13:5: note:   candidate expects 2 arguments, 0 provided
sortareunghi.cpp:11:8: note: constexpr p::p(const p&)
 struct p{

        ^
sortareunghi.cpp:11:8: note:   candidate expects 1 argument, 0 provided
sortareunghi.cpp:11:8: note: constexpr p::p(p&&)
sortareunghi.cpp:11:8: note:   candidate expects 1 argument, 0 provided

Cum funcționează evaluarea?