Cod sursa(job #1595672)
| Utilizator | Data | 10 februarie 2016 14:28:47 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include <cstdio>
using namespace std;
int n,p,x[20];
void afisare()
{
for(int i=1; i<=p; i++)
printf("%d ", x[i]);
printf("\n");
}
void back(int k)
{
if(k==p+1) afisare();
for(x[k]=1; x[k]<=n; x[k]++)
if(x[k]>x[k-1])
back(k + 1);
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d %d", &n, &p);
back(1);
return 0;
}
