Pagini recente » Cod sursa (job #2334567) | Borderou de evaluare (job #509217) | Cod sursa (job #447934) | Borderou de evaluare (job #3255315) | Cod sursa (job #2374906)
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n, k, st[20];
void BK(int p)
{
if(p == k + 1)
{
for(int i = 1; i <= k; ++ i)
fout << st[i] <<' ';
fout <<'\n';
}
else
{
for(int i = 1 + st[p-1]; i <= n; ++ i)
{
st[p] = i;
BK(p+1);
}
}
}
int main()
{
fin >> n >> k;
BK(1);
return 0;
}