Acest site foloseşte cookies. Navigând în continuare, vă exprimaţi acordul asupra folosirii cookie-urilor.
Detalii evaluare #50890381
Rezumat problemă
#3164
qclasa
Se dau n, reprezentând numărul de elevi apoi, pe câte un rând, datele fiecărui elev: codul (număr natural de maxim 4 cifre), media la informatică (număr natural de la 1 la 10) și numărul de absențe. Definiți un tip structură pentru a putea memora datele unui elev și rezolvați cerințele:
a) memorați datele tuturor elevilor într-un vector de structuri de tipul definit;
b) afișați numărul de elevi cu media 10
c) afișați media clasei (se va afișa doar partea întreagă a ei).
d) afișați primii doi elevi după absențe (elevii cu cele mai multe absențe). Dacă sunt mai mulți elevi cu același număr de absențe se afișează în ordine crescătoare a codului. Dacă sunt mai mult de doi elevi număr maxim de absențe se afișează doar doi.
- Fișiere
-
Marius Nicoli (mariusn)
- Nicoli Marius
- ușoară
Detalii
| Problema | qclasa | Operații I/O |
qclasa.in/qclasa.out
|
|---|---|---|---|
| Limita timp | 0.1 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
| Id soluție | #50890381 | Utilizator |
Rares Onet (Rares0net)
|
| Fișier | qclasa.cpp | Dimensiune | 1.56 KB |
| Data încărcării | 12 Mai 2024, 23:05 | Scor / rezultat | Eroare de compilare |
Evaluare
Mesaj compilare
qclasa.cpp: In function 'void SolveB()': qclasa.cpp:44:60: error: parameter declared 'auto' int ct=count_if(Vec.begin(), Vec.end(), [](const auto& elev) ^ qclasa.cpp: In lambda function: qclasa.cpp:46:23: error: 'elev' was not declared in this scope return get<1>(elev)==10; ^ qclasa.cpp: In function 'void SolveC()': qclasa.cpp:52:73: error: parameter declared 'auto' int S=accumulate(Vec.begin(), Vec.end(), 0, [](int acc, const auto& elev) ^ qclasa.cpp: In lambda function: qclasa.cpp:54:27: error: 'elev' was not declared in this scope return acc+get<1>(elev); ^ qclasa.cpp: In function 'void SolveD()': qclasa.cpp:61:49: error: parameter declared 'auto' sort(Vec.begin(), Vec.end(), [](const auto& a, const auto& b) ^ qclasa.cpp:61:64: error: parameter declared 'auto' sort(Vec.begin(), Vec.end(), [](const auto& a, const auto& b) ^ qclasa.cpp: In lambda function: qclasa.cpp:63:19: error: 'a' was not declared in this scope if(get<2>(a)!=get<2>(b)) ^ qclasa.cpp:63:30: error: 'b' was not declared in this scope if(get<2>(a)!=get<2>(b)) ^ qclasa.cpp:65:23: error: 'a' was not declared in this scope return get<0>(a)<get<0>(b); ^ qclasa.cpp:65:33: error: 'b' was not declared in this scope return get<0>(a)<get<0>(b); ^ qclasa.cpp: At global scope: qclasa.cpp:77:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type] main() ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from qclasa.cpp:10: /usr/include/c++/4.8/bits/stl_algo.h: In instantiation of 'typename std::iterator_traits<_Iterator>::difference_type std::count_if(_IIter, _IIter, _Predicate) [with _IIter = __gnu_cxx::__normal_iterator<std::tuple<int, int, int>*, std::vector<std::tuple<int, int, int> > >; _Predicate = SolveB()::__lambda0; typename std::iterator_traits<_Iterator>::difference_type = int]': qclasa.cpp:47:6: required from here /usr/include/c++/4.8/bits/stl_algo.h:4656:21: error: no match for call to '(SolveB()::__lambda0) (std::tuple<int, int, int>&)' if (__pred(*__first)) ^ qclasa.cpp:44:46: note: candidates are: int ct=count_if(Vec.begin(), Vec.end(), [](const auto& elev) ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from qclasa.cpp:10: /usr/include/c++/4.8/bits/stl_algo.h:4656:21: note: void (*)() <conversion> if (__pred(*__first)) ^ /usr/include/c++/4.8/bits/stl_algo.h:4656:21: note: candidate expects 1 argument, 2 provided qclasa.cpp:44:64: note: SolveB()::__lambda0 int ct=count_if(Vec.begin(), Vec.end(), [](const auto& elev) ^ qclasa.cpp:44:64: note: candidate expects 0 arguments, 1 provided In file included from /usr/include/c++/4.8/numeric:62:0, from qclasa.cpp:8: /usr/include/c++/4.8/bits/stl_numeric.h: In instantiation of '_Tp std::accumulate(_InputIterator, _InputIterator, _Tp, _BinaryOperation) [with _InputIterator = __gnu_cxx::__normal_iterator<std::tuple<int, int, int>*, std::vector<std::tuple<int, int, int> > >; _Tp = int; _BinaryOperation = SolveC()::__lambda1]': qclasa.cpp:55:6: required from here /usr/include/c++/4.8/bits/stl_numeric.h:154:39: error: no match for call to '(SolveC()::__lambda1) (int&, std::tuple<int, int, int>&)' __init = __binary_op(__init, *__first); ^ qclasa.cpp:52:50: note: candidates are: int S=accumulate(Vec.begin(), Vec.end(), 0, [](int acc, const auto& elev) ^ In file included from /usr/include/c++/4.8/numeric:62:0, from qclasa.cpp:8: /usr/include/c++/4.8/bits/stl_numeric.h:154:39: note: void (*)(int) <conversion> __init = __binary_op(__init, *__first); ^ /usr/include/c++/4.8/bits/stl_numeric.h:154:39: note: candidate expects 2 arguments, 3 provided qclasa.cpp:52:77: note: SolveC()::__lambda1 int S=accumulate(Vec.begin(), Vec.end(), 0, [](int acc, const auto& elev) ^ qclasa.cpp:52:77: note: candidate expects 1 argument, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from qclasa.cpp:10: /usr/include/c++/4.8/bits/stl_algo.h: In instantiation of 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::tuple<int, int, int>*, std::vector<std::tuple<int, int, int> > >; _Compare = SolveD()::__lambda2]': /usr/include/c++/4.8/bits/stl_algo.h:2226:70: required from 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::tuple<int, int, int>*, std::vector<std::tuple<int, int, int> > >; _Compare = SolveD()::__lambda2]' /usr/include/c++/4.8/bits/stl_algo.h:5500:55: required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<std::tuple<int, int, int>*, std::vector<std::tuple<int, int, int> > >; _Compare = SolveD()::__lambda2]' qclasa.cpp:66:6: required from here /usr/include/c++/4.8/bits/stl_algo.h:2159:29: error: no match for call to '(SolveD()::__lambda2) (std::tuple<int, int, int>&, std::tuple<int, int, int>&)' if (__comp(*__i, *__first)) ^ qclasa.cpp:61:35: note: candidates are: sort(Vec.begin(), Vec.end(), [](const auto& a, const auto& b) ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from qclasa.cpp:10: /usr/include/c++/4.8/bits/stl_algo.h:2159:29: note: void (*)() <conversion> if (__comp(*__i, *__first)) ^ /usr/include/c++/4.8/bits/stl_algo.h:2159:29: note: candidate expects 1 argument, 3 provided qclasa.cpp:61:65: note: SolveD()::__lambda2 sort(Vec.begin(), Vec.end(), [](const auto& a, const auto& b) ^ qclasa.cpp:61:65: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from qclasa.cpp:10: /usr/include/c++/4.8/bits/stl_algo.h: In instantiation of 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::tuple<int, int, int>*, std::vector<std::tuple<int, int, int> > >; _Compare = SolveD()::__lambda2]': /usr/include/c++/4.8/bits/stl_algo.h:5349:59: required from 'void std::partial_sort(_RAIter, _RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<std::tuple<int, int, int>*, std::vector<std::tuple<int, int, int> > >; _Compare = SolveD()::__lambda2]' /usr/include/c++/4.8/bits/stl_algo.h:2332:68: required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::tuple<int, int, int>*, std::vector<std::tuple<int, int, int> > >; _Size = int; _Compare = SolveD()::__lambda2]' /usr/include/c++/4.8/bits/stl_algo.h:5499:44: required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<std::tuple<int, int, int>*, std::vector<std::tuple<int, int, int> > >; _Compare = SolveD()::__lambda2]' qclasa.cpp:66:6: required from here /usr/include/c++/4.8/bits/stl_algo.h:1948:27: error: no match for call to '(SolveD()::__lambda2) (std::tuple<int, int, int>&, std::tuple<int, int, int>&)' if (__comp(*__i, *__first)) ^ qclasa.cpp:61:35: note: candidates are: sort(Vec.begin(), Vec.end(), [](const auto& a, const auto& b) ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from qclasa.cpp:10: /usr/include/c++/4.8/bits/stl_algo.h:1948:27: note: void (*)() <conversion> if (__comp(*__i, *__first)) ^ /usr/include/c++/4.8/bits/stl_algo.h:1948:27: note: candidate expects 1 argument, 3 provided qclasa.cpp:61:65: note: SolveD()::__lambda2 sort(Vec.begin(), Vec.end(), [](const auto& a, const auto& b) ^ qclasa.cpp:61:65: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from qclasa.cpp:10: /usr/include/c++/4.8/bits/stl_algo.h: In instantiation of 'void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = __gnu_cxx::__normal_iterator<std::tuple<int, int, int>*, std::vector<std::tuple<int, int, int> > >; _Compare = SolveD()::__lambda2]': /usr/include/c++/4.8/bits/stl_algo.h:2295:13: required from '_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::tuple<int, int, int>*, std::vector<std::tuple<int, int, int> > >; _Compare = SolveD()::__lambda2]' /usr/include/c++/4.8/bits/stl_algo.h:2337:62: required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::tuple<int, int, int>*, std::vector<std::tuple<int, int, int> > >; _Size = int; _Compare = SolveD()::__lambda2]' /usr/include/c++/4.8/bits/stl_algo.h:5499:44: required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<std::tuple<int, int, int>*, std::vector<std::tuple<int, int, int> > >; _Compare = SolveD()::__lambda2]' qclasa.cpp:66:6: required from here /usr/include/c++/4.8/bits/stl_algo.h:114:28: error: no match for call to '(SolveD()::__lambda2) (std::tuple<int, int, int>&, std::tuple<int, int, int>&)' if (__comp(*__a, *__b)) ^ qclasa.cpp:61:35: note: candidates are: sort(Vec.begin(), Vec.end(), [](const auto& a, const auto& b) ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from qclasa.cpp:10: /usr/include/c++/4.8/bits/stl_algo.h:114:28: note: void (*)() <conversion> if (__comp(*__a, *__b)) ^ /usr/include/c++/4.8/bits/stl_algo.h:114:28: note: candidate expects 1 argument, 3 provided qclasa.cpp:61:65: note: SolveD()::__lambda2 sort(Vec.begin(), Vec.end(), [](const auto& a, const auto& b) ^ qclasa.cpp:61:65: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from qclasa.cpp:10: /usr/include/c++/4.8/bits/stl_algo.h:116:25: error: no match for call to '(SolveD()::__lambda2) (std::tuple<int, int, int>&, std::tuple<int, int, int>&)' if (__comp(*__b, *__c)) ^ qclasa.cpp:61:35: note: candidates are: sort(Vec.begin(), Vec.end(), [](const auto& a, const auto& b) ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from qclasa.cpp:10: /usr/include/c++/4.8/bits/stl_algo.h:116:25: note: void (*)() <conversion> if (__comp(*__b, *__c)) ^ /usr/include/c++/4.8/bits/stl_algo.h:116:25: note: candidate expects 1 argument, 3 provided qclasa.cpp:61:65: note: SolveD()::__lambda2 sort(Vec.begin(), Vec.end(), [](const auto& a, const auto& b) ^ qclasa.cpp:61:65: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from qclasa.cpp:10: /usr/include/c++/4.8/bits/stl_algo.h:118:30: error: no match for call to '(SolveD()::__lambda2) (std::tuple<int, int, int>&, std::tuple<int, int, int>&)' else if (__comp(*__a, *__c)) ^ qclasa.cpp:61:35: note: candidates are: sort(Vec.begin(), Vec.end(), [](const auto& a, const auto& b) ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from qclasa.cpp:10: /usr/include/c++/4.8/bits/stl_algo.h:118:30: note: void (*)() <conversion> else if (__comp(*__a, *__c)) ^ /usr/include/c++/4.8/bits/stl_algo.h:118:30: note: candidate expects 1 argument, 3 provided qclasa.cpp:61:65: note: SolveD()::__lambda2 sort(Vec.begin(), Vec.end(), [](const auto& a, const auto& b) ^ qclasa.cpp:61:65: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from qclasa.cpp:10: /usr/include/c++/4.8/bits/stl_algo.h:123:33: error: no match for call to '(SolveD()::__lambda2) (std::tuple<int, int, int>&, std::tuple<int, int, int>&)' else if (__comp(*__a, *__c)) ^ qclasa.cpp:61:35: note: candidates are: sort(Vec.begin(), Vec.end(), [](const auto& a, const auto& b) ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from qclasa.cpp:10: /usr/include/c++/4.8/bits/stl_algo.h:123:33: note: void (*)() <conversion> else if (__comp(*__a, *__c)) ^ /usr/include/c++/4.8/bits/stl_algo.h:123:33: note: candidate expects 1 argument, 3 provided qclasa.cpp:61:65: note: SolveD()::__lambda2 sort(Vec.begin(), Vec.end(), [](const auto& a, const auto& b) ^ qclasa.cpp:61:65: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from qclasa.cpp:10: /usr/include/c++/4.8/bits/stl_algo.h:125:33: error: no match for call to '(SolveD()::__lambda2) (std::tuple<int, int, int>&, std::tuple<int, int, int>&)' else if (__comp(*__b, *__c)) ^ qclasa.cpp:61:35: note: candidates are: sort(Vec.begin(), Vec.end(), [](const auto& a, const auto& b) ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from qclasa.cpp:10: /usr/include/c++/4.8/bits/stl_algo.h:125:33: note: void (*)() <conversion> else if (__comp(*__b, *__c)) ^ /usr/include/c++/4.8/bits/stl_algo.h:125:33: note: candidate expects 1 argument, 3 provided qclasa.cpp:61:65: note: SolveD()::__lambda2 sort(Vec.begin(), Vec.end(), [](const auto& a, const auto& b) ^ qclasa.cpp:61:65: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from qclasa.cpp:10: /usr/include/c++/4.8/bits/stl_algo.h: In instantiation of '_RandomAccessIterator std::__unguarded_partition(_RandomAccessIterator, _RandomAccessIterator, const _Tp&, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::tuple<int, int, int>*, std::vector<std::tuple<int, int, int> > >; _Tp = std::tuple<int, int, int>; _Compare = SolveD()::__lambda2]': /usr/include/c++/4.8/bits/stl_algo.h:2296:78: required from '_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::tuple<int, int, int>*, std::vector<std::tuple<int, int, int> > >; _Compare = SolveD()::__lambda2]' /usr/include/c++/4.8/bits/stl_algo.h:2337:62: required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::tuple<int, int, int>*, std::vector<std::tuple<int, int, int> > >; _Size = int; _Compare = SolveD()::__lambda2]' /usr/include/c++/4.8/bits/stl_algo.h:5499:44: required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<std::tuple<int, int, int>*, std::vector<std::tuple<int, int, int> > >; _Compare = SolveD()::__lambda2]' qclasa.cpp:66:6: required from here /usr/include/c++/4.8/bits/stl_algo.h:2263:35: error: no match for call to '(SolveD()::__lambda2) (std::tuple<int, int, int>&, const std::tuple<int, int, int>&)' while (__comp(*__first, __pivot)) ^ qclasa.cpp:61:35: note: candidates are: sort(Vec.begin(), Vec.end(), [](const auto& a, const auto& b) ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from qclasa.cpp:10: /usr/include/c++/4.8/bits/stl_algo.h:2263:35: note: void (*)() <conversion> while (__comp(*__first, __pivot)) ^ /usr/include/c++/4.8/bits/stl_algo.h:2263:35: note: candidate expects 1 argument, 3 provided qclasa.cpp:61:65: note: SolveD()::__lambda2 sort(Vec.begin(), Vec.end(), [](const auto& a, const auto& b) ^ qclasa.cpp:61:65: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from qclasa.cpp:10: /usr/include/c++/4.8/bits/stl_algo.h:2266:34: error: no match for call to '(SolveD()::__lambda2) (const std::tuple<int, int, int>&, std::tuple<int, int, int>&)' while (__comp(__pivot, *__last)) ^ qclasa.cpp:61:35: note: candidates are: sort(Vec.begin(), Vec.end(), [](const auto& a, const auto& b) ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from qclasa.cpp:10: /usr/include/c++/4.8/bits/stl_algo.h:2266:34: note: void (*)() <conversion> while (__comp(__pivot, *__last)) ^ /usr/include/c++/4.8/bits/stl_algo.h:2266:34: note: candidate expects 1 argument, 3 provided qclasa.cpp:61:65: note: SolveD()::__lambda2 sort(Vec.begin(), Vec.end(), [](const auto& a, const auto& b) ^ qclasa.cpp:61:65: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/bits/stl_algo.h:61:0, from /usr/include/c++/4.8/algorithm:62, from qclasa.cpp:10: /usr/include/c++/4.8/bits/stl_heap.h: In instantiation of 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::tuple<int, int, int>*, std::vector<std::tuple<int, int, int> > >; _Distance = int; _Tp = std::tuple<int, int, int>; _Compare = SolveD()::__lambda2]': /usr/include/c++/4.8/bits/stl_heap.h:448:15: required from 'void std::make_heap(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<std::tuple<int, int, int>*, std::vector<std::tuple<int, int, int> > >; _Compare = SolveD()::__lambda2]' /usr/include/c++/4.8/bits/stl_algo.h:1946:47: required from 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::tuple<int, int, int>*, std::vector<std::tuple<int, int, int> > >; _Compare = SolveD()::__lambda2]' /usr/include/c++/4.8/bits/stl_algo.h:5349:59: required from 'void std::partial_sort(_RAIter, _RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<std::tuple<int, int, int>*, std::vector<std::tuple<int, int, int> > >; _Compare = SolveD()::__lambda2]' /usr/include/c++/4.8/bits/stl_algo.h:2332:68: required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::tuple<int, int, int>*, std::vector<std::tuple<int, int, int> > >; _Size = int; _Compare = SolveD()::__lambda2]' /usr/include/c++/4.8/bits/stl_algo.h:5499:44: required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<std::tuple<int, int, int>*, std::vector<std::tuple<int, int, int> > >; _Compare = SolveD()::__lambda2]' qclasa.cpp:66:6: required from here /usr/include/c++/4.8/bits/stl_heap.h:313:40: error: no match for call to '(SolveD()::__lambda2) (std::tuple<int, int, int>&, std::tuple<int, int, int>&)' *(__first + (__secondChild - 1)))) ^ qclasa.cpp:61:35: note: candidates are: sort(Vec.begin(), Vec.end(), [](const auto& a, const auto& b) ^ In file included from /usr/include/c++/4.8/bits/stl_algo.h:61:0, from /usr/include/c++/4.8/algorithm:62, from qclasa.cpp:10: /usr/include/c++/4.8/bits/stl_heap.h:313:40: note: void (*)() <conversion> *(__first + (__secondChild - 1)))) ^ /usr/include/c++/4.8/bits/stl_heap.h:313:40: note: candidate expects 1 argument, 3 provided qclasa.cpp:61:65: note: SolveD()::__lambda2 sort(Vec.begin(), Vec.end(), [](const auto& a, const auto& b) ^ qclasa.cpp:61:65: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from qclasa.cpp:10: /usr/include/c++/4.8/bits/stl_algo.h:2110:5: error: 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::tuple<int, int, int>*, std::vector<std::tuple<int, int, int> > >; _Compare = SolveD()::__lambda2]', declared using local type 'SolveD()::__lambda2', is used but never defined [-fpermissive] __unguarded_linear_insert(_RandomAccessIterator __last, ^ In file included from /usr/include/c++/4.8/bits/stl_algo.h:61:0, from /usr/include/c++/4.8/algorithm:62, from qclasa.cpp:10: /usr/include/c++/4.8/bits/stl_heap.h:331:5: error: 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::tuple<int, int, int>*, std::vector<std::tuple<int, int, int> > >; _Compare = SolveD()::__lambda2]', declared using local type 'SolveD()::__lambda2', is used but never defined [-fpermissive] __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, ^ /usr/include/c++/4.8/bits/stl_heap.h:178:5: error: 'void std::__push_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::tuple<int, int, int>*, std::vector<std::tuple<int, int, int> > >; _Distance = int; _Tp = std::tuple<int, int, int>; _Compare = SolveD()::__lambda2]', declared using local type 'SolveD()::__lambda2', is used but never defined [-fpermissive] __push_heap(_RandomAccessIterator __first, _Distance __holeIndex, ^
Cum funcționează evaluarea?
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
- probleme la care rezolvarea presupune scrierea unui program complet
- probleme la care rezolvarea presupune scrierea unei secvențe de program - câteva instrucțiuni, o listă de declarații, una sau mai multe funcții, etc.
Problema qclasa face parte din prima categorie. Soluția propusă de tine va fi evaluată astfel:
- Programul sursă este compilat folosind compilatorul corespunzător. Dacă în urma compilării se obțin erori sau avertismente, acestea sunt afișate în această pagină.
- Dacă programul a fost compilat, executabilul obținut va fi rulat, furnizându-i-se unul sau mai multe seturi de date de intrare, în concordanță cu restricțiile specifice problemei. Pentru fiecare set de date se obține un anumit punctaj, în raport cu corectitudinea soluției tale.
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ă.