Pagini recente » Cod sursa (job #1983242) | Cod sursa (job #476392) | Cod sursa (job #645646) | Cod sursa (job #2864507) | Cod sursa (job #1007765)
#include <fstream>
using namespace std;
ifstream is("combinari.in");
ofstream os("combinari.out");
void WRITE();
void SOLVE(int q);
int n, k;
int x[20];
int main()
{
is >> n >> k;
SOLVE(1);
is.close();
os.close();
return 0;
}
void SOLVE(int q)
{
if ( q > k )
{
WRITE();
return;
}
for ( int i = x[q - 1] + 1; i <= n; ++i )
{
x[q] = i;
SOLVE(q + 1);
}
}
void WRITE()
{
for ( int i = 1; i <= k; ++i )
os << x[i] << " ";
os << "\n";
}