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