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