Pagini recente » Cod sursa (job #621071) | Cod sursa (job #2041825) | Cod sursa (job #2234552) | Cod sursa (job #1661842) | Cod sursa (job #269928)
Cod sursa(job #269928)
#include<iostream.h>
#include<fstream.h>
int n,sol[100],h[100];
ifstream in("permutari.in");
ofstream out("permutari.out");
void back(int k)
{
int i;
if(k==n+1)
{
for(i=1;i<=n;i++)
out<<sol[i]<<" ";
out<<endl;
}
else
{
for(i=1;i<=n;i++)
{
if(h[i]==1) continue;
h[i]=1;sol[k]=i;
back(k+1);
h[i]=0;
}
}
}
int main()
{
in>>n;
in.close();
back(1);
out.close();
return 0;
}