Pagini recente » Cod sursa (job #2908261) | Cod sursa (job #189873) | Cod sursa (job #1168576) | Cod sursa (job #660497) | Cod sursa (job #1325500)
#include <cstdio>
using namespace std;
int n,p,st[20],viz[20];
void afis()
{
for(int i=1;i<=p;i++)
printf("%d ",st[i]);
printf("\n");
}
void back(int k)
{
if(k-1==p)
afis();
else
if(k<=p)
for(int i=st[k-1]+1;i<=n;i++)
if(viz[i]==0)
{
st[k]=i;
viz[i]=1;
back(k+1);
viz[i]=0;
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&n,&p);
back(1);
return 0;
}