Cod sursa(job #268383)
Utilizator | Data | 1 martie 2009 11:01:43 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include<stdio.h>
int n,k,x[20];
void readd(),back(int poz),afisare();
int main()
{
readd();
back(1);
return 0;
}
void readd()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&n,&k);
}
void back(int poz)
{
int i;
if(poz==k+1){afisare();return;}
for(i=x[poz-1]+1;i<=n-k+poz;i++)
{ x[poz]=i;back(poz+1);}
}
void afisare()
{
int i;
for(i=1;i<=k;i++)printf("%d ",x[i]);
printf("\n");
}