Acest site foloseşte cookies. Navigând în continuare, vă exprimaţi acordul asupra folosirii cookie-urilor.

Detalii evaluare #54871711

Rezumat problemă

#3713 company_tree

Undeva, într-un ținut îndepărtat, își desfășoară activitatea o vestită companie, mai exact Mondial Computers SRL. Aceștia lucrează cu mulți clienți de renume, deci au nevoie de multă forță de muncă. Astfel, ei au o bază de date în care mențin informații despre angajații lor, dar, recent, echipa care se ocupa de această bază de date a dat dovadă de un randament scăzut, iar ca urmare a acestui fapt, manager-ul general a decis, fără a ține cont de consecințe, să îi concedieze, iar aceștia, de supărare, au șters înainte de a pleca din companie toate datele angajaților. Acum manager-ul are nevoie de ajutorul vostru(voluntar, desigur) pentru reorganizarea acestei baze de date până reușește să angajeze noi oameni.

Rezolvă

Detalii

Problema company_tree Operații I/O tastatură/ecran
Limita timp 2 secunde Limita memorie Total: 128 MB / Stivă 32 MB
Id soluție #54871711 Utilizator Andrei Visalon (Prekzursil)
Fișier company_tree.cpp Dimensiune 6.42 KB
Data încărcării 10 Decembrie 2024, 21:34 Scor / rezultat Eroare de compilare

Evaluare


Mesaj compilare

company_tree.cpp: In function 'int main()':
company_tree.cpp:109:39: error: parameter declared 'auto'
     sort(E.begin(), E.end(), [](auto &A,auto &B){

                                       ^
company_tree.cpp:109:47: error: parameter declared 'auto'
     sort(E.begin(), E.end(), [](auto &A,auto &B){

                                               ^
company_tree.cpp: In lambda function:
company_tree.cpp:110:13: error: 'A' was not declared in this scope
         if (A.f==B.f) return A.idx<B.idx;

             ^
company_tree.cpp:110:18: error: 'B' was not declared in this scope
         if (A.f==B.f) return A.idx<B.idx;

                  ^
company_tree.cpp:111:16: error: 'A' was not declared in this scope
         return A.f<B.f;

                ^
company_tree.cpp:111:20: error: 'B' was not declared in this scope
         return A.f<B.f;

                    ^
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64,
                 from company_tree.cpp:1:
/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<main()::Emp*, std::vector<main()::Emp> >; _Compare = main()::__lambda5]':
/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<main()::Emp*, std::vector<main()::Emp> >; _Compare = main()::__lambda5]'
/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<main()::Emp*, std::vector<main()::Emp> >; _Compare = main()::__lambda5]'
company_tree.cpp:112:6:   required from here
/usr/include/c++/4.8/bits/stl_algo.h:2159:29: error: no match for call to '(main()::__lambda5) (main()::Emp&, main()::Emp&)'
    if (__comp(*__i, *__first))
                             ^
company_tree.cpp:109:31: note: candidates are:
     sort(E.begin(), E.end(), [](auto &A,auto &B){

                               ^
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64,
                 from company_tree.cpp:1:
/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
company_tree.cpp:109:48: note: main()::__lambda5
     sort(E.begin(), E.end(), [](auto &A,auto &B){

                                                ^
company_tree.cpp:109:48: note:   candidate expects 0 arguments, 2 provided
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64,
                 from company_tree.cpp:1:
/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<main()::Emp*, std::vector<main()::Emp> >; _Compare = main()::__lambda5]':
/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<main()::Emp*, std::vector<main()::Emp> >; _Compare = main()::__lambda5]'
/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<main()::Emp*, std::vector<main()::Emp> >; _Size = int; _Compare = main()::__lambda5]'
/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<main()::Emp*, std::vector<main()::Emp> >; _Compare = main()::__lambda5]'
company_tree.cpp:112:6:   required from here
/usr/include/c++/4.8/bits/stl_algo.h:1948:27: error: no match for call to '(main()::__lambda5) (main()::Emp&, main()::Emp&)'
  if (__comp(*__i, *__first))
                           ^
company_tree.cpp:109:31: note: candidates are:
     sort(E.begin(), E.end(), [](auto &A,auto &B){

                               ^
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64,
                 from company_tree.cpp:1:
/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
company_tree.cpp:109:48: note: main()::__lambda5
     sort(E.begin(), E.end(), [](auto &A,auto &B){

                                                ^
company_tree.cpp:109:48: note:   candidate expects 0 arguments, 2 provided
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64,
                 from company_tree.cpp:1:
/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<main()::Emp*, std::vector<main()::Emp> >; _Compare = main()::__lambda5]':
/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<main()::Emp*, std::vector<main()::Emp> >; _Compare = main()::__lambda5]'
/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<main()::Emp*, std::vector<main()::Emp> >; _Size = int; _Compare = main()::__lambda5]'
/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<main()::Emp*, std::vector<main()::Emp> >; _Compare = main()::__lambda5]'
company_tree.cpp:112:6:   required from here
/usr/include/c++/4.8/bits/stl_algo.h:114:28: error: no match for call to '(main()::__lambda5) (main()::Emp&, main()::Emp&)'
       if (__comp(*__a, *__b))
                            ^
company_tree.cpp:109:31: note: candidates are:
     sort(E.begin(), E.end(), [](auto &A,auto &B){

                               ^
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64,
                 from company_tree.cpp:1:
/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
company_tree.cpp:109:48: note: main()::__lambda5
     sort(E.begin(), E.end(), [](auto &A,auto &B){

                                                ^
company_tree.cpp:109:48: note:   candidate expects 0 arguments, 2 provided
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64,
                 from company_tree.cpp:1:
/usr/include/c++/4.8/bits/stl_algo.h:116:25: error: no match for call to '(main()::__lambda5) (main()::Emp&, main()::Emp&)'
    if (__comp(*__b, *__c))
                         ^
company_tree.cpp:109:31: note: candidates are:
     sort(E.begin(), E.end(), [](auto &A,auto &B){

                               ^
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64,
                 from company_tree.cpp:1:
/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
company_tree.cpp:109:48: note: main()::__lambda5
     sort(E.begin(), E.end(), [](auto &A,auto &B){

                                                ^
company_tree.cpp:109:48: note:   candidate expects 0 arguments, 2 provided
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64,
                 from company_tree.cpp:1:
/usr/include/c++/4.8/bits/stl_algo.h:118:30: error: no match for call to '(main()::__lambda5) (main()::Emp&, main()::Emp&)'
    else if (__comp(*__a, *__c))
                              ^
company_tree.cpp:109:31: note: candidates are:
     sort(E.begin(), E.end(), [](auto &A,auto &B){

                               ^
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64,
                 from company_tree.cpp:1:
/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
company_tree.cpp:109:48: note: main()::__lambda5
     sort(E.begin(), E.end(), [](auto &A,auto &B){

                                                ^
company_tree.cpp:109:48: note:   candidate expects 0 arguments, 2 provided
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64,
                 from company_tree.cpp:1:
/usr/include/c++/4.8/bits/stl_algo.h:123:33: error: no match for call to '(main()::__lambda5) (main()::Emp&, main()::Emp&)'
       else if (__comp(*__a, *__c))
                                 ^
company_tree.cpp:109:31: note: candidates are:
     sort(E.begin(), E.end(), [](auto &A,auto &B){

                               ^
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64,
                 from company_tree.cpp:1:
/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
company_tree.cpp:109:48: note: main()::__lambda5
     sort(E.begin(), E.end(), [](auto &A,auto &B){

                                                ^
company_tree.cpp:109:48: note:   candidate expects 0 arguments, 2 provided
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64,
                 from company_tree.cpp:1:
/usr/include/c++/4.8/bits/stl_algo.h:125:33: error: no match for call to '(main()::__lambda5) (main()::Emp&, main()::Emp&)'
       else if (__comp(*__b, *__c))
                                 ^
company_tree.cpp:109:31: note: candidates are:
     sort(E.begin(), E.end(), [](auto &A,auto &B){

                               ^
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64,
                 from company_tree.cpp:1:
/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
company_tree.cpp:109:48: note: main()::__lambda5
     sort(E.begin(), E.end(), [](auto &A,auto &B){

                                                ^
company_tree.cpp:109:48: note:   candidate expects 0 arguments, 2 provided
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64,
                 from company_tree.cpp:1:
/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<main()::Emp*, std::vector<main()::Emp> >; _Tp = main()::Emp; _Compare = main()::__lambda5]':
/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<main()::Emp*, std::vector<main()::Emp> >; _Compare = main()::__lambda5]'
/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<main()::Emp*, std::vector<main()::Emp> >; _Size = int; _Compare = main()::__lambda5]'
/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<main()::Emp*, std::vector<main()::Emp> >; _Compare = main()::__lambda5]'
company_tree.cpp:112:6:   required from here
/usr/include/c++/4.8/bits/stl_algo.h:2263:35: error: no match for call to '(main()::__lambda5) (main()::Emp&, const main()::Emp&)'
    while (__comp(*__first, __pivot))
                                   ^
company_tree.cpp:109:31: note: candidates are:
     sort(E.begin(), E.end(), [](auto &A,auto &B){

                               ^
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64,
                 from company_tree.cpp:1:
/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
company_tree.cpp:109:48: note: main()::__lambda5
     sort(E.begin(), E.end(), [](auto &A,auto &B){

                                                ^
company_tree.cpp:109:48: note:   candidate expects 0 arguments, 2 provided
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64,
                 from company_tree.cpp:1:
/usr/include/c++/4.8/bits/stl_algo.h:2266:34: error: no match for call to '(main()::__lambda5) (const main()::Emp&, main()::Emp&)'
    while (__comp(__pivot, *__last))
                                  ^
company_tree.cpp:109:31: note: candidates are:
     sort(E.begin(), E.end(), [](auto &A,auto &B){

                               ^
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64,
                 from company_tree.cpp:1:
/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
company_tree.cpp:109:48: note: main()::__lambda5
     sort(E.begin(), E.end(), [](auto &A,auto &B){

                                                ^
company_tree.cpp:109:48: 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 /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64,
                 from company_tree.cpp:1:
/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<main()::Emp*, std::vector<main()::Emp> >; _Distance = int; _Tp = main()::Emp; _Compare = main()::__lambda5]':
/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<main()::Emp*, std::vector<main()::Emp> >; _Compare = main()::__lambda5]'
/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<main()::Emp*, std::vector<main()::Emp> >; _Compare = main()::__lambda5]'
/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<main()::Emp*, std::vector<main()::Emp> >; _Compare = main()::__lambda5]'
/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<main()::Emp*, std::vector<main()::Emp> >; _Size = int; _Compare = main()::__lambda5]'
/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<main()::Emp*, std::vector<main()::Emp> >; _Compare = main()::__lambda5]'
company_tree.cpp:112:6:   required from here
/usr/include/c++/4.8/bits/stl_heap.h:313:40: error: no match for call to '(main()::__lambda5) (main()::Emp&, main()::Emp&)'
        *(__first + (__secondChild - 1))))
                                        ^
company_tree.cpp:109:31: note: candidates are:
     sort(E.begin(), E.end(), [](auto &A,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 /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64,
                 from company_tree.cpp:1:
/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
company_tree.cpp:109:48: note: main()::__lambda5
     sort(E.begin(), E.end(), [](auto &A,auto &B){

                                                ^
company_tree.cpp:109:48: note:   candidate expects 0 arguments, 2 provided
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64,
                 from company_tree.cpp:1:
/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<main()::Emp*, std::vector<main()::Emp> >; _Compare = main()::__lambda5]', declared using local type 'main()::__lambda5', 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 /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64,
                 from company_tree.cpp:1:
/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<main()::Emp*, std::vector<main()::Emp> >; _Compare = main()::__lambda5]', declared using local type 'main()::__lambda5', 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<main()::Emp*, std::vector<main()::Emp> >; _Distance = int; _Tp = main()::Emp; _Compare = main()::__lambda5]', declared using local type 'main()::Emp', 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 company_tree 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ă.