Cod sursa(job #1384150)
Utilizator | Data | 10 martie 2015 21:55:45 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <stdio.h>
using namespace std;
int n,k;
char v[20];
void bak(int p)
{
for(int i=v[p-1]+1;i<=n;i++)
{
v[p]=i;
if(p==k)
{
for(int j=1;j<=k;j++)
{printf("%d ", v[j]);}
printf("\n");
}
else bak(p+1);
}
}
int main()
{freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d %d",&n ,&k);
bak(1);
return 0;
}