Cod sursa(job #2391858)
| Utilizator | Data | 29 martie 2019 12:19:53 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("combinari.in");
ofstream fout ("combinari.out");
int n,t,v[20];
void afisare()
{
for (int i=1;i<=t;i++)
fout << v[i] << ' ';
fout << '\n';
}
int valid (int x)
{
if (v[x]>v[x-1])
return 1;
return 0;
}
void bectreching(int x)
{
for (int i=1;i<=n;i++)
{
v[x]=i;
if (valid(x)==1)
if (x==t)
afisare();
else
bectreching(x+1);
}
}
int main()
{
fin >> n >> t;
bectreching(1);
return 0;
}
