Pagini recente » Cod sursa (job #2593558) | Cod sursa (job #578736) | Cod sursa (job #2502743) | Monitorul de evaluare | Cod sursa (job #145730)
Cod sursa(job #145730)
#include<stdio.h>
#define nmax 10
int i, k, n, ok, s[nmax];
void afisare()
{
int i;
for(i=1; i<=n; i++) printf("%d ", s[i]);
printf("\n");
}
int main()
{
freopen ("permutari.in", "r", stdin);
freopen ("permutari.out", "w", stdout);
scanf("%d", &n);
k=1; s[k]=0;
while(k){
s[k]++;
ok=0;
while( !ok && s[k]<=n ){
ok=1;
for(i=1; i<k; i++) if(s[i]==s[k]) ok=0;
if(!ok) s[k]++;
}
if(s[k]<=n)
if(k==n) afisare();
else{ k++; s[k]=0; }
else k--;
}
return 0;
}