Pagini recente » Cod sursa (job #2518739) | Cod sursa (job #1412118) | Cod sursa (job #2329206) | Cod sursa (job #196928) | Cod sursa (job #2119572)
#include <fstream>
using namespace std;
int n,sol[10],i,k;
ifstream f ("permutari.in");
ofstream g ("permutari.out");
void afis ()
{
for (int i=1;i<=n;i++) g<<sol[i]<<" ";
g<<'\n';
}
bool ok (int k)
{
int i;
for (i=1;i<k;i++)
{
if (sol[k]==sol[i]) return false;
}
return true;
}
void Back (int k)
{
int i;
if (k>n)
{
afis();
}
else
{
for (i=1;i<=n;i++)
{
sol[k]=i;
if (ok(k)) Back(k+1);
}
}
}
int main()
{
f>>n;
k=1;
Back(1);
return 0;
}