Cod sursa(job #2068570)
| Utilizator | Data | 18 noiembrie 2017 09:22:34 | |
|---|---|---|---|
| Problema | Combinari | Scor | 70 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int viz[10],v[10],n,m;
void afis()
{
for(int i=1;i<=m;i++)
fout<<v[i]<<' ';
fout<<'\n';
}
void BKT(int k)
{
if(k>m)
{
afis();
return ;
}
for(int i=v[k-1]+1;i<=n;i++)
{
if(viz[i]==0)
{
viz[i]=1;
v[k]=i;
BKT(k+1);
viz[i]=0;
}
}
}
int main()
{
fin>>n>>m;
BKT(1);
return 0;
}
