Pagini recente » Cod sursa (job #1378674) | Cod sursa (job #2717670) | Cod sursa (job #2260204) | Diferente pentru tree-decompositions intre reviziile 6 si 91 | Cod sursa (job #2166714)
#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;
}