Pagini recente » Cod sursa (job #3157813) | Cod sursa (job #913648) | Cod sursa (job #1301407) | Cod sursa (job #1852717) | Cod sursa (job #1544915)
/*
http://www.infoarena.ro/problema/combinari
*/
#include <fstream>
using namespace std;
ofstream fout("combinari.out");
int N, K, st[20];
void read()
{
ifstream fin("combinari.in");
fin >> N >> K;
fin.close();
}
void print()
{
for (int i = 1; i <= K; ++i)
{
fout << st[i] << " ";
}
fout << "\n";
}
void Combinari(int top)
{
if (top > K)
{
print();
}
else
{
for (int i = st[top - 1] + 1; i <= N; ++i)
{
st[top] = i;
Combinari(top + 1);
}
}
}
int main()
{
read();
Combinari(1);
fout.close();
return 0;
}