Pagini recente » Istoria paginii runda/simulare_oji_2023_clasele_11_12_16_martie3 | Cod sursa (job #1803629) | Istoria paginii utilizator/liviu_gheorghe1234 | Cod sursa (job #365319) | Cod sursa (job #167725)
Cod sursa(job #167725)
#include<cstdlib>
#include<string>
int k,a[30],i,b[30],n;
void print(){
for(i=1;i<=n;i++)
printf("%d ",a[i]);
printf("\n");
}
int main(){
freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
scanf("%d",&n);
k=1;
a[k]=0;
while(k>0)
{
if(a[k]<n)
{
a[k]++;
if(b[a[k]]==0)
{
if(k==n)
print();
else
{
b[a[k]]=1; k++; a[k]=0;
}
}
}
else
{
k--;
b[a[k]]=0;
}
}
return 0;
}