Pagini recente » preoni2008-runda1-10 | Clasament autumn2007-runda2 | Rating andreycurent (an_drey_curent) | Cod sursa (job #3299837) | Cod sursa (job #947460)
Cod sursa(job #947460)
#include <cstdlib>
#include <fstream>
using namespace std;
const int NMAX = 18;
int N, K;
int v[NMAX];
ofstream out("combinari.out");
inline void back(int idx)
{
if(K == idx - 1)
{
for(int i = 1; i <= K; ++i)
out << v[i] << ' ';
out << '\n';
}
else for(int i = v[idx - 1] + 1; i <= N; ++i)
{
v[idx] = i;
back(idx + 1);
}
}
int main()
{
ifstream in("combinari.in");
in >> N >> K;
back(1);
return EXIT_SUCCESS;
}