Cod sursa(job #2429834)
| Utilizator | Data | 11 iunie 2019 13:31:53 | |
|---|---|---|---|
| Problema | Combinari | Scor | 80 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include <iostream>
#include<fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int st[19];
int bun(int p)
{
for(int i=1;i<=p-1;i++)
if(st[i]>=st[p])return 0;
return 1;
}
void afis(int k)
{
for(int i=1;i<=k;i++)
g<<st[i]<<" ";
g<<endl;
}
void BKT(int p,int k,int n)
{
for(int i=1;i<=n;i++)
{
st[p]=i;
if(bun(p))
{
if(k==p)afis(k);
else BKT(p+1,k,n);
}
}
}
int main()
{
int n,k;
f>>n;
f>>k;
BKT(1,k,n);
f.close();
g.close();
return 0;
}
