Cod sursa(job #1537459)
| Utilizator | Data | 27 noiembrie 2015 13:03:16 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int st[100],n,p;
void afisare()
{
for(int i=1;i<=p;i++)
g<<st[i]<<" ";
g<<"\n";
}
int valid(int k)
{
if(k>1 && st[k]<=st[k-1])
return 0;
return 1;
}
void bkt(int k)
{
int i;
for(i=1;i<=n;i++)
{
st[k]=i;
if(valid(k))
if(k==p)
afisare();
else bkt(k+1);
}
}
int main()
{
f>>n>>p;
bkt(1);
f.close();
g.close();
return 0;
}
