Cod sursa(job #1141146)
Utilizator | Stefanescu Andru andru47 | Data | 12 martie 2014 17:33:35 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.58 kb |
#include <cstdio>
using namespace std;
int a[20],sol[20],i,n,m;
void afis()
{
int i;
for (i=1; i<=m; i++)
printf("%d ",a[sol[i]]);
printf("\n");
return ;
}
void backk(int k)
{
int i;
if (k>m)afis();
else
{
for (i=sol[k-1]+1; i<=n; i++)
{
sol[k]=i;
backk(k+1);
}
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d %d",&n,&m);
sol[0]=0;
for (i=1; i<=n; i++)
a[i]=i;
backk(1);
return 0;
}