Cod sursa(job #2174232)
Utilizator | Data | 16 martie 2018 11:20:07 | |
---|---|---|---|
Problema | Combinari | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <iostream>
using namespace std;
long int s[20];
long int n, k;
void backt( long int l )
{
long int i;
if ( l == k )
{
for ( i = 1; i <= k; i++ )
{
cout << s[i] << ' ';
}
cout << '\n';
return;
}
else
{
for ( i = s[l]; i <= n; i++ )
{
s[l + 1] = i;
backt(l + 1);
}
return;
}
return;
}
int main()
{
cin >> n >> k;
backt(0);
return 0;
}