Cod sursa(job #1193242)
Utilizator | Tudor Costin Razvan Zenus | Data | 31 mai 2014 12:38:29 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <cstdio>
using namespace std;
#define NMAX 25
int sol[NMAX];
int N,K;
void afis()
{
for (int i=2;i<=K+1;++i)
printf("%d ",sol[i]);
printf("\n");
}
void back(int k)
{
if (k>K)
{
afis();
return ;
}
for (int i=sol[k]+1;i<=N;++i)
{
sol[k+1]=i;
back(k+1);
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&N,&K);
back(1);
return 0;
}