Pagini recente » Cod sursa (job #432947) | Cod sursa (job #96969) | Cod sursa (job #1683168) | Cod sursa (job #2413567) | Cod sursa (job #1340300)
#include <fstream>
using namespace std;
int n,p,st[25];
ifstream fin("combinari.in");
ofstream fout("combinari.out");
inline void Afisare()
{
int i;
for(i=1;i<=p;++i)
fout<<st[i]<<" ";
fout<<"\n";
}
inline void Back(int k)
{
int i;
if(k==p+1)
Afisare();
else
for(i=st[k-1]+1;i<=n-p+k;++i)
{
st[k]=i;
Back(k+1);
}
}
int main()
{
fin>>n>>p;
Back(1);
fin.close();
fout.close();
return 0;
}