Cod sursa(job #2293047)
| Utilizator | Data | 30 noiembrie 2018 14:31:14 | |
|---|---|---|---|
| Problema | Combinari | Scor | 70 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.72 kb |
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n,k,f[18],v[19];
void print()
{
for(int j=1;j<=v[0];j++)
fout<<v[j]<<' ';
fout<<'\n';
}
void comb(int a,int b,int o)
{
if(b==1)
{
v[0]++;
for(int i=o;i<=a;i++)
if(f[i]==0)
{
v[v[0]]=i;
print();
}
v[0]--;
}
else
for(int i=o;i<=a;i++)
{
if(f[i]==0)
{
f[i]=1;
v[0]++;
v[v[0]]=i;
comb(a,b-1,i+1);
f[i]=0;
}
}
v[0]--;
}
int main()
{
fin>>n>>k;
comb(n,k,1);
return 0;
}
