Pagini recente » Autentificare | Clasament aabbbaaa | Istoria paginii utilizator/robybrasov | Istoria paginii utilizator/woodyinho | Cod sursa (job #163946)
Cod sursa(job #163946)
#include <stdio.h>
void afisare();
void back (int k);
int verific (int k);
FILE* f;
FILE* s;
int n;
int sir[10];
int main()
{
f=fopen ("permutari.in","r");
s=fopen ("permutari.out","w");
fscanf (f,"%d",&n);
back(1);
fcloseall();
return 0;
}
void back (int k)
{
for (int i=1;i<=n;i++)
{
sir[k]=i;
if (verific(k)==1)
{
if (k==n)
afisare();
else
back (k+1);
}
}
}
int verific (int k)
{
for (int i=1;i<k;i++)
{
if (sir[i]==sir[k])
{
return 0;
}
}
return 1;
}
void afisare()
{
for (int i=1;i<=n;i++)
fprintf (s,"%d ",sir[i]);
fprintf (s,"\n");
}