Pagini recente » Cod sursa (job #2224906) | Cod sursa (job #1041142) | Cod sursa (job #286943) | Cod sursa (job #2185645) | Cod sursa (job #2107640)
#include <fstream>
using namespace std;
int i,n,len;
int a[100],b[100];
ifstream fin("permutari.in");
ofstream fout("permutari.out");
void backt(int k,int len)
{
if(k-1 == len)
{
for(int i = 1; i <= len;i++)
fout<<a[i]<<" ";
fout<<endl;
}
else
{
for(int i = 1; i <= len; i++)
if(!b[i])
{
a[k] = i;
b[i] = 1;
backt(k+1,len);
b[i] = 0;
}
}
}
int main()
{
fin>>n;
backt(1,n);
fin.close();
fout.close();
return 0;
}