Cod sursa(job #1548751)
Utilizator | Data | 11 decembrie 2015 15:09:39 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include<cstdio>
using namespace std;
int n,k,b[20];
void afis()
{
for(int i=1;i<=n;i++) printf("%d ",b[i]);
printf("\n");
}
void backt(int pos)
{
if(pos==n+1) afis();
else{}
{
for(int i=b[pos-1]+1;i<=k;i++)
{
b[pos]=i;
backt(pos+1);
}
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d %d",&k,&n);
backt(1);
}