Cod sursa(job #1635234)
Utilizator | Data | 6 martie 2016 16:04:41 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <iostream>
#include <stdio.h>
using namespace std;
int n,p;
int sol[20];
void afisare()
{
for(int i=0;i<p;i++)
printf("%d ",sol[i]);
printf("\n");
}
void bt(int k)
{
if(k==p)
{
afisare();
return;
}
for(int i=sol[k-1]+1;i<=n;i++)
{
sol[k]=i;
bt(k+1);
}
}
void citire()
{
scanf("%d %d",&n,&p);
bt(0);
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
citire();
return 0;
}