Cod sursa(job #659151)
| Utilizator | Data | 10 ianuarie 2012 11:40:11 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <cstdio>
using namespace std;
int n,m,sol[20];
void afis()
{
for(int i=1;i<=m;i++)
printf("%d ",sol[i]);
printf("\n");
}
void back(int k)
{
int i;
if (k>m) afis();
else
for (i=sol[k-1]+1;i<=n;i++)
{
sol[k]=i;
back(k+1);
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&n,&m);
back(1);
}
