Pagini recente » Borderou de evaluare (job #2670406) | Cod sursa (job #980191) | Borderou de evaluare (job #1325649) | Borderou de evaluare (job #2252503) | Cod sursa (job #2174236)
#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;
}