Cod sursa(job #1472985)
Utilizator | Mereu Alexandra Alexandraaaa | Data | 18 august 2015 12:06:38 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n, k, s[17];
void afisare(int j){
for (int i = 1; i <= j; ++i)
g << s[i] << " ";
g << "\n";
}
void back(int j) {
for (int i = s[j - 1] + 1; i <= n; ++i){
s[j] = i;
if (j == k)
afisare(j);
else
back(j + 1);
}
}
int main(){
f >> n >> k;
back(1);
f.close();
g.close();
return 0;
}