Cod sursa(job #1146560)
Utilizator | Savulescu Stefan savulescustefan | Data | 19 martie 2014 09:08:18 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <cstdio>
using namespace std;
int k,n,sol[22],i,m;
void afisare ()
{
int i;
for (i=1;i<=m;i++)
printf ("%d ", sol[i]);
printf ("\n");
}
void back (int k)
{
int i;
if (k>m)
afisare ();
else
{
for (i=sol[k-1]+1;i<=n;i++)
{
sol[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;
}