Pagini recente » Cod sursa (job #2955739) | Cod sursa (job #2344202) | Cod sursa (job #2172130) | Cod sursa (job #1602141) | Cod sursa (job #886326)
Cod sursa(job #886326)
#include <iostream>
#include <fstream>
using namespace std;
long long s[10],n,k;
ifstream f("permutari.in");
ofstream g("permutari.out");
int back(long long k)
{ long long i,j;
bool ok = true;
if (k==n)
{{for(i=1 ; i<=n ; i++)
g<<s[i]<<" " ;
} g<<'\n' ;}
else
{for(i=1 ; i<=n ; i++)
{ok=true;
for(j=1 ; j<=k ; j++)
if (s[j]==i)
{ok=false;
break;
}
if (ok==true)
{s[k+1]=i;
back(k+1);
}
}
}
}
int main()
{
int i,j;
f>>n;
back(0);
f.close();
g.close();
return 0;
}