Pagini recente » Cod sursa (job #36216) | Cod sursa (job #2640300) | Cod sursa (job #956137) | Cod sursa (job #2892612) | Cod sursa (job #2926146)
#include <fstream>
#include <iostream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int fl[20],af[20];
int n,tot,lol;
void afis()
{
for(int i=0; i<tot; i++)
g<<af[i]<<" ";
g<<"\n";
}
void com(int x,int k)
{
{
if(x==1)
{
for(int i=k; i<=n-x+1; i++)
{ if(fl[i]==0&&i>af[tot-x-1])
{af[tot-1]=i;
afis();}
}
}
else
{
for(int i=k; i<=n-x+1; i++)
{if(lol==0)
{lol=1;if(fl[i]==0)
{fl[i]=1;
af[tot-x]=i;
com(x-1,k+1);
fl[i]=0;} }
else
if(fl[i]==0&&i>af[tot-x-1])
{fl[i]=1;
af[tot-x]=i;
com(x-1,k+1);
fl[i]=0;}
}
}
}
}
int main()
{f>>n>>tot;
com(tot,1);
}