Cod sursa(job #911433)
Utilizator | Hancu Andrei ucnah | Data | 11 martie 2013 17:28:29 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <cstdio>
using namespace std;
int n,k,sol[19];
void afisare()
{
for(int i=1;i<=k;i++)
printf("%d ",sol[i]);
printf("\n");
}
void back(int q)
{
if(q==k+1)
{
afisare();
return;
}
for(int i=sol[q-1]+1;i<=n-k+q;i++)
{
sol[q]=i;
back(q+1);
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d %d",&n,&k);
back(1);
return 0;
}