Pagini recente » Cod sursa (job #1189589) | Cod sursa (job #540145) | Cod sursa (job #446031) | Cod sursa (job #1176844) | Cod sursa (job #1546069)
#include <fstream>
using namespace std;
ifstream in("permutari.in");
ofstream out("permutari.out");
int n;
int a[15];
void back(int k)
{
int i,j;
bool ok;
if(k==n)
{
for(i=1;i<=n;i++) out<<a[i]<<" ";
out<<"\n";
}else{
for(i=1;i<=n;i++)
{
ok=1;
for(j=1;j<=k;j++)
{
if(a[j]==i)
{
ok=0;
break;
}
}
if(ok)
{
a[k+1]=i;
back(k+1);
}
}
}
}
int main()
{
in>>n;
back(0);
in.close();
out.close();
return 0;
}