Nu exista pagina, dar poti sa o creezi ...
Cod sursa(job #1984944)
Utilizator | Data | 26 mai 2017 16:38:58 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,p,x[20],viz[20];
void afis()
{
for(int i=1;i<=p;i++)
g<<x[i]<<" ";
g<<'\n';
}
void backt(int k)
{
for(int i=x[k-1]+1;i<=n;++i)
if(!viz[i])
{
viz[i]=1;
x[k]=i;
if(k==p)
afis();
else
backt(k+1);
viz[i]=0;
}
}
int main()
{
f>>n>>p;
backt(1);
return 0;
}