Cod sursa(job #1879509)
Utilizator | Bontea Mihai Reee | Data | 14 februarie 2017 22:55:00 |
---|---|---|---|
Problema | Combinari | Scor | 80 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <fstream>
#define NMAX 20
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int N, K, st[NMAX];
void Combinari(int k)
{
if (k == K + 1)
{
for (int i = 1 ; i <= K ; ++i)
fout << st[i] << " ";
fout << endl;
}
else
{
for (int i = st[k - 1] + 1 ; i <= N - K + k ; ++i)
{
st[k] = i;
Combinari(k + 1);
}
}
}
int main()
{
fin >> N >> K;
Combinari(1);
return 0;
}