Pagini recente » Cod sursa (job #230987) | Cod sursa (job #198773) | Cod sursa (job #771707) | Cod sursa (job #1083911) | Cod sursa (job #751903)
Cod sursa(job #751903)
#include<fstream>
using namespace std;
ifstream fcin("combinari.in");
ofstream fcout("combinari.out");
int n,v[19],k,u=1;
void print()
{
for(int i=1;i<=k;i++)
fcout<<v[i]<<" ";
fcout<<"\n";
}
bool cont(int x)
{
for(int i=1;i<x;i++)
if(v[i]==v[x])
return 0;
return 1;
}
void back(int x)
{
if(x==k+1)
print();
else
for(int i=u;i<=n;i++)
{
v[x]=i;
u=i;
if(cont(x))
back(x+1);
}
}
int main()
{
fcin>>n>>k;
back(1);
return 0;
}