Pagini recente » Cod sursa (job #2435974) | Cod sursa (job #2291072) | Cod sursa (job #3182789) | Cod sursa (job #1182499) | Cod sursa (job #719869)
Cod sursa(job #719869)
#include <stdio.h>
FILE *f, *g;
int st[10], N, i;
int valid(int k)
{
for(i = 1; i < k; ++i)
if(st[i] == st[k])
return 0;
return 1;
}
void print(void)
{
for(i = 1; i <= N; ++i)
fprintf(g, "%d ", st[i]);
fprintf(g, "\n");
}
void back(int k)
{
int i;
for(i = 1; i <= N; ++i)
{
st[k] = i;
if(valid(k))
if(k == N)
print();
else
back(k+1);
}
}
int main(void)
{
f = fopen("permutari.in", "r");
g = fopen("permutari.out", "w");
fscanf(f, "%d", &N);
back(1);
fclose(f);
fclose(g);
return 0;
}