Cod sursa(job #2462103)
| Utilizator | Data | 26 septembrie 2019 19:16:09 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <bits/stdc++.h>
int n,m,x[20];
bool viz[20];
void afisare()
{
int i;
for (i=1; i<=m; i++) printf("%d ",x[i]);
printf("\n");
}
void back(int k)
{
int i;
if (k==m+1) afisare();
else
for (i=x[k-1]+1; i<=n; i++)
{
x[k]=i;
back(k+1);
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&n,&m);
back(1);
return 0;
}
