Cod sursa(job #159916)
Utilizator | Tudose Vlad seal | Data | 14 martie 2008 15:16:39 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include<stdio.h>
#define Nm 18
int C[Nm],n,k;
void back(int p)
{
int i;
if(p==k)
{
for(i=0;i<k-1;++i)
printf("%d ",C[i]);
printf("%d\n",C[i]);
}
else
for(i=C[p-1]+1;i<=n-k+p+1;++i)
{
C[p]=i;
back(p+1);
}
}
int main()
{
int i;
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&n,&k);
for(i=1;i<=n-k+1;++i)
{
C[0]=i;
back(1);
}
return 0;
}