Acest site foloseşte cookies. Navigând în continuare, vă exprimaţi acordul asupra folosirii cookie-urilor.
Detalii evaluare #51623116
Rezumat problemă
#4658
puzzle1
Maria a primit cadou de ziua ei o cutie cu piese de puzzle, etichetate cu numere naturale. Pentru a-l rezolva trebuie să lipească între ele, în ordinea în care le extrage din cutie, cât mai multe piese, formând astfel grupuri de piese. Cunoscând cele N numere naturale care se găsesc pe etichetele pieselor de joc, în ordinea în care aceste se extrag din cutie, să se determine:
1. Numărul de grupuri pe care le obține Maria după ce rezolvă jocul de puzzle;
2. Cele K numere înscrise pe etichetele grupurilor alese de Maria.
ONI 2024, clasa a 5-a
- Fișiere
-
Pracsiu Dan (dnprx)
- Raluca Costineanu
- concurs
Detalii
| Problema | puzzle1 | Operații I/O |
puzzle.in/puzzle.out
|
|---|---|---|---|
| Limita timp | 0.1 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
| Id soluție | #51623116 | Utilizator |
Rusu Anthony ツ (anthony_rusu)
|
| Fișier | puzzle1.cpp | Dimensiune | 2.62 KB |
| Data încărcării | 23 Iulie 2024, 13:39 | Scor / rezultat | Eroare de compilare |
Evaluare
Mesaj compilare
puzzle1.cpp: In function 'int main()': puzzle1.cpp:76:73: error: parameter declared 'auto' sort(sorted_groups.begin(), sorted_groups.end(), [](const auto &a, const auto &b) { ^ puzzle1.cpp:76:88: error: parameter declared 'auto' sort(sorted_groups.begin(), sorted_groups.end(), [](const auto &a, const auto &b) { ^ puzzle1.cpp: In lambda function: puzzle1.cpp:77:17: error: 'a' was not declared in this scope if (a.first != b.first) { ^ puzzle1.cpp:77:28: error: 'b' was not declared in this scope if (a.first != b.first) { ^ puzzle1.cpp:80:20: error: 'a' was not declared in this scope return a.second < b.second; ^ puzzle1.cpp:80:31: error: 'b' was not declared in this scope return a.second < b.second; ^ puzzle1.cpp: In function 'int main()': puzzle1.cpp:83:57: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for (int i = 0; i < K && i < sorted_groups.size(); i++) { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from puzzle1.cpp:5: /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::pair<int, std::basic_string<char> >*, std::vector<std::pair<int, std::basic_string<char> > > >; _Compare = main()::__lambda0]': /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::pair<int, std::basic_string<char> >*, std::vector<std::pair<int, std::basic_string<char> > > >; _Compare = main()::__lambda0]' /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::pair<int, std::basic_string<char> >*, std::vector<std::pair<int, std::basic_string<char> > > >; _Compare = main()::__lambda0]' puzzle1.cpp:81:10: required from here /usr/include/c++/4.8/bits/stl_algo.h:2159:29: error: no match for call to '(main()::__lambda0) (std::pair<int, std::basic_string<char> >&, std::pair<int, std::basic_string<char> >&)' if (__comp(*__i, *__first)) ^ puzzle1.cpp:76:59: note: candidates are: sort(sorted_groups.begin(), sorted_groups.end(), [](const auto &a, const auto &b) { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from puzzle1.cpp:5: /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 puzzle1.cpp:76:89: note: main()::__lambda0 sort(sorted_groups.begin(), sorted_groups.end(), [](const auto &a, const auto &b) { ^ puzzle1.cpp:76:89: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from puzzle1.cpp:5: /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::pair<int, std::basic_string<char> >*, std::vector<std::pair<int, std::basic_string<char> > > >; _Compare = main()::__lambda0]': /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::pair<int, std::basic_string<char> >*, std::vector<std::pair<int, std::basic_string<char> > > >; _Compare = main()::__lambda0]' /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::pair<int, std::basic_string<char> >*, std::vector<std::pair<int, std::basic_string<char> > > >; _Size = int; _Compare = main()::__lambda0]' /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::pair<int, std::basic_string<char> >*, std::vector<std::pair<int, std::basic_string<char> > > >; _Compare = main()::__lambda0]' puzzle1.cpp:81:10: required from here /usr/include/c++/4.8/bits/stl_algo.h:1948:27: error: no match for call to '(main()::__lambda0) (std::pair<int, std::basic_string<char> >&, std::pair<int, std::basic_string<char> >&)' if (__comp(*__i, *__first)) ^ puzzle1.cpp:76:59: note: candidates are: sort(sorted_groups.begin(), sorted_groups.end(), [](const auto &a, const auto &b) { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from puzzle1.cpp:5: /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 puzzle1.cpp:76:89: note: main()::__lambda0 sort(sorted_groups.begin(), sorted_groups.end(), [](const auto &a, const auto &b) { ^ puzzle1.cpp:76:89: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from puzzle1.cpp:5: /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::pair<int, std::basic_string<char> >*, std::vector<std::pair<int, std::basic_string<char> > > >; _Compare = main()::__lambda0]': /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::pair<int, std::basic_string<char> >*, std::vector<std::pair<int, std::basic_string<char> > > >; _Compare = main()::__lambda0]' /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::pair<int, std::basic_string<char> >*, std::vector<std::pair<int, std::basic_string<char> > > >; _Size = int; _Compare = main()::__lambda0]' /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::pair<int, std::basic_string<char> >*, std::vector<std::pair<int, std::basic_string<char> > > >; _Compare = main()::__lambda0]' puzzle1.cpp:81:10: required from here /usr/include/c++/4.8/bits/stl_algo.h:114:28: error: no match for call to '(main()::__lambda0) (std::pair<int, std::basic_string<char> >&, std::pair<int, std::basic_string<char> >&)' if (__comp(*__a, *__b)) ^ puzzle1.cpp:76:59: note: candidates are: sort(sorted_groups.begin(), sorted_groups.end(), [](const auto &a, const auto &b) { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from puzzle1.cpp:5: /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 puzzle1.cpp:76:89: note: main()::__lambda0 sort(sorted_groups.begin(), sorted_groups.end(), [](const auto &a, const auto &b) { ^ puzzle1.cpp:76:89: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from puzzle1.cpp:5: /usr/include/c++/4.8/bits/stl_algo.h:116:25: error: no match for call to '(main()::__lambda0) (std::pair<int, std::basic_string<char> >&, std::pair<int, std::basic_string<char> >&)' if (__comp(*__b, *__c)) ^ puzzle1.cpp:76:59: note: candidates are: sort(sorted_groups.begin(), sorted_groups.end(), [](const auto &a, const auto &b) { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from puzzle1.cpp:5: /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 puzzle1.cpp:76:89: note: main()::__lambda0 sort(sorted_groups.begin(), sorted_groups.end(), [](const auto &a, const auto &b) { ^ puzzle1.cpp:76:89: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from puzzle1.cpp:5: /usr/include/c++/4.8/bits/stl_algo.h:118:30: error: no match for call to '(main()::__lambda0) (std::pair<int, std::basic_string<char> >&, std::pair<int, std::basic_string<char> >&)' else if (__comp(*__a, *__c)) ^ puzzle1.cpp:76:59: note: candidates are: sort(sorted_groups.begin(), sorted_groups.end(), [](const auto &a, const auto &b) { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from puzzle1.cpp:5: /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 puzzle1.cpp:76:89: note: main()::__lambda0 sort(sorted_groups.begin(), sorted_groups.end(), [](const auto &a, const auto &b) { ^ puzzle1.cpp:76:89: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from puzzle1.cpp:5: /usr/include/c++/4.8/bits/stl_algo.h:123:33: error: no match for call to '(main()::__lambda0) (std::pair<int, std::basic_string<char> >&, std::pair<int, std::basic_string<char> >&)' else if (__comp(*__a, *__c)) ^ puzzle1.cpp:76:59: note: candidates are: sort(sorted_groups.begin(), sorted_groups.end(), [](const auto &a, const auto &b) { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from puzzle1.cpp:5: /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 puzzle1.cpp:76:89: note: main()::__lambda0 sort(sorted_groups.begin(), sorted_groups.end(), [](const auto &a, const auto &b) { ^ puzzle1.cpp:76:89: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from puzzle1.cpp:5: /usr/include/c++/4.8/bits/stl_algo.h:125:33: error: no match for call to '(main()::__lambda0) (std::pair<int, std::basic_string<char> >&, std::pair<int, std::basic_string<char> >&)' else if (__comp(*__b, *__c)) ^ puzzle1.cpp:76:59: note: candidates are: sort(sorted_groups.begin(), sorted_groups.end(), [](const auto &a, const auto &b) { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from puzzle1.cpp:5: /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 puzzle1.cpp:76:89: note: main()::__lambda0 sort(sorted_groups.begin(), sorted_groups.end(), [](const auto &a, const auto &b) { ^ puzzle1.cpp:76:89: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from puzzle1.cpp:5: /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::pair<int, std::basic_string<char> >*, std::vector<std::pair<int, std::basic_string<char> > > >; _Tp = std::pair<int, std::basic_string<char> >; _Compare = main()::__lambda0]': /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::pair<int, std::basic_string<char> >*, std::vector<std::pair<int, std::basic_string<char> > > >; _Compare = main()::__lambda0]' /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::pair<int, std::basic_string<char> >*, std::vector<std::pair<int, std::basic_string<char> > > >; _Size = int; _Compare = main()::__lambda0]' /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::pair<int, std::basic_string<char> >*, std::vector<std::pair<int, std::basic_string<char> > > >; _Compare = main()::__lambda0]' puzzle1.cpp:81:10: required from here /usr/include/c++/4.8/bits/stl_algo.h:2263:35: error: no match for call to '(main()::__lambda0) (std::pair<int, std::basic_string<char> >&, const std::pair<int, std::basic_string<char> >&)' while (__comp(*__first, __pivot)) ^ puzzle1.cpp:76:59: note: candidates are: sort(sorted_groups.begin(), sorted_groups.end(), [](const auto &a, const auto &b) { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from puzzle1.cpp:5: /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 puzzle1.cpp:76:89: note: main()::__lambda0 sort(sorted_groups.begin(), sorted_groups.end(), [](const auto &a, const auto &b) { ^ puzzle1.cpp:76:89: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from puzzle1.cpp:5: /usr/include/c++/4.8/bits/stl_algo.h:2266:34: error: no match for call to '(main()::__lambda0) (const std::pair<int, std::basic_string<char> >&, std::pair<int, std::basic_string<char> >&)' while (__comp(__pivot, *__last)) ^ puzzle1.cpp:76:59: note: candidates are: sort(sorted_groups.begin(), sorted_groups.end(), [](const auto &a, const auto &b) { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from puzzle1.cpp:5: /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 puzzle1.cpp:76:89: note: main()::__lambda0 sort(sorted_groups.begin(), sorted_groups.end(), [](const auto &a, const auto &b) { ^ puzzle1.cpp:76:89: 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 puzzle1.cpp:5: /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::pair<int, std::basic_string<char> >*, std::vector<std::pair<int, std::basic_string<char> > > >; _Distance = int; _Tp = std::pair<int, std::basic_string<char> >; _Compare = main()::__lambda0]': /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::pair<int, std::basic_string<char> >*, std::vector<std::pair<int, std::basic_string<char> > > >; _Compare = main()::__lambda0]' /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::pair<int, std::basic_string<char> >*, std::vector<std::pair<int, std::basic_string<char> > > >; _Compare = main()::__lambda0]' /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::pair<int, std::basic_string<char> >*, std::vector<std::pair<int, std::basic_string<char> > > >; _Compare = main()::__lambda0]' /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::pair<int, std::basic_string<char> >*, std::vector<std::pair<int, std::basic_string<char> > > >; _Size = int; _Compare = main()::__lambda0]' /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::pair<int, std::basic_string<char> >*, std::vector<std::pair<int, std::basic_string<char> > > >; _Compare = main()::__lambda0]' puzzle1.cpp:81:10: required from here /usr/include/c++/4.8/bits/stl_heap.h:313:40: error: no match for call to '(main()::__lambda0) (std::pair<int, std::basic_string<char> >&, std::pair<int, std::basic_string<char> >&)' *(__first + (__secondChild - 1)))) ^ puzzle1.cpp:76:59: note: candidates are: sort(sorted_groups.begin(), sorted_groups.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 puzzle1.cpp:5: /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 puzzle1.cpp:76:89: note: main()::__lambda0 sort(sorted_groups.begin(), sorted_groups.end(), [](const auto &a, const auto &b) { ^ puzzle1.cpp:76:89: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from puzzle1.cpp:5: /usr/include/c++/4.8/bits/stl_algo.h: At global scope: /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::pair<int, std::basic_string<char> >*, std::vector<std::pair<int, std::basic_string<char> > > >; _Compare = main()::__lambda0]', declared using local type 'main()::__lambda0', 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 puzzle1.cpp:5: /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::pair<int, std::basic_string<char> >*, std::vector<std::pair<int, std::basic_string<char> > > >; _Compare = main()::__lambda0]', declared using local type 'main()::__lambda0', 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::pair<int, std::basic_string<char> >*, std::vector<std::pair<int, std::basic_string<char> > > >; _Distance = int; _Tp = std::pair<int, std::basic_string<char> >; _Compare = main()::__lambda0]', declared using local type 'main()::__lambda0', 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 puzzle1 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ă.