Pagini recente » Cod sursa (job #67055) | Cod sursa (job #3246713) | Cod sursa (job #3198947) | Cod sursa (job #38983) | Cod sursa (job #2460117)
#include <fstream>
#include <iostream>
#include <bitset>
using namespace std;
ifstream fin("permutari.in");
ofstream fout("permutari.out");
bitset <10> used;
int v[10],n;
void bkt(int);
int main()
{
fin>>n;
bkt(1);
return 0;
}
void bkt(int p)
{
if(p==n+1){for(int i=1;i<=n;i++)fout<<v[i]<<' ';fout<<endl;return;}
for(int i=1;i<=n;i++)
if(!used[i])
{
used[i]=1;
v[p]=i;
bkt(p+1);
used[i]=0;
}
}