Acest site foloseşte cookies. Navigând în continuare, vă exprimaţi acordul asupra folosirii cookie-urilor.
Detalii evaluare #64670008
Rezumat problemă
#1013
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.
Candale Silviu (silviu) 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 | #64670008 | Utilizator |
Cioara Denis (turpei)
|
| Fișier | aniversari.cpp | Dimensiune | 1.18 KB |
| Data încărcării | 21 Mai 2026, 15:15 | Scor/rezultat | Eroare de compilare |
Evaluare
Mesaj compilare
aniversari.cpp: In function ‘void Max(int)’: aniversari.cpp:11:9: error: reference to ‘max’ is ambiguous 11 | max = v[j]; | ^~~ In file included from /usr/include/c++/13/string:51, from /usr/include/c++/13/bits/locale_classes.h:40, from /usr/include/c++/13/bits/ios_base.h:41, from /usr/include/c++/13/ios:44, from /usr/include/c++/13/ostream:40, from /usr/include/c++/13/iostream:41, from aniversari.cpp:1: /usr/include/c++/13/bits/stl_algobase.h:303:5: note: candidates are: ‘template<class _Tp, class _Compare> const _Tp& std::max(const _Tp&, const _Tp&, _Compare)’ 303 | max(const _Tp& __a, const _Tp& __b, _Compare __comp) | ^~~ /usr/include/c++/13/bits/stl_algobase.h:257:5: note: ‘template<class _Tp> const _Tp& std::max(const _Tp&, const _Tp&)’ 257 | max(const _Tp& __a, const _Tp& __b) | ^~~ aniversari.cpp:7:16: note: ‘bday max’ 7 | } v[1000], max, min; | ^~~ aniversari.cpp: In function ‘void Min(int)’: aniversari.cpp:16:9: error: reference to ‘min’ is ambiguous 16 | min = v[k]; | ^~~ /usr/include/c++/13/bits/stl_algobase.h:281:5: note: candidates are: ‘template<class _Tp, class _Compare> const _Tp& std::min(const _Tp&, const _Tp&, _Compare)’ 281 | min(const _Tp& __a, const _Tp& __b, _Compare __comp) | ^~~ /usr/include/c++/13/bits/stl_algobase.h:233:5: note: ‘template<class _Tp> const _Tp& std::min(const _Tp&, const _Tp&)’ 233 | min(const _Tp& __a, const _Tp& __b) | ^~~ aniversari.cpp:7:21: note: ‘bday min’ 7 | } v[1000], max, min; | ^~~ aniversari.cpp: In function ‘int main()’: aniversari.cpp:26:13: error: reference to ‘min’ is ambiguous 26 | min = v[i]; | ^~~ /usr/include/c++/13/bits/stl_algobase.h:281:5: note: candidates are: ‘template<class _Tp, class _Compare> const _Tp& std::min(const _Tp&, const _Tp&, _Compare)’ 281 | min(const _Tp& __a, const _Tp& __b, _Compare __comp) | ^~~ /usr/include/c++/13/bits/stl_algobase.h:233:5: note: ‘template<class _Tp> const _Tp& std::min(const _Tp&, const _Tp&)’ 233 | min(const _Tp& __a, const _Tp& __b) | ^~~ aniversari.cpp:7:21: note: ‘bday min’ 7 | } v[1000], max, min; | ^~~ aniversari.cpp:27:13: error: reference to ‘max’ is ambiguous 27 | max = v[i]; | ^~~ /usr/include/c++/13/bits/stl_algobase.h:303:5: note: candidates are: ‘template<class _Tp, class _Compare> const _Tp& std::max(const _Tp&, const _Tp&, _Compare)’ 303 | max(const _Tp& __a, const _Tp& __b, _Compare __comp) | ^~~ /usr/include/c++/13/bits/stl_algobase.h:257:5: note: ‘template<class _Tp> const _Tp& std::max(const _Tp&, const _Tp&)’ 257 | max(const _Tp& __a, const _Tp& __b) | ^~~ aniversari.cpp:7:16: note: ‘bday max’ 7 | } v[1000], max, min; | ^~~ aniversari.cpp:31:29: error: reference to ‘min’ is ambiguous 31 | else if (v[i].an >= min.an) { | ^~~ /usr/include/c++/13/bits/stl_algobase.h:281:5: note: candidates are: ‘template<class _Tp, class _Compare> const _Tp& std::min(const _Tp&, const _Tp&, _Compare)’ 281 | min(const _Tp& __a, const _Tp& __b, _Compare __comp) | ^~~ /usr/include/c++/13/bits/stl_algobase.h:233:5: note: ‘template<class _Tp> const _Tp& std::min(const _Tp&, const _Tp&)’ 233 | min(const _Tp& __a, const _Tp& __b) | ^~~ aniversari.cpp:7:21: note: ‘bday min’ 7 | } v[1000], max, min; | ^~~ aniversari.cpp:32:28: error: reference to ‘min’ is ambiguous 32 | if (v[i].an == min.an && v[i].luna != min.luna && v[i].zi != min.zi) | ^~~ /usr/include/c++/13/bits/stl_algobase.h:281:5: note: candidates are: ‘template<class _Tp, class _Compare> const _Tp& std::min(const _Tp&, const _Tp&, _Compare)’ 281 | min(const _Tp& __a, const _Tp& __b, _Compare __comp) | ^~~ /usr/include/c++/13/bits/stl_algobase.h:233:5: note: ‘template<class _Tp> const _Tp& std::min(const _Tp&, const _Tp&)’ 233 | min(const _Tp& __a, const _Tp& __b) | ^~~ aniversari.cpp:7:21: note: ‘bday min’ 7 | } v[1000], max, min; | ^~~ aniversari.cpp:32:51: error: reference to ‘min’ is ambiguous 32 | if (v[i].an == min.an && v[i].luna != min.luna && v[i].zi != min.zi) | ^~~ /usr/include/c++/13/bits/stl_algobase.h:281:5: note: candidates are: ‘template<class _Tp, class _Compare> const _Tp& std::min(const _Tp&, const _Tp&, _Compare)’ 281 | min(const _Tp& __a, const _Tp& __b, _Compare __comp) | ^~~ /usr/include/c++/13/bits/stl_algobase.h:233:5: note: ‘template<class _Tp> const _Tp& std::min(const _Tp&, const _Tp&)’ 233 | min(const _Tp& __a, const _Tp& __b) | ^~~ aniversari.cpp:7:21: note: ‘bday min’ 7 | } v[1000], max, min; | ^~~ aniversari.cpp:32:74: error: reference to ‘min’ is ambiguous 32 | if (v[i].an == min.an && v[i].luna != min.luna && v[i].zi != min.zi) | ^~~ /usr/include/c++/13/bits/stl_algobase.h:281:5: note: candidates are: ‘template<class _Tp, class _Compare> const _Tp& std::min(const _Tp&, const _Tp&, _Compare)’ 281 | min(const _Tp& __a, const _Tp& __b, _Compare __comp) | ^~~ /usr/include/c++/13/bits/stl_algobase.h:233:5: note: ‘template<class _Tp> const _Tp& std::min(const _Tp&, const _Tp&)’ 233 | min(const _Tp& __a, const _Tp& __b) | ^~~ aniversari.cpp:7:21: note: ‘bday min’ 7 | } v[1000], max, min; | ^~~ aniversari.cpp:33:34: error: reference to ‘min’ is ambiguous 33 | if ((v[i].luna > min.luna) | ^~~ /usr/include/c++/13/bits/stl_algobase.h:281:5: note: candidates are: ‘template<class _Tp, class _Compare> const _Tp& std::min(const _Tp&, const _Tp&, _Compare)’ 281 | min(const _Tp& __a, const _Tp& __b, _Compare __comp) | ^~~ /usr/include/c++/13/bits/stl_algobase.h:233:5: note: ‘template<class _Tp> const _Tp& std::min(const _Tp&, const _Tp&)’ 233 | min(const _Tp& __a, const _Tp& __b) | ^~~ aniversari.cpp:7:21: note: ‘bday min’ 7 | } v[1000], max, min; | ^~~ aniversari.cpp:34:23: error: reference to ‘min’ is ambiguous 34 | ((min.luna == v[i].luna) && (v[i].zi > min.zi))) | ^~~ /usr/include/c++/13/bits/stl_algobase.h:281:5: note: candidates are: ‘template<class _Tp, class _Compare> const _Tp& std::min(const _Tp&, const _Tp&, _Compare)’ 281 | min(const _Tp& __a, const _Tp& __b, _Compare __comp) | ^~~ /usr/include/c++/13/bits/stl_algobase.h:233:5: note: ‘template<class _Tp> const _Tp& std::min(const _Tp&, const _Tp&)’ 233 | min(const _Tp& __a, const _Tp& __b) | ^~~ aniversari.cpp:7:21: note: ‘bday min’ 7 | } v[1000], max, min; | ^~~ aniversari.cpp:34:60: error: reference to ‘min’ is ambiguous 34 | ((min.luna == v[i].luna) && (v[i].zi > min.zi))) | ^~~ /usr/include/c++/13/bits/stl_algobase.h:281:5: note: candidates are: ‘template<class _Tp, class _Compare> const _Tp& std::min(const _Tp&, const _Tp&, _Compare)’ 281 | min(const _Tp& __a, const _Tp& __b, _Compare __comp) | ^~~ /usr/include/c++/13/bits/stl_algobase.h:233:5: note: ‘template<class _Tp> const _Tp& std::min(const _Tp&, const _Tp&)’ 233 | min(const _Tp& __a, const _Tp& __b) | ^~~ aniversari.cpp:7:21: note: ‘bday min’ 7 | } v[1000], max, min; | ^~~ aniversari.cpp:36:32: error: reference to ‘min’ is ambiguous 36 | else if (v[i].an > min.an) Min(i); | ^~~ /usr/include/c++/13/bits/stl_algobase.h:281:5: note: candidates are: ‘template<class _Tp, class _Compare> const _Tp& std::min(const _Tp&, const _Tp&, _Compare)’ 281 | min(const _Tp& __a, const _Tp& __b, _Compare __comp) | ^~~ /usr/include/c++/13/bits/stl_algobase.h:233:5: note: ‘template<class _Tp> const _Tp& std::min(const _Tp&, const _Tp&)’ 233 | min(const _Tp& __a, const _Tp& __b) | ^~~ aniversari.cpp:7:21: note: ‘bday min’ 7 | } v[1000], max, min; | ^~~ aniversari.cpp:32:16: warning: suggest explicit braces to avoid ambiguous ‘else’ [-Wdangling-else] 32 | if (v[i].an == min.an && v[i].luna != min.luna && v[i].zi != min.zi) | ^ aniversari.cpp:38:29: error: reference to ‘max’ is ambiguous 38 | else if (v[i].an <= max.an) { | ^~~ /usr/include/c++/13/bits/stl_algobase.h:303:5: note: candidates are: ‘template<class _Tp, class _Compare> const _Tp& std::max(const _Tp&, const _Tp&, _Compare)’ 303 | max(const _Tp& __a, const _Tp& __b, _Compare __comp) | ^~~ /usr/include/c++/13/bits/stl_algobase.h:257:5: note: ‘template<class _Tp> const _Tp& std::max(const _Tp&, const _Tp&)’ 257 | max(const _Tp& __a, const _Tp& __b) | ^~~ aniversari.cpp:7:16: note: ‘bday max’ 7 | } v[1000], max, min; | ^~~ aniversari.cpp:39:28: error: reference to ‘max’ is ambiguous 39 | if (v[i].an == max.an && v[i].luna != max.luna && v[i].zi != max.zi) | ^~~ /usr/include/c++/13/bits/stl_algobase.h:303:5: note: candidates are: ‘template<class _Tp, class _Compare> const _Tp& std::max(const _Tp&, const _Tp&, _Compare)’ 303 | max(const _Tp& __a, const _Tp& __b, _Compare __comp) | ^~~ /usr/include/c++/13/bits/stl_algobase.h:257:5: note: ‘template<class _Tp> const _Tp& std::max(const _Tp&, const _Tp&)’ 257 | max(const _Tp& __a, const _Tp& __b) | ^~~ aniversari.cpp:7:16: note: ‘bday max’ 7 | } v[1000], max, min; | ^~~ aniversari.cpp:39:51: error: reference to ‘max’ is ambiguous 39 | if (v[i].an == max.an && v[i].luna != max.luna && v[i].zi != max.zi) | ^~~ /usr/include/c++/13/bits/stl_algobase.h:303:5: note: candidates are: ‘template<class _Tp, class _Compare> const _Tp& std::max(const _Tp&, const _Tp&, _Compare)’ 303 | max(const _Tp& __a, const _Tp& __b, _Compare __comp) | ^~~ /usr/include/c++/13/bits/stl_algobase.h:257:5: note: ‘template<class _Tp> const _Tp& std::max(const _Tp&, const _Tp&)’ 257 | max(const _Tp& __a, const _Tp& __b) | ^~~ aniversari.cpp:7:16: note: ‘bday max’ 7 | } v[1000], max, min; | ^~~ aniversari.cpp:39:74: error: reference to ‘max’ is ambiguous 39 | if (v[i].an == max.an && v[i].luna != max.luna && v[i].zi != max.zi) | ^~~ /usr/include/c++/13/bits/stl_algobase.h:303:5: note: candidates are: ‘template<class _Tp, class _Compare> const _Tp& std::max(const _Tp&, const _Tp&, _Compare)’ 303 | max(const _Tp& __a, const _Tp& __b, _Compare __comp) | ^~~ /usr/include/c++/13/bits/stl_algobase.h:257:5: note: ‘template<class _Tp> const _Tp& std::max(const _Tp&, const _Tp&)’ 257 | max(const _Tp& __a, const _Tp& __b) | ^~~ aniversari.cpp:7:16: note: ‘bday max’ 7 | } v[1000], max, min; | ^~~ aniversari.cpp:40:34: error: reference to ‘max’ is ambiguous 40 | if ((v[i].luna < max.luna) | ^~~ /usr/include/c++/13/bits/stl_algobase.h:303:5: note: candidates are: ‘template<class _Tp, class _Compare> const _Tp& std::max(const _Tp&, const _Tp&, _Compare)’ 303 | max(const _Tp& __a, const _Tp& __b, _Compare __comp) | ^~~ /usr/include/c++/13/bits/stl_algobase.h:257:5: note: ‘template<class _Tp> const _Tp& std::max(const _Tp&, const _Tp&)’ 257 | max(const _Tp& __a, const _Tp& __b) | ^~~ aniversari.cpp:7:16: note: ‘bday max’ 7 | } v[1000], max, min; | ^~~ aniversari.cpp:41:23: error: reference to ‘max’ is ambiguous 41 | ((max.luna == v[i].luna) && (v[i].zi < max.zi))) | ^~~ /usr/include/c++/13/bits/stl_algobase.h:303:5: note: candidates are: ‘template<class _Tp, class _Compare> const _Tp& std::max(const _Tp&, const _Tp&, _Compare)’ 303 | max(const _Tp& __a, const _Tp& __b, _Compare __comp) | ^~~ /usr/include/c++/13/bits/stl_algobase.h:257:5: note: ‘template<class _Tp> const _Tp& std::max(const _Tp&, const _Tp&)’ 257 | max(const _Tp& __a, const _Tp& __b) | ^~~ aniversari.cpp:7:16: note: ‘bday max’ 7 | } v[1000], max, min; | ^~~ aniversari.cpp:41:60: error: reference to ‘max’ is ambiguous 41 | ((max.luna == v[i].luna) && (v[i].zi < max.zi))) | ^~~ /usr/include/c++/13/bits/stl_algobase.h:303:5: note: candidates are: ‘template<class _Tp, class _Compare> const _Tp& std::max(const _Tp&, const _Tp&, _Compare)’ 303 | max(const _Tp& __a, const _Tp& __b, _Compare __comp) | ^~~ /usr/include/c++/13/bits/stl_algobase.h:257:5: note: ‘template<class _Tp> const _Tp& std::max(const _Tp&, const _Tp&)’ 257 | max(const _Tp& __a, const _Tp& __b) | ^~~ aniversari.cpp:7:16: note: ‘bday max’ 7 | } v[1000], max, min; | ^~~ aniversari.cpp:43:32: error: reference to ‘max’ is ambiguous 43 | else if (v[i].an < max.an) Max(i); | ^~~ /usr/include/c++/13/bits/stl_algobase.h:303:5: note: candidates are: ‘template<class _Tp, class _Compare> const _Tp& std::max(const _Tp&, const _Tp&, _Compare)’ 303 | max(const _Tp& __a, const _Tp& __b, _Compare __comp) | ^~~ /usr/include/c++/13/bits/stl_algobase.h:257:5: note: ‘template<class _Tp> const _Tp& std::max(const _Tp&, const _Tp&)’ 257 | max(const _Tp& __a, const _Tp& __b) | ^~~ aniversari.cpp:7:16: note: ‘bday max’ 7 | } v[1000], max, min; | ^~~ aniversari.cpp:39:16: warning: suggest explicit braces to avoid ambiguous ‘else’ [-Wdangling-else] 39 | if (v[i].an == max.an && v[i].luna != max.luna && v[i].zi != max.zi) | ^
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ă.