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