Cod sursa(job #2296275)
| Utilizator | Data | 4 decembrie 2018 16:31:17 | |
|---|---|---|---|
| Problema | Combinari | Scor | 60 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
using namespace std;
int n,x[10],viz[10],kk;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
void Afisare()
{
for(int i=1;i<=kk;i++)
fout<<x[i]<<" ";
fout<<"\n";
}
void Back(int k)
{
for(int i=x[k-1]+1;i<=n;i++)
{
if(viz[i]==0)
{
x[k]=i;
viz[i]=1;
if(k==kk) Afisare();
else Back(k+1);
viz[i]=0;
}
}
}
int main()
{
fin>>n>>kk;
Back(1);
return 0;
}
