Cod sursa(job #2171514)
Utilizator | Data | 15 martie 2018 12:36:54 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,m,b[17];
void afisare(int n)
{
int i;
for(i=1;i<=n;i++)
g<<b[i]<<" ";
g<<'\n';
}
void bkt(int k)
{
int i;
for(i=b[k-1]+1;i<=n;i++)
{
b[k]=i;
if(k==m)
afisare(m);
else
bkt(k+1);
}
}
int main()
{
f>>n>>m;
bkt(1);
return 0;
}