Cod sursa(job #266333)
Utilizator | Data | 25 februarie 2009 12:00:31 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <stdio.h>
int s[1000],k,n,m;
void back(int k)
{
if(k==m+1)
{
for(int i=1;i<=m;i++)
printf("%d ",s[i]);
printf("\n");
return;
}
for (int i=s[k-1]+1; i<=n-(m-k); i++)
{
s[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;
}