Cod sursa(job #1605773)
Utilizator | Data | 19 februarie 2016 14:53:14 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include<cstdio>
int n,k1,st[19];
void back(int k)
{
if(k==k1+1)
{
for(int i=1;i<=k1;i++)
printf("%d ",st[i]);
printf("\n");
}
else
for(int i=st[k-1]+1;i<=n;i++)
{
st[k]=i;
back(k+1);
}
}
int main ()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&n,&k1);
back(1);
return 0;
}