Rezumat problemă

Numereiajb

#1237

Numerele iajb sunt numerele care pot fi scrise sub forma i * a + j * b. Cunoscând a și b și un număr n, să se determine valorile i și j pentru care se vor forma primele n numere iajb in ordine crescătoare.

Fișiere Văran Tudor (tudorvaran) Tudor Văran dificilă

Clasa 10 Structuri de date liniare Coada

Rezolvă

Detalii

Problema	Numereiajb	Operații I/O	numereiajb.in/numereiajb.out
Limita timp	1.6 secunde	Limita memorie	Total: 64 MB / Stivă 8 MB
Id soluție	#63699898	Utilizator	Vasile David (oocaprisun)
Fișier	numereiajb.cpp	Dimensiune	637 B
Data încărcării	15 Martie 2026, 20:58	Scor/rezultat	Eroare de compilare

Evaluare

Mesaj compilare

numereiajb.cpp: In function 'int main()':
numereiajb.cpp:15:14: error: expected unqualified-id before '[' token
         auto [val, p] = q.top();

              ^
numereiajb.cpp:16:14: error: expected unqualified-id before '[' token
         auto [i, j] = p;

              ^
numereiajb.cpp:19:17: error: 'i' was not declared in this scope
         cout << i << " " << j << "\n";

                 ^
numereiajb.cpp:19:29: error: 'j' was not declared in this scope
         cout << i << " " << j << "\n";

                             ^
numereiajb.cpp:21:49: error: no matching function for call to 'std::priority_queue<std::pair<long long int, std::pair<int, int> >, std::vector<std::pair<long long int, std::pair<int, int> > >, std::greater<std::pair<long long int, std::pair<int, int> > > >::push(<brace-enclosed initializer list>)'
         q.push({(i + 1) * a + j * b, {i + 1, j}});

                                                 ^
numereiajb.cpp:21:49: note: candidates are:
In file included from /usr/include/c++/4.8/queue:64:0,
                 from numereiajb.cpp:2:
/usr/include/c++/4.8/bits/stl_queue.h:496:7: note: void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = std::pair<long long int, std::pair<int, int> >; _Sequence = std::vector<std::pair<long long int, std::pair<int, int> > >; _Compare = std::greater<std::pair<long long int, std::pair<int, int> > >; std::priority_queue<_Tp, _Sequence, _Compare>::value_type = std::pair<long long int, std::pair<int, int> >]
       push(const value_type& __x)
       ^
/usr/include/c++/4.8/bits/stl_queue.h:496:7: note:   no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'const value_type& {aka const std::pair<long long int, std::pair<int, int> >&}'
/usr/include/c++/4.8/bits/stl_queue.h:504:7: note: void std::priority_queue<_Tp, _Sequence, _Compare>::push(std::priority_queue<_Tp, _Sequence, _Compare>::value_type&&) [with _Tp = std::pair<long long int, std::pair<int, int> >; _Sequence = std::vector<std::pair<long long int, std::pair<int, int> > >; _Compare = std::greater<std::pair<long long int, std::pair<int, int> > >; std::priority_queue<_Tp, _Sequence, _Compare>::value_type = std::pair<long long int, std::pair<int, int> >]
       push(value_type&& __x)
       ^
/usr/include/c++/4.8/bits/stl_queue.h:504:7: note:   no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'std::priority_queue<std::pair<long long int, std::pair<int, int> >, std::vector<std::pair<long long int, std::pair<int, int> > >, std::greater<std::pair<long long int, std::pair<int, int> > > >::value_type&& {aka std::pair<long long int, std::pair<int, int> >&&}'
numereiajb.cpp:22:49: error: no matching function for call to 'std::priority_queue<std::pair<long long int, std::pair<int, int> >, std::vector<std::pair<long long int, std::pair<int, int> > >, std::greater<std::pair<long long int, std::pair<int, int> > > >::push(<brace-enclosed initializer list>)'
         q.push({i * a + (j + 1) * b, {i, j + 1}});

                                                 ^
numereiajb.cpp:22:49: note: candidates are:
In file included from /usr/include/c++/4.8/queue:64:0,
                 from numereiajb.cpp:2:
/usr/include/c++/4.8/bits/stl_queue.h:496:7: note: void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = std::pair<long long int, std::pair<int, int> >; _Sequence = std::vector<std::pair<long long int, std::pair<int, int> > >; _Compare = std::greater<std::pair<long long int, std::pair<int, int> > >; std::priority_queue<_Tp, _Sequence, _Compare>::value_type = std::pair<long long int, std::pair<int, int> >]
       push(const value_type& __x)
       ^
/usr/include/c++/4.8/bits/stl_queue.h:496:7: note:   no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'const value_type& {aka const std::pair<long long int, std::pair<int, int> >&}'
/usr/include/c++/4.8/bits/stl_queue.h:504:7: note: void std::priority_queue<_Tp, _Sequence, _Compare>::push(std::priority_queue<_Tp, _Sequence, _Compare>::value_type&&) [with _Tp = std::pair<long long int, std::pair<int, int> >; _Sequence = std::vector<std::pair<long long int, std::pair<int, int> > >; _Compare = std::greater<std::pair<long long int, std::pair<int, int> > >; std::priority_queue<_Tp, _Sequence, _Compare>::value_type = std::pair<long long int, std::pair<int, int> >]
       push(value_type&& __x)
       ^
/usr/include/c++/4.8/bits/stl_queue.h:504:7: note:   no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'std::priority_queue<std::pair<long long int, std::pair<int, int> >, std::vector<std::pair<long long int, std::pair<int, int> > >, std::greater<std::pair<long long int, std::pair<int, int> > > >::value_type&& {aka std::pair<long long int, std::pair<int, int> >&&}'

Cum funcționează evaluarea?