Pagini recente » Infoarena Monthly 2014, Clasament Runda 1 | Cod sursa (job #648583) | Cod sursa (job #1197818) | Borderou de evaluare (job #2100070) | Cod sursa (job #1652710)
#include <fstream>
using namespace std;
FILE * fin = fopen("permutari.in", "r");
FILE * fout = fopen("permutari.out", "w");
void perm(int k);
void afisare();
int n;
int use[10], sol[10];
int main()
{
fscanf(fin, "%d", &n);
perm(1);
fclose(fin);
fclose(fout);
return 0;
}
void perm(int k)
{
if (k==n+1)
{
afisare();
return;
}
int i;
for (i=1; i<=n; i++)
if (!use[i])
{
use[i]=1;
sol[k]=i;
perm(k+1);
use[i]=0;
}
}
void afisare()
{
int i;
for (i=1; i<=n; i++) fprintf(fout, "%d ", sol[i]);
fprintf(fout, "\n");
}