Cod sursa(job #568985)
| Utilizator | Data | 31 martie 2011 21:20:23 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,k,a[20];
void scrie() {
for (int j=1;j<=k;j++)
g << a[j] << ' ';
g << '\n';
}
void combinari (int l) {
int i;
if (l<=k) {
for (i=a[l-1]+1;i<=n-k+l;i++) {
a[l]=i;
combinari(l+1);
}
}
else
scrie();
}
int main () {
f >> n >> k;
combinari(1);
f.close();g.close();
return 0;
}
