Cod sursa(job #1403869)
Utilizator | Data | 27 martie 2015 17:07:16 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <bits/stdc++.h>
using namespace std;
int a[20], n, k;
void back(int poz)
{
int i;
if(poz == k + 1)
{
for(i = 1; i <= k; i++)
printf("%d ", a[i]);
printf("\n");
return;
}
for(i = a[poz - 1] + 1; i <= n; i++)
{
a[poz]=i;
back(poz + 1);
}
}
int main()
{
freopen("combinari.in", "r", stdin);
freopen("combinari.out", "w", stdout);
scanf("%d%d", &n, &k);
back(1);
return 0;
}