Cod sursa(job #1553140)
Utilizator | Data | 19 decembrie 2015 12:26:22 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int m,sol[1001],n;
void afis()
{
for(int i=1;i<=m;i++)
fout<<sol[i]<<" ";
fout<<'\n';
}
void bk(int k)
{
int i;
if(k>m)afis();
else
for(i=sol[k-1]+1;i<=n;i++)
{
sol[k]=i;
bk(k+1);
}
}
int main()
{
fin>>n>>m;
bk(1);
return 0;
}