Cod sursa(job #795400)
| Utilizator | Data | 8 octombrie 2012 17:50:48 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include<cstdio>
#include<string.h>
using namespace std;
#define NMAX 18
unsigned int n,k,a[NMAX]={0};
void back(int k1)
{
if( k1 == k )
{
for(int i=1;i<=k;++i)
printf("%u ",a[i]);
printf("\n");
}
else
{
for(int i=a[k1]+1;i<=n;++i)
{
a[k1+1]=i;
back(k1+1);
}
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%u %u",&n,&k);
back(0);
return 0;
}
