Pagini recente » Cod sursa (job #940177) | Cod sursa (job #1356759) | Cod sursa (job #1118706) | Cod sursa (job #196607) | Cod sursa (job #1038008)
#include <iostream>
#include<stdio.h>
using namespace std;
int a[20],b[20],i,j,n,k,l,p,q;
void print()
{
for(i=1;i<=k;i++)
cout<<a[i]<<" ";
cout<<endl;
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
int c=1;
cin>>n>>k;
for(i=1;i<=n;i++)
{a[i]=i;
b[i]=a[i];}
print();
p=k;
q=p;
int ok=1;
while(p>=0&&ok)
{
a[q]++;
for(int o=1;o<=k;o++)
if(a[o]==0)
ok=0;
if(a[q]<=n&&ok)
print();
else
{
for(i=p-1;i<=n;i++)
{a[i]=b[i+c];
}
p--;
a[q]--;
if(p==1)
c++;
}
}
return 0;
}