Pagini recente » Cod sursa (job #179841) | Cod sursa (job #2281796) | Cod sursa (job #497775) | Cod sursa (job #2219073) | Cod sursa (job #528421)
Cod sursa(job #528421)
#include <fstream>
using namespace std;
int n,A[11];
ifstream f ("permutari.in");
ofstream g ("permutari.out");
void bt(int k)
{
int i,j,ok;
if (k==n)
{
for (i=1;i<=n;i++)
g<<A[i]<<" ";
g<<endl;
}
else
{
for (i=1;i<=n;i++)
{
ok=0;
for (j=1;j<=k;j++)
if (A[j]==i)
{
ok=1;
break;
}
if (ok==0)
{
A[k+1]=i;
bt(k+1);
}
}
}
}
int main()
{
f>>n;
bt(0);
f.close();
g.close();
return 0;
}