Cod sursa(job #1491825)
| Utilizator | Data | 26 septembrie 2015 10:45:47 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include<stdio.h>
using namespace std;
int x[20], uz[20], n, k;
void afis()
{
int i;
for(i = 1; i <= k; i++)
printf("%d ",x[i]);
printf("\n");
}
void backt(int p)
{
int i;
if(p > k)
afis();
else
for(i = x[p - 1] + 1; i <= n; i++)
{
x[p] = i;
backt(p + 1);
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d %d", &n, &k);
backt(1);
fclose(stdin);
fclose(stdout);
return 0;
}
