Cod sursa(job #353824)
Utilizator | Data | 6 octombrie 2009 13:23:19 | |
---|---|---|---|
Problema | Combinari | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include<stdio.h>
int st[20],n,K;
void back(int k)
{
int p;
for(p=st[k-1]+1;p<=n;p++)
{
st[k]=p;
if(k==K)
{
for(int i=1;i<=K;i++)
printf("%d ",st[i]);
printf("\n");
}
back(k+1);
}
}
int main()
{
freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
scanf("%d%d",&n,&K);
back(0);
return 0;
}