Cod sursa(job #2068575)
Utilizator | Data | 18 noiembrie 2017 09:24:45 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
fstream f1("combinari.in", ios::in);
fstream f2("combinari.out", ios::out);
int n, m, v[20];
void bkt(int k)
{
int i;
for(i=v[k-1]+1; i<=n; i++)
{
v[k]=i;
if(k<=m)
{
if(k==m) {for(int j=1; j<=m; j++) f2<<v[j]<<' '; f2<<"\n";}
else bkt(k+1);
}
v[k]=0;
}
}
int main()
{
f1>>n>>m;
bkt(1);
return 0;
}