Cod sursa(job #380732)
| Utilizator | Data | 7 ianuarie 2010 15:49:19 | |
|---|---|---|---|
| Problema | Combinari | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
using namespace std;
int a[20], n, k;
void write() {
ofstream fo("combinari.out");
int i;
for (i = 1; i <= k; i++)
fo << a[i] << ' ';
}
void combinari () {
int i;
for (i = 1; i <= k; i++)
a[i] = i;
while (i) {
write();
for (i = k; i > 0 && a[i] == n - k + i; i--);
if (i) {
a[i]++;
for (i++; i <= k; i++)
a[i] = a[i-1] + 1;
}
}
}
int main () {
ifstream fi("combinari.in");
fi>>n>>k;
combinari ();
write();
return 0;
}
