Cod sursa(job #156787)
Utilizator | niculcioiu andrei nicucelviteaz | Data | 12 martie 2008 19:01:37 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<stdio.h>
int n,p;
int a[100];
void afis(int k)
{
int i;
for(i=1;i<=k-1;i++)
printf("%d ",a[i]);
printf("\n");
}
void back(int k)
{
int i;
if(k==p+1)
afis(k);
else
for(i=a[k-1]+1;i<=n;i++)
{
a[k]=i;
back(k+1);
}
}
int main(void)
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&n,&p);
back(1);
return 0;
}