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