Cod sursa(job #446840)
Utilizator | Data | 26 aprilie 2010 19:29:11 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include<stdio.h>
int n,k,v[19];
int kiir()
{
for(int i=1;i<=k;i++)
printf("%d ",v[i]);
printf("\n");
return 0;
}
int comb(int p)
{
if(p<=n)
for(int i=v[p-1]+1;i<=n;i++)
{
v[p]=i;
if(p==k) kiir();
else comb(p+1);
}
return 0;
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d %d", &n, &k);
comb(1);
return 0;
}