Pagini recente » Cod sursa (job #2618100) | Cod sursa (job #87000) | Cod sursa (job #1064459) | Cod sursa (job #437623) | Cod sursa (job #2206414)
#include <fstream>
using namespace std;
int v[10];
int n;
ifstream f("permutari.in");
ofstream g("permutari.out");
bool ok(int k, int p)
{
for(int i=1; i<k; i++)
{
if(v[p]==v[i])
return 0;
}
return 1;
}
void back(int k)
{
if(k<=n)
{
for(int i=1; i<=n; i++)
{
if(ok(k, i))
{v[k]=i;
back(k+1);}}
}
else
{for(int i=1; i<=n; i++)
g<<v[i]<<" ";
g<<endl;}
}
int main()
{
f>>n;
back(1);
return 0;
}