Pagini recente » Cod sursa (job #1651974) | Borderou de evaluare (job #2012315) | Cod sursa (job #1863904) | Cod sursa (job #901173) | Cod sursa (job #768815)
Cod sursa(job #768815)
#include <fstream>
using namespace std;
ifstream f("permutari.in");
ofstream g("permutari.out");
int a[10],b[10];
void back(int k,int n)
{
if (k-1==n)
{
for(int i=1;i<=n;i++)
g<<a[i]<<" ";
g<<endl;
}
else
{
for(int i=1;i<=n;i++)
if(!b[i])
{
a[k]=i;
b[i]=1;
back(k+1,n);
b[i]=0;
}
}
}
int main()
{
int n;
f>>n;
back(1,n);
f.close();
g.close();
return 0;
}