Cod sursa(job #2503761)
| Utilizator | Data | 3 decembrie 2019 19:01:31 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n, k;
int sir[20];
void gen(int cif, int lg)
{
if(lg == k + 1){
for(int j = 1; j <= k; j++)
fout << sir[j] << " ";
fout << "\n";
return;
}
for(int i = sir[lg - 1] + 1; i <= n; i++){
sir[lg] = i;
gen(cif + 1, lg + 1);
}
}
int main()
{
fin >> n >> k;
gen(1,1);
return 0;
}
