Cod sursa(job #880824)
Utilizator | Data | 17 februarie 2013 13:34:14 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
#define dmax 20
std::ifstream in("combinari.in");
std::ofstream out("combinari.out");
using std::endl;
int n, k, stack[dmax];
void comb(int c)
{
if ( c == k + 1 )
{
for (int i = 1; i <= k; ++i)
out << stack[i] << " ";
out << '\n';
}
else
{
for (int i = stack[c - 1] + 1; i <= n; ++i) {
stack[c] = i;
comb(c + 1);
}
}
}
int main()
{
in >> n >> k;
in.close();
comb(1);
out.close();
return 0;
}