Pagini recente » Cod sursa (job #3190516) | Cod sursa (job #14453) | Cod sursa (job #25998) | Cod sursa (job #2136495) | Cod sursa (job #1605545)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin ("combinari.in");
ofstream fout ("combinari.out");
int N,K;
vector <int> solution;
void Back(int p)
{
int i;
if (p > K)
{
for(i = 1;i <= K; ++i)
fout <<solution[i] <<' ';
fout <<'\n';
}
else
for (i = solution[p-1]+1; i <= N; ++i)
{
solution[p]=i;
Back(p+1);
}
}
int main()
{
fin >>N >>K;
Back(1);
return 0;
}