Cod sursa(job #2682425)
| Utilizator | Data | 8 decembrie 2020 17:24:50 | |
|---|---|---|---|
| Problema | Combinari | Scor | 70 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include<iostream>
#include<fstream>
using namespace std;
int n,p,x[10];
ifstream f ("combinari.in");
ofstream g("combinari.out");
void afisare(int k)
{
int i;
for(i=1;i<=k;i++)
g<<x[i]<<" ";
g<<endl;
}
int valid(int k)
{
int ok;
ok=1;
if(k>1)
if(x[k]<=x[k-1]) // strict crescatoare
ok=0;
return ok;
}
void bkt(int k)
{
int i;
for(i=1;i<=n;i++)
{
x[k]=i;
if(valid(k)==1)
if(k==p)
afisare(k);
else
bkt(k+1);
}
}
int main()
{
f>>n;
f>>p;
bkt(1);
f.close();
g.close();
return 0;
}
