Cod sursa(job #804500)
Utilizator | Ilie Ovidiu Horatiu horatiu11 | Data | 29 octombrie 2012 21:22:01 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.58 kb |
# include <cstdio>
using namespace std;
int N,st[21],p;
bool ap[21];
void tipar(int k)
{
int i;
for(i=1;i<=p;++i)
printf("%d ",st[i]);
printf("\n");
}
void back(int k)
{
int x;
for(x=st[k-1]+1;x<=N;++x)
{
st[k]=x;
if(ap[st[k]]==0)
{
ap[st[k]]=1;
if(k==p)tipar(p);
else back(k+1);
ap[st[k]]=0;
}
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d %d",&N,&p);
back(1);
return 0;
}