Cod sursa(job #370548)
Utilizator | Data | 1 decembrie 2009 15:48:56 | |
---|---|---|---|
Problema | Combinari | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include<fstream.h>
#include<conio.h>
int pos,k,n,fol[101],v[101];
void perm(int poz)
{int i;
if(poz==n+1)
{pos=1;
for(i=2;i<=k;i++)
if(v[i]<v[i-1])
pos=0;
if(pos==1)
{for(i=1;i<=k;i++)
printf("%d ",v[i]);
printf("\n");}
return;}
for(i=1;i<=n;i++)
if(fol[i]==0)
{v[poz]=i;
fol[i]=1;
perm(poz+1);
fol[i]=0;
}}
int main()
{freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
int poz=1;
scanf("%d %d",&n,&k);
perm(poz);
getch();
return 0;}