Cod sursa(job #662947)
Utilizator | Data | 17 ianuarie 2012 14:09:04 | |
---|---|---|---|
Problema | Combinari | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <cstdio>
using namespace std;
int n,m,sol[25];
void afis ()
{
for (int i=1; i<=m; i++)
printf ("%d ",sol[i])
printf ("\n");
}
void back (int k)
{
int i;
if (k>m) afis();
else
for (i=sol[k-1]+1; i<=n; i++)
{
sol[k]=i;
back (k+1);
}
}
int main ()
{
scanf ("%d %d",&n,&m);
back (1);
return 0;
}