Cod sursa(job #272760)
Utilizator | Data | 7 martie 2009 19:25:55 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include<stdio.h>
int sol[101],n,m;
void back (int k,int m,int p)
{
int i,j;
if (k==m+1)
{
for (j=1; j<=m; ++j)
printf ("%d ",sol[j]);
printf ("\n");
}
else
for (i=p+1; i<=n; ++i)
{
sol[k]=i;
back (k+1,m,i);
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&n,&m);
back (1,m,0);
return 0;
}