Pagini recente » Istoria paginii preoni-2007/runda-finala/solutii | Cod sursa (job #2393375) | Cod sursa (job #152147) | Cod sursa (job #2866971) | Cod sursa (job #1999026)
#include <fstream>
using namespace std;
ifstream fin("permutari.in");
ofstream fout("permutari.out");
int permutare[9], use[9], n;
void bkt(int k)
{
int i;
if (k==n+1)
{
for (i=1;i<=n;i++)
fout<<permutare[i]<<" ";
fout<<'\n';
use[permutare[n]]=0;
}
else for (i=1;i<=n;i++)
if (use[i]==0)
{
permutare[k]=i;
use[i]=1;
bkt(k+1);
}
use[permutare[k-1]]=0;
}
int main()
{
fin>>n;
bkt(1);
return 0;
}