Cod sursa(job #2382918)
Utilizator | Data | 18 martie 2019 20:04:44 | |
---|---|---|---|
Problema | Combinari | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int sol[20],n,k;
inline bool valid()
{
for(int i=2;i<=k;i++)
if(sol[i]<=sol[i-1])
return false;
return true;
}
void afis()
{
for(int i=1;i<=k;++i)
g<<sol[i]<<" ";
g<<'\n';
}
void bk(int p)
{
if(p==k+1)
{
if(valid())
afis();
}
else
{
for(int i=1;i<=n;i++)
{
sol[p]=i;
bk(p+1);
}
}
}
int main()
{
f>>n>>k;
bk(1);
return 0;
}