Pagini recente » Cod sursa (job #2874481) | Cod sursa (job #293626) | Cod sursa (job #88194) | Cod sursa (job #3194307) | Cod sursa (job #2211361)
#include<bits/stdc++.h>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,k,i,x[25],next_combination();
void read(),solve();
int main()
{
read();
solve();
return 0;
}
void read()
{
f>>n>>k;
}
void solve()
{
for(i=1;i<=k+1;i++)
x[i]=i;
for(;;)
{
for(i=1;i<k;i++)
g<<x[i]<<" ";
g<<x[k]<<"\n";
if(!next_combination())
return;
}
}
int next_combination()
{
int j;
for(j=k;j>=1;j--)
if(x[j]-n+k-j)
break;
x[j]++;
for(i=j+1;i<=n;i++)
x[i]=x[i-1]+1;
return j;
}