Cod sursa(job #1280568)
Utilizator | Delia Draghici delia_99 | Data | 2 decembrie 2014 09:56:34 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.58 kb |
#include <cstdio>
using namespace std;
int n,k,i,a[25],sol[25],p;
void afis()
{
int j;
for(j=1;j<=k;++j)
printf("%d ",sol[j]);
printf("\n");
return;
}
void back(int p)
{
int i;
if(p>k)
afis();
else
{
for(i=sol[p-1]+1; i<=n; ++i)
{
sol[p]=i;
back(p+1);
}
}
return;
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d %d",&n,&k);
for(i=1; i<=n; ++i)
a[i]=i;
back(1);
return 0;
}