Pagini recente » Cod sursa (job #1540441) | Cod sursa (job #3153183) | Cod sursa (job #22071) | Cod sursa (job #2404146) | Cod sursa (job #1135182)
#include <fstream>
using namespace std;
ifstream f ("combinari.in");
ofstream g ("combinari.out");
int st[19],n,k,p;
void tip ()
{
int i;
for (i=1;i<=p;i++)
g<<st[i]<<' ';
g<<'\n';
}
void Back (int k)
{
int i;
for (i=1;i<=n;i++)
{
st[k]=i;
for (i=st[k-1]+1;i<=n;i++)
{
st[k]=i;
if (k==p)
tip();
else Back (k+1);}
}
}
int main()
{
f>>n>>p;
Back (1);
return 0;
}