Cod sursa(job #1005273)
Utilizator | Iordache Ioan-Bogdan iordache.bogdan | Data | 4 octombrie 2013 17:37:12 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <stdio.h>
int n,m;
int a[20];
bool b[20];
void back(int k)
{
if(k-1==m)
{
for(int i=1;i<=m;i++)
printf("%d ", a[i]);
printf("\n");
}
else
{
for(int i=a[k-1]+1;i<=n-(m-k);i++)
if(b[i]==0)
{
b[i]=1;
a[k]=i;
back(k+1);
b[i]=0;
}
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d %d", &n, &m);
back(1);
return 0;
}