Cod sursa(job #1150986)
| Utilizator | Data | 23 martie 2014 19:37:38 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <iostream>
#include <cstdio>
using namespace std;
int n, p;
int s[20];
void afisare()
{
for (int i=1; i<=p; i++)
printf("%d ",s[i]);
printf("\n");
}
void back(int k)
{
if (k == p+1)
afisare();
else
for (int i=s[k-1]+1; i<=n; i++)
{
s[k] = i;
back(k+1);
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d %d",&n, &p);
back(1);
return 0;
}
