Cod sursa(job #787108)
Utilizator | Data | 12 septembrie 2012 16:56:15 | |
---|---|---|---|
Problema | Combinari | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include<fstream>
using namespace std;
ofstream fout("combinari.out");
int N,uz[20],v[20],K;
void out()
{
for(int i=1;i<=K;++i)
fout<<v[i]<<" ";
fout<<'\n';
}
bool vrf()
{
for(int i=2;i<=K;++i)
if(v[i]<v[i-1])
return 0;
return 1;
}
void back(int P)
{
if(P>K)
{
if(vrf())
out();
return;
}
for(int i=1;i<=N;++i)
if(uz[i]==0)
{
uz[i]=1;
v[P]=i;
back(P+1);
uz[i]=0;
}
}
int main()
{
ifstream fin("combinari.in");
fin>>N>>K;
back(1);
return 0;
}