Cod sursa(job #2510696)
| Utilizator | Data | 17 decembrie 2019 10:11:20 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,l,a[101];
void tipar()
{
int i;
for(i=1;i<=l;i++)
g<<a[i]<<" ";
g<<'\n';
}
bool valid(int k)
{
int i;
for(i=1;i<k;i++)
if(a[i]==a[k]||a[i]>a[k])
return 0;
return 1;
}
void bkt(int k)
{
int i;
for(i=1;i<=n;i++)
{
a[k]=i;
if(valid(k))
if(k==l)
tipar();
else bkt(k+1);
}
}
int main()
{
f>>n>>l;
bkt(1);
return 0;
}
