Cod sursa(job #1011094)
Utilizator | alupei ciprian cypy2474 | Data | 16 octombrie 2013 10:21:57 |
---|---|---|---|
Problema | Combinari | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.78 kb |
#include<fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int m,n,sol[18];
bool v[18];
void gen(int k)
{
if(m==k)
{
int ok=1;
for(int i=0;i<m-1;i++)
if(sol[i]>=sol[i+1])
ok=0;
if(ok==1)
{
for(int i=0;i<m;i++)
g<<sol[i]<<" ";
g<<"\n";
}
}
else
{
for(int i=1;i<=n;i++)
if(v[i]==0)
{
v[i]=1;
sol[k]=i;
gen(k+1);
v[i]=0;
}
}
}
int main()
{
f>>n>>m;
gen(0);
return 0;
}