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

Detalii evaluare #53282817

Rezumat problemă

#1013 Aniversari

Se dau datele de naștere a n persoane, numerotate de la 1 la n, în forma an luna zi. Să se determine numărul de ordine al celei mai tinere și al celei mai în vârstă persoană dintre cele date.

Rezolvă

Detalii

Problema Aniversari Operații I/O tastatură/ecran
Limita timp 0.1 secunde Limita memorie Total: 64 MB / Stivă 8 MB
Id soluție #53282817 Utilizator Bargaoanu Darius (MrGinx)
Fișier aniversari.cpp Dimensiune 474 B
Data încărcării 23 Octombrie 2024, 12:14 Scor / rezultat Eroare de compilare

Evaluare


Mesaj compilare

aniversari.cpp:6:22: error: expected ',' or '...' before 'x'
 bool comp(int varsta x, int varsta y)

                      ^
aniversari.cpp: In function 'bool comp(int)':
aniversari.cpp:8:8: error: 'x' was not declared in this scope
     if(x.a>y.a || x.a==y.a && x.l>y.l || x.a==y.a && x.l==y.l && x.z>y.z)

        ^
aniversari.cpp:8:12: error: 'y' was not declared in this scope
     if(x.a>y.a || x.a==y.a && x.l>y.l || x.a==y.a && x.l==y.l && x.z>y.z)

            ^
aniversari.cpp: In function 'int main()':
aniversari.cpp:17:27: error: expected primary-expression before ')' token
     for (int i=1; i<=n; ++){

                           ^
aniversari.cpp:15:9: warning: unused variable 't' [-Wunused-variable]
     int t=-1, b=-1;

         ^
aniversari.cpp:15:15: warning: unused variable 'b' [-Wunused-variable]
     int t=-1, b=-1;

               ^
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 aniversari.cpp:1:
/usr/include/c++/4.8/bits/stl_algo.h: In instantiation of 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = <anonymous struct>*; _Compare = bool (*)(int)]':
/usr/include/c++/4.8/bits/stl_algo.h:2226:70:   required from 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = <anonymous struct>*; _Compare = bool (*)(int)]'
/usr/include/c++/4.8/bits/stl_algo.h:5500:55:   required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = <anonymous struct>*; _Compare = bool (*)(int)]'
aniversari.cpp:21:26:   required from here
/usr/include/c++/4.8/bits/stl_algo.h:2159:29: error: cannot convert '<anonymous struct>' to 'int' in argument passing
    if (__comp(*__i, *__first))
                             ^
/usr/include/c++/4.8/bits/stl_algo.h: In instantiation of 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = <anonymous struct>*; _Compare = bool (*)(int)]':
/usr/include/c++/4.8/bits/stl_algo.h:5349:59:   required from 'void std::partial_sort(_RAIter, _RAIter, _RAIter, _Compare) [with _RAIter = <anonymous struct>*; _Compare = bool (*)(int)]'
/usr/include/c++/4.8/bits/stl_algo.h:2332:68:   required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = <anonymous struct>*; _Size = int; _Compare = bool (*)(int)]'
/usr/include/c++/4.8/bits/stl_algo.h:5499:44:   required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = <anonymous struct>*; _Compare = bool (*)(int)]'
aniversari.cpp:21:26:   required from here
/usr/include/c++/4.8/bits/stl_algo.h:1948:27: error: cannot convert '<anonymous struct>' to 'int' in argument passing
  if (__comp(*__i, *__first))
                           ^
/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 = <anonymous struct>*; _Compare = bool (*)(int)]':
/usr/include/c++/4.8/bits/stl_algo.h:2295:13:   required from '_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = <anonymous struct>*; _Compare = bool (*)(int)]'
/usr/include/c++/4.8/bits/stl_algo.h:2337:62:   required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = <anonymous struct>*; _Size = int; _Compare = bool (*)(int)]'
/usr/include/c++/4.8/bits/stl_algo.h:5499:44:   required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = <anonymous struct>*; _Compare = bool (*)(int)]'
aniversari.cpp:21:26:   required from here
/usr/include/c++/4.8/bits/stl_algo.h:114:28: error: cannot convert '<anonymous struct>' to 'int' in argument passing
       if (__comp(*__a, *__b))
                            ^
/usr/include/c++/4.8/bits/stl_algo.h:116:25: error: cannot convert '<anonymous struct>' to 'int' in argument passing
    if (__comp(*__b, *__c))
                         ^
/usr/include/c++/4.8/bits/stl_algo.h:118:30: error: cannot convert '<anonymous struct>' to 'int' in argument passing
    else if (__comp(*__a, *__c))
                              ^
/usr/include/c++/4.8/bits/stl_algo.h:123:33: error: cannot convert '<anonymous struct>' to 'int' in argument passing
       else if (__comp(*__a, *__c))
                                 ^
/usr/include/c++/4.8/bits/stl_algo.h:125:33: error: cannot convert '<anonymous struct>' to 'int' in argument passing
       else if (__comp(*__b, *__c))
                                 ^
/usr/include/c++/4.8/bits/stl_algo.h: In instantiation of '_RandomAccessIterator std::__unguarded_partition(_RandomAccessIterator, _RandomAccessIterator, const _Tp&, _Compare) [with _RandomAccessIterator = <anonymous struct>*; _Tp = <anonymous struct>; _Compare = bool (*)(int)]':
/usr/include/c++/4.8/bits/stl_algo.h:2296:78:   required from '_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = <anonymous struct>*; _Compare = bool (*)(int)]'
/usr/include/c++/4.8/bits/stl_algo.h:2337:62:   required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = <anonymous struct>*; _Size = int; _Compare = bool (*)(int)]'
/usr/include/c++/4.8/bits/stl_algo.h:5499:44:   required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = <anonymous struct>*; _Compare = bool (*)(int)]'
aniversari.cpp:21:26:   required from here
/usr/include/c++/4.8/bits/stl_algo.h:2263:35: error: cannot convert '<anonymous struct>' to 'int' in argument passing
    while (__comp(*__first, __pivot))
                                   ^
/usr/include/c++/4.8/bits/stl_algo.h:2266:34: error: cannot convert 'const<anonymous struct>' to 'int' in argument passing
    while (__comp(__pivot, *__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 aniversari.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 = <anonymous struct>*; _Distance = int; _Tp = <anonymous struct>; _Compare = bool (*)(int)]':
/usr/include/c++/4.8/bits/stl_heap.h:448:15:   required from 'void std::make_heap(_RAIter, _RAIter, _Compare) [with _RAIter = <anonymous struct>*; _Compare = bool (*)(int)]'
/usr/include/c++/4.8/bits/stl_algo.h:1946:47:   required from 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = <anonymous struct>*; _Compare = bool (*)(int)]'
/usr/include/c++/4.8/bits/stl_algo.h:5349:59:   required from 'void std::partial_sort(_RAIter, _RAIter, _RAIter, _Compare) [with _RAIter = <anonymous struct>*; _Compare = bool (*)(int)]'
/usr/include/c++/4.8/bits/stl_algo.h:2332:68:   required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = <anonymous struct>*; _Size = int; _Compare = bool (*)(int)]'
/usr/include/c++/4.8/bits/stl_algo.h:5499:44:   required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = <anonymous struct>*; _Compare = bool (*)(int)]'
aniversari.cpp:21:26:   required from here
/usr/include/c++/4.8/bits/stl_heap.h:313:40: error: cannot convert '<anonymous struct>' to 'int' in argument passing
        *(__first + (__secondChild - 1))))
                                        ^
In file included from /usr/include/c++/4.8/bits/char_traits.h:39:0,
                 from /usr/include/c++/4.8/ios:40,
                 from /usr/include/c++/4.8/istream:38,
                 from /usr/include/c++/4.8/sstream:38,
                 from /usr/include/c++/4.8/complex:45,
                 from /usr/include/c++/4.8/ccomplex:38,
                 from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:52,
                 from aniversari.cpp:1:
/usr/include/c++/4.8/bits/stl_algobase.h: At global scope:
/usr/include/c++/4.8/bits/stl_algobase.h:655:5: error: '_BI2 std::move_backward(_BI1, _BI1, _BI2) [with _BI1 = <anonymous struct>*; _BI2 = <anonymous struct>*]', declared using anonymous type, is used but never defined [-fpermissive]
     move_backward(_BI1 __first, _BI1 __last, _BI2 __result)
     ^
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 aniversari.cpp:1:
/usr/include/c++/4.8/bits/stl_algo.h:2110:5: error: 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = <anonymous struct>*; _Compare = bool (*)(int)]', declared using anonymous type, 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 aniversari.cpp:1:
/usr/include/c++/4.8/bits/stl_heap.h:331:5: error: 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = <anonymous struct>*; _Compare = bool (*)(int)]', declared using anonymous type, is used but never defined [-fpermissive]
     __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
     ^
In file included from /usr/include/c++/4.8/bits/char_traits.h:39:0,
                 from /usr/include/c++/4.8/ios:40,
                 from /usr/include/c++/4.8/istream:38,
                 from /usr/include/c++/4.8/sstream:38,
                 from /usr/include/c++/4.8/complex:45,
                 from /usr/include/c++/4.8/ccomplex:38,
                 from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:52,
                 from aniversari.cpp:1:
/usr/include/c++/4.8/bits/stl_algobase.h:119:5: error: 'void std::iter_swap(_ForwardIterator1, _ForwardIterator2) [with _ForwardIterator1 = <anonymous struct>*; _ForwardIterator2 = <anonymous struct>*]', declared using anonymous type, is used but never defined [-fpermissive]
     iter_swap(_ForwardIterator1 __a, _ForwardIterator2 __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 aniversari.cpp:1:
/usr/include/c++/4.8/bits/stl_heap.h:178:5: error: 'void std::__push_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = <anonymous struct>*; _Distance = int; _Tp = <anonymous struct>; _Compare = bool (*)(int)]', declared using anonymous type, 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 Aniversari 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ă.