Pagini recente » Cod sursa (job #306613) | Cod sursa (job #924114) | Cod sursa (job #961347) | Cod sursa (job #2340124) | Cod sursa (job #1338705)
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n,k;
void back(int v[18],int l)
{
int i;
if(l==0)
for(v[l]=1;v[l]<=n;v[l]++)
{
back(v,l+1);
}
else
if(l!=k)
for(v[l]=v[l-1]+1;v[l]<=n;v[l]++)
{
back(v,l+1);
}
else
{
for(i=0;i<k;i++)
{
fout<<v[i]<<" ";
}
fout<<"\n";
}
}
int main()
{
int v[19]={0};
fin>>n>>k;
int l=0;
back(v,l);
return 0;
}