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