Cod sursa(job #265309)
Utilizator | alexandru alexandru92 | Data | 23 februarie 2009 19:30:08 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include<stdio.h>
//#include<conio.h>
int n,v[20],p;
void back(int k)
{
if(k-1==p) {for(int i=1;i<=p;i++) printf("%d ",v[i]); printf("\n");}
else for(int i=v[k-1]+1;i<=n;i++)
{v[k]=i;
back(k+1);
}
}
int main()
{
freopen("combinari.in","rt",stdin);
freopen("combinari.out","wt",stdout);
scanf("%d %d",&n,&p);
back(1);
// getche();
return 0;
}