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

Detalii evaluare #63646333

Rezumat problemă

PlatouK_v3
#3334

Fiind dat un șir de numere, numim secvenţă a acestuia o parte dintre termenii şirului luaţi de pe poziţii consecutive. Denumim platou al acestui şir o secvenţă formată din valori identice. Lungimea unui platou este egală cu numărul de elemente care îl formează.

Asupra unui şir se poate efectua următoarea operaţiune:

  1. se extrage un platou la alegere;
  2. se inserează platoul extras la pasul anterior într-o poziţie la alegere din şirul rezultat după extragere.

Să se scrie un program care citește un șir de n numere naturale și un număr k și determină:

  1. lungimea maximă a unui platou care poate să apară în şir în urma efectuării operaţiunii de mai sus de maxim k ori
  2. elementul din care este format platoul obținut după cele k operațiuni
Consola Moca Andrei (TREYWAY) Andrei Moca dificilă
Clasa 11 Structuri de date arborescente Structuri de date
Rezolvă

Detalii

Problema PlatouK_v3 Operații I/O tastatură/ecran
Limita timp 0.01 secunde Limita memorie Total: 5 MB / Stivă 5 MB
Id soluție #63646333 Utilizator Girigan Andrei (AndreiGir)
Fișier platouk_v3.cpp Dimensiune 1.35 KB
Data încărcării 12 Martie 2026, 14:19 Scor/rezultat Eroare de compilare

Evaluare

Mesaj compilare

platouk_v3.cpp: In function 'int main()':
platouk_v3.cpp:34:41: error: parameter declared 'auto'
     sort(pl.begin(), pl.end(), [](auto &a, auto &b){

                                         ^
platouk_v3.cpp:34:50: error: parameter declared 'auto'
     sort(pl.begin(), pl.end(), [](auto &a, auto &b){

                                                  ^
platouk_v3.cpp: In lambda function:
platouk_v3.cpp:35:16: error: 'a' is not captured
         return a.val < b.val;

                ^
platouk_v3.cpp:35:24: error: 'b' was not declared in this scope
         return a.val < b.val;

                        ^
platouk_v3.cpp: In function 'int main()':
platouk_v3.cpp:41:33: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < pl.size();) {

                                 ^
platouk_v3.cpp:46:28: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         while (j < pl.size() && pl[j].val == pl[i].val) {

                            ^
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 platouk_v3.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<Plateau*, std::vector<Plateau> >; _Compare = main()::__lambda4]':
/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<Plateau*, std::vector<Plateau> >; _Compare = main()::__lambda4]'
/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<Plateau*, std::vector<Plateau> >; _Compare = main()::__lambda4]'
platouk_v3.cpp:36:6:   required from here
/usr/include/c++/4.8/bits/stl_algo.h:2159:29: error: no match for call to '(main()::__lambda4) (Plateau&, Plateau&)'
    if (__comp(*__i, *__first))
                             ^
platouk_v3.cpp:34:33: note: candidates are:
     sort(pl.begin(), pl.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 platouk_v3.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
platouk_v3.cpp:34:51: note: main()::__lambda4
     sort(pl.begin(), pl.end(), [](auto &a, auto &b){

                                                   ^
platouk_v3.cpp:34:51: 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 platouk_v3.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<Plateau*, std::vector<Plateau> >; _Compare = main()::__lambda4]':
/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<Plateau*, std::vector<Plateau> >; _Compare = main()::__lambda4]'
/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<Plateau*, std::vector<Plateau> >; _Size = int; _Compare = main()::__lambda4]'
/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<Plateau*, std::vector<Plateau> >; _Compare = main()::__lambda4]'
platouk_v3.cpp:36:6:   required from here
/usr/include/c++/4.8/bits/stl_algo.h:1948:27: error: no match for call to '(main()::__lambda4) (Plateau&, Plateau&)'
  if (__comp(*__i, *__first))
                           ^
platouk_v3.cpp:34:33: note: candidates are:
     sort(pl.begin(), pl.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 platouk_v3.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
platouk_v3.cpp:34:51: note: main()::__lambda4
     sort(pl.begin(), pl.end(), [](auto &a, auto &b){

                                                   ^
platouk_v3.cpp:34:51: 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 platouk_v3.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<Plateau*, std::vector<Plateau> >; _Compare = main()::__lambda4]':
/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<Plateau*, std::vector<Plateau> >; _Compare = main()::__lambda4]'
/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<Plateau*, std::vector<Plateau> >; _Size = int; _Compare = main()::__lambda4]'
/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<Plateau*, std::vector<Plateau> >; _Compare = main()::__lambda4]'
platouk_v3.cpp:36:6:   required from here
/usr/include/c++/4.8/bits/stl_algo.h:114:28: error: no match for call to '(main()::__lambda4) (Plateau&, Plateau&)'
       if (__comp(*__a, *__b))
                            ^
platouk_v3.cpp:34:33: note: candidates are:
     sort(pl.begin(), pl.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 platouk_v3.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
platouk_v3.cpp:34:51: note: main()::__lambda4
     sort(pl.begin(), pl.end(), [](auto &a, auto &b){

                                                   ^
platouk_v3.cpp:34:51: 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 platouk_v3.cpp:1:
/usr/include/c++/4.8/bits/stl_algo.h:116:25: error: no match for call to '(main()::__lambda4) (Plateau&, Plateau&)'
    if (__comp(*__b, *__c))
                         ^
platouk_v3.cpp:34:33: note: candidates are:
     sort(pl.begin(), pl.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 platouk_v3.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
platouk_v3.cpp:34:51: note: main()::__lambda4
     sort(pl.begin(), pl.end(), [](auto &a, auto &b){

                                                   ^
platouk_v3.cpp:34:51: 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 platouk_v3.cpp:1:
/usr/include/c++/4.8/bits/stl_algo.h:118:30: error: no match for call to '(main()::__lambda4) (Plateau&, Plateau&)'
    else if (__comp(*__a, *__c))
                              ^
platouk_v3.cpp:34:33: note: candidates are:
     sort(pl.begin(), pl.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 platouk_v3.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
platouk_v3.cpp:34:51: note: main()::__lambda4
     sort(pl.begin(), pl.end(), [](auto &a, auto &b){

                                                   ^
platouk_v3.cpp:34:51: 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 platouk_v3.cpp:1:
/usr/include/c++/4.8/bits/stl_algo.h:123:33: error: no match for call to '(main()::__lambda4) (Plateau&, Plateau&)'
       else if (__comp(*__a, *__c))
                                 ^
platouk_v3.cpp:34:33: note: candidates are:
     sort(pl.begin(), pl.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 platouk_v3.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
platouk_v3.cpp:34:51: note: main()::__lambda4
     sort(pl.begin(), pl.end(), [](auto &a, auto &b){

                                                   ^
platouk_v3.cpp:34:51: 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 platouk_v3.cpp:1:
/usr/include/c++/4.8/bits/stl_algo.h:125:33: error: no match for call to '(main()::__lambda4) (Plateau&, Plateau&)'
       else if (__comp(*__b, *__c))
                                 ^
platouk_v3.cpp:34:33: note: candidates are:
     sort(pl.begin(), pl.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 platouk_v3.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
platouk_v3.cpp:34:51: note: main()::__lambda4
     sort(pl.begin(), pl.end(), [](auto &a, auto &b){

                                                   ^
platouk_v3.cpp:34:51: 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 platouk_v3.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<Plateau*, std::vector<Plateau> >; _Tp = Plateau; _Compare = main()::__lambda4]':
/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<Plateau*, std::vector<Plateau> >; _Compare = main()::__lambda4]'
/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<Plateau*, std::vector<Plateau> >; _Size = int; _Compare = main()::__lambda4]'
/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<Plateau*, std::vector<Plateau> >; _Compare = main()::__lambda4]'
platouk_v3.cpp:36:6:   required from here
/usr/include/c++/4.8/bits/stl_algo.h:2263:35: error: no match for call to '(main()::__lambda4) (Plateau&, const Plateau&)'
    while (__comp(*__first, __pivot))
                                   ^
platouk_v3.cpp:34:33: note: candidates are:
     sort(pl.begin(), pl.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 platouk_v3.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
platouk_v3.cpp:34:51: note: main()::__lambda4
     sort(pl.begin(), pl.end(), [](auto &a, auto &b){

                                                   ^
platouk_v3.cpp:34:51: 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 platouk_v3.cpp:1:
/usr/include/c++/4.8/bits/stl_algo.h:2266:34: error: no match for call to '(main()::__lambda4) (const Plateau&, Plateau&)'
    while (__comp(__pivot, *__last))
                                  ^
platouk_v3.cpp:34:33: note: candidates are:
     sort(pl.begin(), pl.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 platouk_v3.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
platouk_v3.cpp:34:51: note: main()::__lambda4
     sort(pl.begin(), pl.end(), [](auto &a, auto &b){

                                                   ^
platouk_v3.cpp:34:51: 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 platouk_v3.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<Plateau*, std::vector<Plateau> >; _Distance = int; _Tp = Plateau; _Compare = main()::__lambda4]':
/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<Plateau*, std::vector<Plateau> >; _Compare = main()::__lambda4]'
/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<Plateau*, std::vector<Plateau> >; _Compare = main()::__lambda4]'
/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<Plateau*, std::vector<Plateau> >; _Compare = main()::__lambda4]'
/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<Plateau*, std::vector<Plateau> >; _Size = int; _Compare = main()::__lambda4]'
/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<Plateau*, std::vector<Plateau> >; _Compare = main()::__lambda4]'
platouk_v3.cpp:36:6:   required from here
/usr/include/c++/4.8/bits/stl_heap.h:313:40: error: no match for call to '(main()::__lambda4) (Plateau&, Plateau&)'
        *(__first + (__secondChild - 1))))
                                        ^
platouk_v3.cpp:34:33: note: candidates are:
     sort(pl.begin(), pl.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 platouk_v3.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
platouk_v3.cpp:34:51: note: main()::__lambda4
     sort(pl.begin(), pl.end(), [](auto &a, auto &b){

                                                   ^
platouk_v3.cpp:34:51: 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 platouk_v3.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<Plateau*, std::vector<Plateau> >; _Compare = main()::__lambda4]', declared using local type 'main()::__lambda4', 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 platouk_v3.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<Plateau*, std::vector<Plateau> >; _Compare = main()::__lambda4]', declared using local type 'main()::__lambda4', 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<Plateau*, std::vector<Plateau> >; _Distance = int; _Tp = Plateau; _Compare = main()::__lambda4]', declared using local type 'main()::__lambda4', 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 PlatouK_v3 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ă.

Du-te sus!