Pagini recente » Cod sursa (job #1929434) | Cod sursa (job #2049461) | Cod sursa (job #3036405) | Cod sursa (job #2860970) | Cod sursa (job #1114029)
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,k;
int sol[20];
int tip()
{
int v[20]={0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0};
for (int i=1;i<=k;i++)
v[sol[i]]++;
if (v[0])
return 1;
for (int i=1;i<=n;i++)
if (v[i]>=2)
return 1;
for (int i=1;i<=k;i++)
g<<sol[i]<<" ";
g<<'\n';
}
void back(int x)
{
if (x!=k+1)
{
for (int i=sol[x-1];i<=n;i++)
{
sol[x]=i;
if (x==k)
tip();
else
back(x+1);
}
}
}
int main()
{
f>>n>>k;
back(1);
f.close();
g.close();
}