Cod sursa(job #3174729)
Utilizator | Data | 25 noiembrie 2023 09:34:20 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n, k, a[20], l;
int main()
{
fin >> n >> k;
a[1] = 1, l = 1;
while(l > 0){
if(l == k){
for(int i = 1; i <= l; i++){
fout << a[i] << " ";
}
fout << "\n";
}
if(a[l] < n){
l++;
a[l] = a[l-1]+1;
}else{
l--;
if(l > 0){
a[l]++;
}
}
}
return 0;
}