Cod sursa(job #2025763)
| Utilizator | Data | 23 septembrie 2017 11:09:30 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <cstdio>
using namespace std;
int x[20],n,k,nr;
void afisare()
{
for (int i = 1; i<=k; i++)
printf("%d ",x[i]);
printf("\n");
}
void bck(int i)
{
for (int j = x[i-1]+1; j<=n; j++)
{
x[i] = j;
if (i == k)
afisare();
else
bck(i+1);
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d %d",&n,&k);
bck(1);
}
