Pagini recente » Cod sursa (job #2261127) | Cod sursa (job #1860058) | Cod sursa (job #1004711) | Istoria paginii runda/oni2007_clasa10/clasament | Cod sursa (job #1010072)
#include <fstream>
using namespace std;
ifstream f("permutari.in");
ofstream g("permutari.out");
int n,k,sol[10];
void afis()
{
int i;
for (i=1; i<=n; i++)
g<<sol[i]<<" ";
g<<'\n';
}
bool ok(int k)
{
int j;
for (j=1; j<=k-1; j++)
if (sol[j]==sol[k]) 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;
back(1);
return 0;
}