Cod sursa(job #1468649)
| Utilizator | Data | 6 august 2015 16:35:19 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <cstdio>
using namespace std;
int n,a[20],nr;
void afisare()
{
for(int i=1;i<=nr;i++)
printf("%d ",a[i]);
printf("\n");
}
void bak(int k)
{
for(int i=a[k-1]+1;i<=n;i++)
{
a[k]=i;
if(k==nr)
afisare();
else
bak(k+1);
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&n,&nr);
bak(1);
return 0;
}
