Cod sursa(job #2487375)
| Utilizator | Data | 4 noiembrie 2019 17:38:42 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n, k, v[20];
void print(){
for(int i = 1; i<=k; i++)
fout<<v[i]<<' ';
fout<<'\n';
}
void Back(int l){
for(int i = v[l-1]+1; i<=n; i++){
v[l] = i;
if(l == k)
print();
else
Back(l+1);
}
}
int main()
{
fin>>n>>k;
Back(1);
return 0;
}
