Cod sursa(job #557410)
Utilizator | Data | 16 martie 2011 17:27:30 | |
---|---|---|---|
Problema | Combinari | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n,m,x[19];
void bkt(int k)
{ int i;
if (k>m)
{
for (i=1;i<=m;i++)
fout<<x[i]<<' ';
fout<<'\n';
}
else
for (i=x[k-1]+1;i<=n-m+1;i++)
{
x[k]=i;
bkt(k+1);
}
}
int main()
{
fin>>n>>m;
bkt(1);
fout.close();
return 0;
}