Pagini recente » Cod sursa (job #2416593) | Cod sursa (job #896384) | Cod sursa (job #697096) | Cod sursa (job #1953672) | Cod sursa (job #1252583)
#include "stdio.h"
FILE *f, *g;
int n;
int s[20];
void back(int k)
{
bool ok;
if(k == n)
{
for(int i = 1; i <= n; i++)
fprintf(g, "%d ", s[i]);
fprintf(g, "\n");
}
else
{
for(int i = 1; i <= n; i++)
{
ok = true;
for(int j = 1; j <= k; j++)
if(s[j] == i)
{
ok = false;
break;
}
if(ok == true)
{
s[k+1] = i;
back(k+1);
}
}
}
}
int main()
{
f = fopen("permutari.in", "r");
g = fopen("permutari.out", "w");
fscanf(f, "%d", &n);
back(0);
fclose(f);
fclose(g);
return 0;
}