Cod sursa(job #2765315)
| Utilizator | Data | 26 iulie 2021 12:53:24 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.8 kb |
#include <iostream>
#include <fstream>
using namespace std;
int m,n,x[19];
ifstream f("combinari.in");
ofstream g("combinari.out");
int p=0;
void afis(int k)
{
int i;
for (i=1; i<=k; i++)
g<<x[i]<<' ';
g<<'\n';
}
int valid(int k)
{
int i;
for (i=1; i<k; i++)
if (x[i]==x[k])
return 0;
return 1;
}
void BT()
{
int k=1;
x[k]=0;
while (k>0)
if (x[k]<m)
{
x[k]++;
if (valid(k))
if (k==n)
afis(k);
else
{
k++;
p=k;
x[k]=x[k-1];
}
}
else
k--;
}
int main()
{
int i;
f>>m>>n;
BT();
}
