Cod sursa(job #220113)
Utilizator | Data | 9 noiembrie 2008 14:47:30 | |
---|---|---|---|
Problema | Combinari | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include<stdio.h>
int n,m,a[100];
void back(int k)
{
int j,i;
if(k-1==m)
{
for(j=1;j<=m;j++)
{
printf("%d",a[j]);
}
printf(" \n");
}
else
{
for(i=a[k-1]+1;i<=n-m+k;i++)
{
a[k]=i;
back(k+1);
}
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d %d",&n,&m);
back(1);
return 0;
}