Cod sursa(job #153969)
Utilizator | Marin Marin zobica | Data | 10 martie 2008 20:45:37 |
---|---|---|---|
Problema | Combinari | Scor | 80 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
using namespace std;
int sol[19];
int nr, n, p;
ofstream fout("combinari.out");
void citire() {
ifstream fin("combinari.in");
fin >> n >> p;
}
void afisare() {
for (int i = 1; i <= p; i++)
fout << sol[i] << " ";
fout << endl;
}
void back(int k) {
if (k > p) {
afisare();
return;
}
for(int i = sol[k-1] + 1; i <= n - p + k; i++) {
sol[k] = i;
back(k+1);
}
}
int main() {
sol[0]=0;
citire();
back(1);
fout.close();
return 0;
}