Pagini recente » Cod sursa (job #2713201) | Cod sursa (job #2678427) | Cod sursa (job #820951) | Cod sursa (job #252922) | Cod sursa (job #908328)
Cod sursa(job #908328)
#include <fstream>
using namespace std;
ifstream in ("combinari.in"); ofstream out("combinari.out");
int n,k;
short sol[20];
void back(int l)
{
if(l==k) {
for(int i = 1; i <= k; i++)
out << sol[i] << ' ';
out << '\n';
}
else
for(int i = sol[l]+1; i <= n; i++)
{
sol[l+1]=i;
back(l+1);
}
}
int main()
{
in >> n >> k;
back(0);
return 0;
}