Cod sursa(job #2702656)
| Utilizator | Data | 5 februarie 2021 11:31:42 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.66 kb |
#include <fstream>
using namespace std;
ifstream fin ("combinari.in");
ofstream fout ("combinari.out");
int n,k,v[25],v2[30],k2;
void Combinari (int k)
{
if (k>=1)
{
for (int i=v2[k2-k]+1;i<=n;++i)
{
if (v[i]==0)
{
v2[k2-k+1]=i;
v[i]=1;
Combinari (k-1);
v[i]=0;
}
}
}
else
{
for (int i=1;i<=k2;++i)
{
fout <<v2[i]<<' ';
}
fout <<'\n';
}
}
int main()
{
fin >>n>>k;
k2=k;
Combinari (k);
fin.close ();
fout.close ();
return 0;
}
