Cod sursa(job #908327)
Utilizator | Data | 9 martie 2013 10:30:08 | |
---|---|---|---|
Problema | Combinari | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <iostream>
using namespace std;
int n,k;
short sol[20];
void back(int l)
{
if(l==k) {
for(int i = 1; i <= k; i++)
cout << sol[i] << ' ';
cout << '\n';
}
else
for(int i = sol[l]+1; i <= n; i++)
{
sol[l+1]=i;
back(l+1);
}
}
int main()
{
cin >> n >> k;
back(0);
return 0;
}