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

Detalii evaluare #64167391

Rezumat problemă

serbare
#1460

La o serbare sunt n grupe de copii care poartă p tipuri de uniforme. Scrieţi un program care să afişeze pe ecran tipurile de uniforme în ordinea descrescătoare a numărului total de copii ce poartă fiecare tip de uniformă. Afişarea se va face pe o singură linie, valoriile fiind separate printr-un spaţiu.

Variante Bacalaureat 2007
Fișiere Antal Alexandru (Courage) ușoară
Clasa 10 Structuri de date neomogene Probleme diverse
Rezolvă

Detalii

Problema serbare Operații I/O serbare.in/serbare.out
Limita timp 0.1 secunde Limita memorie Total: 64 MB / Stivă 8 MB
Id soluție #64167391 Utilizator Copil Tania (Tania_Copil)
Fișier serbare.cpp Dimensiune 828 B
Data încărcării 21 Aprilie 2026, 11:58 Scor/rezultat Eroare de compilare

Evaluare

Mesaj compilare

serbare.cpp:13:25: error: ‘Unifroma’ has not been declared
   13 | void CitireTip(int &p , Unifroma u[])
      |                         ^~~~~~~~
serbare.cpp: In function ‘void CitireTip(int&, int*)’:
serbare.cpp:17:14: error: request for member ‘tip’ in ‘*(u + ((sizetype)(((long unsigned int)i) * 4)))’, which is of non-class type ‘int’
   17 |         u[i].tip = i;
      |              ^~~
serbare.cpp:18:14: error: request for member ‘nr’ in ‘*(u + ((sizetype)(((long unsigned int)i) * 4)))’, which is of non-class type ‘int’
   18 |         u[i].nr = 0;
      |              ^~
serbare.cpp: At global scope:
serbare.cpp:22:22: error: ‘Unifroma’ has not been declared
   22 | void CitireN(int &n, Unifroma u[])
      |                      ^~~~~~~~
serbare.cpp: In function ‘void CitireN(int&, int*)’:
serbare.cpp:28:16: error: request for member ‘nr’ in ‘*(u + ((sizetype)(((long unsigned int)tip) * 4)))’, which is of non-class type ‘int’
   28 |         u[tip].nr += copii;
      |                ^~
serbare.cpp: In function ‘int main()’:
serbare.cpp:42:17: error: invalid conversion from ‘Uniforma*’ to ‘int’ [-fpermissive]
   42 |     for(int i= u+1 ;  i < n ; ++i)
      |                ~^~
      |                 |
      |                 Uniforma*
serbare.cpp:44:23: error: no match for ‘operator>’ (operand types are ‘Uniforma’ and ‘Uniforma’)
   44 |             if ( u[i] > u[j])
      |                  ~~~~ ^ ~~~~
      |                     |      |
      |                     |      Uniforma
      |                     Uniforma
In file included from /usr/include/c++/13/string:48,
                 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/istream:40,
                 from /usr/include/c++/13/fstream:40,
                 from serbare.cpp:1:
/usr/include/c++/13/bits/stl_iterator.h:469:5: note: candidate: ‘template<class _Iterator> bool std::operator>(const reverse_iterator<_Iterator>&, const reverse_iterator<_Iterator>&)’
  469 |     operator>(const reverse_iterator<_Iterator>& __x,
      |     ^~~~~~~~
/usr/include/c++/13/bits/stl_iterator.h:469:5: note:   template argument deduction/substitution failed:
serbare.cpp:44:28: note:   ‘Uniforma’ is not derived from ‘const std::reverse_iterator<_Iterator>’
   44 |             if ( u[i] > u[j])
      |                            ^
/usr/include/c++/13/bits/stl_iterator.h:514:5: note: candidate: ‘template<class _IteratorL, class _IteratorR> bool std::operator>(const reverse_iterator<_Iterator>&, const reverse_iterator<_IteratorR>&)’
  514 |     operator>(const reverse_iterator<_IteratorL>& __x,
      |     ^~~~~~~~
/usr/include/c++/13/bits/stl_iterator.h:514:5: note:   template argument deduction/substitution failed:
serbare.cpp:44:28: note:   ‘Uniforma’ is not derived from ‘const std::reverse_iterator<_Iterator>’
   44 |             if ( u[i] > u[j])
      |                            ^
/usr/include/c++/13/bits/stl_iterator.h:1725:5: note: candidate: ‘template<class _IteratorL, class _IteratorR> bool std::operator>(const move_iterator<_IteratorL>&, const move_iterator<_IteratorR>&)’
 1725 |     operator>(const move_iterator<_IteratorL>& __x,
      |     ^~~~~~~~
/usr/include/c++/13/bits/stl_iterator.h:1725:5: note:   template argument deduction/substitution failed:
serbare.cpp:44:28: note:   ‘Uniforma’ is not derived from ‘const std::move_iterator<_IteratorL>’
   44 |             if ( u[i] > u[j])
      |                            ^
/usr/include/c++/13/bits/stl_iterator.h:1784:5: note: candidate: ‘template<class _Iterator> bool std::operator>(const move_iterator<_IteratorL>&, const move_iterator<_IteratorL>&)’
 1784 |     operator>(const move_iterator<_Iterator>& __x,
      |     ^~~~~~~~
/usr/include/c++/13/bits/stl_iterator.h:1784:5: note:   template argument deduction/substitution failed:
serbare.cpp:44:28: note:   ‘Uniforma’ is not derived from ‘const std::move_iterator<_IteratorL>’
   44 |             if ( u[i] > u[j])
      |                            ^
In file included from /usr/include/c++/13/bits/stl_algobase.h:64,
                 from /usr/include/c++/13/string:51:
/usr/include/c++/13/bits/stl_pair.h:848:5: note: candidate: ‘template<class _T1, class _T2> constexpr bool std::operator>(const pair<_T1, _T2>&, const pair<_T1, _T2>&)’
  848 |     operator>(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
      |     ^~~~~~~~
/usr/include/c++/13/bits/stl_pair.h:848:5: note:   template argument deduction/substitution failed:
serbare.cpp:44:28: note:   ‘Uniforma’ is not derived from ‘const std::pair<_T1, _T2>’
   44 |             if ( u[i] > u[j])
      |                            ^
In file included from /usr/include/c++/13/string:54:
/usr/include/c++/13/bits/basic_string.h:3870:5: note: candidate: ‘template<class _CharT, class _Traits, class _Alloc> bool std::operator>(const __cxx11::basic_string<_CharT, _Traits, _Alloc>&, const __cxx11::basic_string<_CharT, _Traits, _Alloc>&)’
 3870 |     operator>(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
      |     ^~~~~~~~
/usr/include/c++/13/bits/basic_string.h:3870:5: note:   template argument deduction/substitution failed:
serbare.cpp:44:28: note:   ‘Uniforma’ is not derived from ‘const std::__cxx11::basic_string<_CharT, _Traits, _Alloc>’
   44 |             if ( u[i] > u[j])
      |                            ^
/usr/include/c++/13/bits/basic_string.h:3884:5: note: candidate: ‘template<class _CharT, class _Traits, class _Alloc> bool std::operator>(const __cxx11::basic_string<_CharT, _Traits, _Alloc>&, const _CharT*)’
 3884 |     operator>(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
      |     ^~~~~~~~
/usr/include/c++/13/bits/basic_string.h:3884:5: note:   template argument deduction/substitution failed:
serbare.cpp:44:28: note:   ‘Uniforma’ is not derived from ‘const std::__cxx11::basic_string<_CharT, _Traits, _Alloc>’
   44 |             if ( u[i] > u[j])
      |                            ^
/usr/include/c++/13/bits/basic_string.h:3897:5: note: candidate: ‘template<class _CharT, class _Traits, class _Alloc> bool std::operator>(const _CharT*, const __cxx11::basic_string<_CharT, _Traits, _Alloc>&)’
 3897 |     operator>(const _CharT* __lhs,
      |     ^~~~~~~~
/usr/include/c++/13/bits/basic_string.h:3897:5: note:   template argument deduction/substitution failed:
serbare.cpp:44:28: note:   mismatched types ‘const _CharT*’ and ‘Uniforma’
   44 |             if ( u[i] > u[j])
      |                            ^

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 serbare 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!