Cod sursa(job #413612)
Utilizator | Data | 8 martie 2010 20:34:36 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<stdio.h>
int n,k,v[20];
void afisare()
{
for(int i=1;i<=k;i++)
printf("%d ",v[i]);
printf("\n");
}
void back(int s)
{
if(s>k)
{
afisare();
return;
}
v[s]=v[s-1]+1;
while(v[s]<=n)
{
back(s+1);
v[s]++;
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&n,&k);
back(1);
return 0;
}