Rezumat problemă

permutari5

#3161

Se citește o multime cu n numere naturale. Afișați toate permutările mulțimii citite în care elementul minim nu își schimbă poziția.

Consola Muresan Ciprian (mcip1977) Ciprian Muresan ușoară

Clasa 11 Backtracking Elemente de combinatorică

Rezolvă

Detalii

Problema	permutari5	Operații I/O	tastatură/ecran
Limita timp	0.1 secunde	Limita memorie	Total: 64 MB / Stivă 8 MB
Id soluție	#64219497	Utilizator	vargolici maria (mariavargolici19)
Fișier	permutari5.cpp	Dimensiune	1.63 KB
Data încărcării	23 Aprilie 2026, 15:40	Scor/rezultat	Eroare de compilare

Evaluare

Mesaj compilare

permutari5.cpp: In function ‘bool ok()’:
permutari5.cpp:22:5: warning: this ‘for’ clause does not guard... [-Wmisleading-indentation]
   22 |     for(int i=1; i<k; i++)
      |     ^~~
permutari5.cpp:25:9: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the ‘for’
   25 |         if(x[pozmin]!= min)
      |         ^~
permutari5.cpp:25:24: error: reference to ‘min’ is ambiguous
   25 |         if(x[pozmin]!= min)
      |                        ^~~
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 permutari5.cpp:9:
/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)
      |     ^~~
permutari5.cpp:12:24: note:                 ‘int min’
   12 | int x[10], n,k, v[10], min=-1, pozmin=-1,y ;
      |                        ^~~
permutari5.cpp: In function ‘void back(int)’:
permutari5.cpp:38:12: warning: suggest explicit braces to avoid ambiguous ‘else’ [-Wdangling-else]
   38 |          if(ok())
      |            ^
permutari5.cpp: In function ‘void minim()’:
permutari5.cpp:50:14: error: reference to ‘min’ is ambiguous
   50 |         if(y<min)
      |              ^~~
/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)
      |     ^~~
permutari5.cpp:12:24: note:                 ‘int min’
   12 | int x[10], n,k, v[10], min=-1, pozmin=-1,y ;
      |                        ^~~
permutari5.cpp:52:13: error: reference to ‘min’ is ambiguous
   52 |             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)
      |     ^~~
permutari5.cpp:12:24: note:                 ‘int min’
   12 | int x[10], n,k, v[10], min=-1, pozmin=-1,y ;
      |                        ^~~
permutari5.cpp: In function ‘int main()’:
permutari5.cpp:84:1: error: ‘sortat’ was not declared in this scope; did you mean ‘strcat’?
   84 | sortat();
      | ^~~~~~
      | strcat

Cum funcționează evaluarea?