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