Cod sursa(job #640705)
| Utilizator | Data | 26 noiembrie 2011 12:58:07 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <stdio.h>
using namespace std;
int n,p,k,st[20];
void combi(int);
void tipar(void);
int main (void)
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&n,&p);
combi(1);
return 0;
}
void combi(int k)
{
int i;
if(k>p) tipar();
else if(k==1) for(i=1;i<=n;i++) st[k]=i, combi(k+1);
else for(i=st[k-1]+1;i<=n;i++) st[k]=i, combi(k+1);
}
void tipar()
{
int i;
for(i=1;i<=p;i++) printf("%d ",st[i]);
printf("\n");
}
