Cod sursa(job #1641417)
| Utilizator | Data | 8 martie 2016 22:59:48 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n,m,c[40];
void afisare()
{for(int i=1;i<=m;i++)fout<<c[i]<<" ";
fout<<"\n";
}
void gencombinari(int k)
{if(k-1==m)afisare();
else for(int i=c[k-1]+1;i<=n-m+k;i++){c[k]=i;gencombinari(k+1);}
}
int main()
{
fin>>n>>m;
gencombinari(1);
return 0;
}
