Cod sursa(job #2166714)
Utilizator | Data | 13 martie 2018 18:32:31 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
using namespace std;
ifstream fi("combinari.in");
ofstream fo("combinari.out");
int sol[20];
int n,m;
void afisare()
{
for(int i=1;i<=m;i++)
fo<<sol[i]<<" ";
fo<<'\n';
}
void perm(int k)
{
for(int i=sol[k-1]+1 ;i<=n-m+k;i++)
{
sol[k]=i;
if(k==m){afisare();}
else
{perm(k+1);}
}
}
int main()
{
fi>>n>>m;
perm(1);
return 0;
}