Pagini recente » Cod sursa (job #2289296) | Cod sursa (job #1145355) | Cod sursa (job #1862371) | Cod sursa (job #2468518) | Cod sursa (job #793529)
Cod sursa(job #793529)
#include <fstream>
using namespace std;
int sol[1000],a[1000],k,i,j,n,m;
ifstream f("permutari.in");
ofstream g("permutari.out");
void afis()
{
for (i=1;i<=n;i++) g<<a[sol[i]]<<" ";
g<<'\n';
}
bool ok(int k)
{
for (i=1;i<k;i++) if (sol[k]==sol[i]) return false;
return true;
}
void back(int k)
{
int i;
if (k>m) afis();
if (k>m) afis();
else for(i=1;i<=n;i++)
{
sol[k]=i;
if (ok(k)) back(k+1);}}
int main()
{ f>>n>>m;
for (i=1;i<=n;i++) f>>a[i];
back(1);
f.close();
g.close();
return 0;
}