Pagini recente » Cod sursa (job #1486925) | Cod sursa (job #3174906) | Cod sursa (job #1477114) | Cod sursa (job #11014) | Cod sursa (job #299544)
Cod sursa(job #299544)
#include<cstdio>
using namespace std;
int sol[10];
int valid(int k)
{
int i;
for (i=1;i<k;i++)
if (sol[i]==sol[k])
return 0;
return 1;
}
int main()
{
int n, altul, k,i;
FILE *f=fopen("permutari.in","r");
FILE *g=fopen("permutari.out","w");
fscanf(f,"%d",&n);
k=1;
while (k)
{
do
{
if (sol[k]<n)
{
sol[k]++;
altul=1;
}
else altul=0;
}
while (altul && !valid(k));
if (altul)
{
if (k==n)
{
for (i=1;i<=n;i++)
fprintf(g,"%d ",sol[i]);
fprintf(g,"\n");
}
else
{
k++;
sol[k]=0;
}
}
else k--;
}
return 0;
}