Cod sursa(job #2076145)
Utilizator | Data | 26 noiembrie 2017 11:32:12 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n, k, i, j, v[20], m;
void bkt(int i) {
int j;
if(i>m) {
for(j=1; j<=m; j++) g<<v[j]<<' ';
g<<'\n';
}
else
for(j=v[i-1]+1; j<=n-m+i; j++) {
v[i]=j;
bkt(i+1);
}
}
int main()
{
f>>n>>m;
bkt(1);
return 0;
}