Pagini recente » Cod sursa (job #1193331) | Cod sursa (job #1991211) | Cod sursa (job #3330636) | Cod sursa (job #2778110) | Cod sursa (job #3318866)
#include <fstream>
using namespace std;
int N, K, x[20];
ifstream f("combinari.in");
ofstream g("combinari.out");
void afis()
{
for(int i = 1; i <= K; i++)
g << x[i] << ' ';
g << '\n';
}
void bt(int k)
{
if(k > K)
afis();
else
for(int i = x[k - 1] + 1; i <= N; i++)
{
x[k] = i;
bt(k + 1);
}
}
int main()
{
f >> N >> K;
x[0] = 0;
bt(1);
f.close();
g.close();
return 0;
}