Pagini recente » Cod sursa (job #2455815) | Cod sursa (job #682574) | Cod sursa (job #1459211) | Cod sursa (job #2284514) | Cod sursa (job #679986)
Cod sursa(job #679986)
#include <cstdio>
int v[20];
bool evalabil(int st, int n){
int j;
if(v[st]>n) return 0;
for(j=1; j<st; ++j){
if(v[j]==v[st]) return 0;
}
return 1;
}
int main(){
freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
int n,i,st;
scanf("%d",&n);
st=1;
while(st>0){
v[st]++;
if(evalabil(st, n)){
if(st==n){
for(i=1; i<=n; ++i)
printf("%d ",v[i]);
printf("\n");
}
else
st++;
}
else
if(v[st]>n){
v[st]=0;
st--;
}
}
}