Cod sursa(job #2068588)
Utilizator | Data | 18 noiembrie 2017 09:30:04 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
void bkt(int k);
int n, m;
int uz[10], sol[10];
int main()
{ fin>>n>>m;
bkt(1);
return 0;
}
void bkt(int k)
{int i;
if(k-1==m)
{for(i=1; i<=m; i++)
fout<<sol[i]<<' ';
fout<<'\n';
}
else
{for(i=sol[k-1]+1; i<=n; i++)
{sol[k]=i;
bkt(k+1);
}
}
}