Pagini recente » Cod sursa (job #908151) | Cod sursa (job #2064584) | Cod sursa (job #229450) | Cod sursa (job #1425628) | Cod sursa (job #1928835)
#include <fstream>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
int v[20],k,n;
int cond()
{
for(int i=1;i<k;i++)
{
if(v[i]>=v[k])
return 0;
}
return 1;
}
void back(int l)
{
int i;
if(l==k&&cond())
{
for(i=1;i<=k;i++)
{
out<<v[i]<<" ";
}
out<<endl;
}
if(l<k)
{
for(i=v[1]+1;i<=n;i++)
{
v[l+1]=i;
back(l+1);
}
}
}
int main()
{
in>>n>>k;
back(0);
return 0;
}