Cod sursa(job #3003434)
Utilizator | Data | 15 martie 2023 18:50:08 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.76 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
const int Nmax=18;
int v[Nmax],f[Nmax],n,ki;
void solve(int k,int lasti)
{
if(k==0)
{
for(int i=1;i<=ki;i++)
{
fout<<v[i]<<' ';
}
fout<<'\n';
v[n]=0;
f[v[n]]=0;
return;
}
else
{
for(int i=lasti;i<=n;i++)
{
if(f[i]==0)
{
f[i]=1;
v[ki-k+1]=i;
solve(k-1,i);
f[i]=0;
v[ki-k+1]=0;
}
}
return;
}
}
int main()
{
int k;
fin>>n>>k;
ki=k;
solve(k,1);
return 0;
}