Cod sursa(job #1879515)
Utilizator | Bontea Mihai Reee | Data | 14 februarie 2017 23:03:38 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int N, K;
int sol[20];
void Comb(int k)
{
if(k == K + 1)
{
for(int i = 1 ; i <= K ; i++)
fout<< sol[i] << " ";
fout << '\n';
}
else
{
for(int i = sol[k - 1] + 1 ; i <= N - K + k; i++)
{
sol[k] = i;
Comb(k + 1);
}
}
}
int main()
{
fin >> N >> K;
Comb(1);
return 0;
}