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

Detalii evaluare #44971484

Rezumat problemă

#125 Permutari2

Se citeşte un număr natural nenul n, apoi n numere naturale distincte. Să se afişeze, în ordine lexicografică, permutările mulţimii formate din cele n numere citite.

Rezolvă

Detalii

Problema Permutari2 Operații I/O permutari2.in/permutari2.out
Limita timp 0.5 secunde Limita memorie Total: 64 MB / Stivă 8 MB
Id soluție #44971484 Utilizator Remus Andrei (remus2006)
Fișier permutari2.cpp Dimensiune 1017 B
Data încărcării 28 Septembrie 2023, 13:38 Scor / rezultat Eroare de compilare

Evaluare


Mesaj compilare

permutari2.cpp: In lambda function:
permutari2.cpp:8:14: error: expected '{' before '<' token
     if(st,[k]<n)

              ^
permutari2.cpp: In function 'void succesor(int, int&)':
permutari2.cpp:8:14: error: no match for 'operator<' (operand types are 'succesor(int, int&)::__lambda0' and 'int')
permutari2.cpp:8:14: note: candidates are:
In file included from /usr/include/c++/4.8/bits/stl_algobase.h:64:0,
                 from /usr/include/c++/4.8/bits/char_traits.h:39,
                 from /usr/include/c++/4.8/ios:40,
                 from /usr/include/c++/4.8/istream:38,
                 from /usr/include/c++/4.8/fstream:38,
                 from permutari2.cpp:1:
/usr/include/c++/4.8/bits/stl_pair.h:220:5: note: template<class _T1, class _T2> constexpr bool std::operator<(const std::pair<_T1, _T2>&, const std::pair<_T1, _T2>&)
     operator<(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
     ^
/usr/include/c++/4.8/bits/stl_pair.h:220:5: note:   template argument deduction/substitution failed:
permutari2.cpp:8:15: note:   'succesor(int, int&)::__lambda0' is not derived from 'const std::pair<_T1, _T2>'
     if(st,[k]<n)

               ^
In file included from /usr/include/c++/4.8/bits/stl_algobase.h:67:0,
                 from /usr/include/c++/4.8/bits/char_traits.h:39,
                 from /usr/include/c++/4.8/ios:40,
                 from /usr/include/c++/4.8/istream:38,
                 from /usr/include/c++/4.8/fstream:38,
                 from permutari2.cpp:1:
/usr/include/c++/4.8/bits/stl_iterator.h:297:5: note: template<class _Iterator> bool std::operator<(const std::reverse_iterator<_Iterator>&, const std::reverse_iterator<_Iterator>&)
     operator<(const reverse_iterator<_Iterator>& __x,
     ^
/usr/include/c++/4.8/bits/stl_iterator.h:297:5: note:   template argument deduction/substitution failed:
permutari2.cpp:8:15: note:   'succesor(int, int&)::__lambda0' is not derived from 'const std::reverse_iterator<_Iterator>'
     if(st,[k]<n)

               ^
In file included from /usr/include/c++/4.8/bits/stl_algobase.h:67:0,
                 from /usr/include/c++/4.8/bits/char_traits.h:39,
                 from /usr/include/c++/4.8/ios:40,
                 from /usr/include/c++/4.8/istream:38,
                 from /usr/include/c++/4.8/fstream:38,
                 from permutari2.cpp:1:
/usr/include/c++/4.8/bits/stl_iterator.h:347:5: note: template<class _IteratorL, class _IteratorR> bool std::operator<(const std::reverse_iterator<_Iterator>&, const std::reverse_iterator<_IteratorR>&)
     operator<(const reverse_iterator<_IteratorL>& __x,
     ^
/usr/include/c++/4.8/bits/stl_iterator.h:347:5: note:   template argument deduction/substitution failed:
permutari2.cpp:8:15: note:   'succesor(int, int&)::__lambda0' is not derived from 'const std::reverse_iterator<_Iterator>'
     if(st,[k]<n)

               ^
In file included from /usr/include/c++/4.8/bits/stl_algobase.h:67:0,
                 from /usr/include/c++/4.8/bits/char_traits.h:39,
                 from /usr/include/c++/4.8/ios:40,
                 from /usr/include/c++/4.8/istream:38,
                 from /usr/include/c++/4.8/fstream:38,
                 from permutari2.cpp:1:
/usr/include/c++/4.8/bits/stl_iterator.h:1055:5: note: template<class _IteratorL, class _IteratorR> bool std::operator<(const std::move_iterator<_Iterator>&, const std::move_iterator<_IteratorR>&)
     operator<(const move_iterator<_IteratorL>& __x,
     ^
/usr/include/c++/4.8/bits/stl_iterator.h:1055:5: note:   template argument deduction/substitution failed:
permutari2.cpp:8:15: note:   'succesor(int, int&)::__lambda0' is not derived from 'const std::move_iterator<_Iterator>'
     if(st,[k]<n)

               ^
In file included from /usr/include/c++/4.8/bits/stl_algobase.h:67:0,
                 from /usr/include/c++/4.8/bits/char_traits.h:39,
                 from /usr/include/c++/4.8/ios:40,
                 from /usr/include/c++/4.8/istream:38,
                 from /usr/include/c++/4.8/fstream:38,
                 from permutari2.cpp:1:
/usr/include/c++/4.8/bits/stl_iterator.h:1061:5: note: template<class _Iterator> bool std::operator<(const std::move_iterator<_Iterator>&, const std::move_iterator<_Iterator>&)
     operator<(const move_iterator<_Iterator>& __x,
     ^
/usr/include/c++/4.8/bits/stl_iterator.h:1061:5: note:   template argument deduction/substitution failed:
permutari2.cpp:8:15: note:   'succesor(int, int&)::__lambda0' is not derived from 'const std::move_iterator<_Iterator>'
     if(st,[k]<n)

               ^
In file included from /usr/include/c++/4.8/string:52:0,
                 from /usr/include/c++/4.8/bits/locale_classes.h:40,
                 from /usr/include/c++/4.8/bits/ios_base.h:41,
                 from /usr/include/c++/4.8/ios:42,
                 from /usr/include/c++/4.8/istream:38,
                 from /usr/include/c++/4.8/fstream:38,
                 from permutari2.cpp:1:
/usr/include/c++/4.8/bits/basic_string.h:2569:5: note: template<class _CharT, class _Traits, class _Alloc> bool std::operator<(const std::basic_string<_CharT, _Traits, _Alloc>&, const std::basic_string<_CharT, _Traits, _Alloc>&)
     operator<(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
     ^
/usr/include/c++/4.8/bits/basic_string.h:2569:5: note:   template argument deduction/substitution failed:
permutari2.cpp:8:15: note:   'succesor(int, int&)::__lambda0' is not derived from 'const std::basic_string<_CharT, _Traits, _Alloc>'
     if(st,[k]<n)

               ^
In file included from /usr/include/c++/4.8/string:52:0,
                 from /usr/include/c++/4.8/bits/locale_classes.h:40,
                 from /usr/include/c++/4.8/bits/ios_base.h:41,
                 from /usr/include/c++/4.8/ios:42,
                 from /usr/include/c++/4.8/istream:38,
                 from /usr/include/c++/4.8/fstream:38,
                 from permutari2.cpp:1:
/usr/include/c++/4.8/bits/basic_string.h:2581:5: note: template<class _CharT, class _Traits, class _Alloc> bool std::operator<(const std::basic_string<_CharT, _Traits, _Alloc>&, const _CharT*)
     operator<(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
     ^
/usr/include/c++/4.8/bits/basic_string.h:2581:5: note:   template argument deduction/substitution failed:
permutari2.cpp:8:15: note:   'succesor(int, int&)::__lambda0' is not derived from 'const std::basic_string<_CharT, _Traits, _Alloc>'
     if(st,[k]<n)

               ^
In file included from /usr/include/c++/4.8/string:52:0,
                 from /usr/include/c++/4.8/bits/locale_classes.h:40,
                 from /usr/include/c++/4.8/bits/ios_base.h:41,
                 from /usr/include/c++/4.8/ios:42,
                 from /usr/include/c++/4.8/istream:38,
                 from /usr/include/c++/4.8/fstream:38,
                 from permutari2.cpp:1:
/usr/include/c++/4.8/bits/basic_string.h:2593:5: note: template<class _CharT, class _Traits, class _Alloc> bool std::operator<(const _CharT*, const std::basic_string<_CharT, _Traits, _Alloc>&)
     operator<(const _CharT* __lhs,
     ^
/usr/include/c++/4.8/bits/basic_string.h:2593:5: note:   template argument deduction/substitution failed:
permutari2.cpp:8:15: note:   mismatched types 'const _CharT*' and 'succesor(int, int&)::__lambda0'
     if(st,[k]<n)

               ^
permutari2.cpp: In function 'int solutie(int)':
permutari2.cpp:26:5: error: 'esle' was not declared in this scope
     esle return 0;

     ^
permutari2.cpp:26:10: error: expected ';' before 'return'
     esle return 0;

          ^
permutari2.cpp: In function 'int main()':
permutari2.cpp:43:15: error: expected primary-expression before ',' token
         int k=,as,ev;

               ^
permutari2.cpp:48:23: error: 'as' was not declared in this scope
         { succesor (k,as);

                       ^
permutari2.cpp:49:27: error: 'ev' was not declared in this scope
          if(as==1)valid(k,ev);

                           ^
permutari2.cpp:51:15: error: 'as' was not declared in this scope
         while(as&&!ev)

               ^
permutari2.cpp:51:20: error: 'ev' was not declared in this scope
         while(as&&!ev)

                    ^
permutari2.cpp:52:13: error: expected ';' before 'if'
             if(as==1) if(solutie(k)==1) tipar();

             ^
permutari2.cpp:55:17: error: expected ';' before 'st'
                 st[k]=0;

                 ^
permutari2.cpp:54:14: warning: statement has no effect [-Wunused-value]
             k+1

              ^
permutari2.cpp: In function 'int solutie(int)':
permutari2.cpp:27:1: warning: control reaches end of non-void function [-Wreturn-type]
 }

 ^

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 Permutari2 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ă.