Cod sursa(job #1903903)
| Utilizator | Data | 5 martie 2017 13:10:07 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include<iostream>
#include<fstream>
using namespace std;
ofstream fout("combinari.out");
int st[20],n,k;
inline void afisare()
{
int i;
for(i=1;i<=k;i++)
fout<<st[i]<<" ";
fout<<'\n';
}
inline void bktr(int p)
{
int pval;
for(pval=st[p-1]+1;pval<=n-k+p;pval++) {
st[p]=pval;
if(p==k)
afisare();
else bktr(p+1);
}
}
int main ()
{
ifstream fin("combinari.in");
fin>>n>>k;
fin.close();
bktr(1);
fout.close();
return 0;
}
