Cod sursa(job #906259)
| Utilizator | Data | 6 martie 2013 17:51:22 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <cstdio>
using namespace std;
int n,k;
int v[20];
void back(int sti,int step)
{
int i;
if(step==k+1)
{
for(i=1;i<=k;++i)
printf("%d ",v[i]);
printf("\n");
}
else
{
for(int i=sti;i<=n;++i)
{
v[step]=i;
back(i+1,step+1);
}
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&n,&k);
back(1,1);
return 0;
}
