Cod sursa(job #3314419)
| Utilizator | Data | 10 octombrie 2025 08:29:22 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n,m;
int v[20];
void Afis(){
for(int i=1; i<=m; i++){
fout<<v[i]<<" ";
}
fout<<'\n';
}
bool ok(int k){
if(k>1)
return v[k]>v[k-1];
return 1;
}
bool sol(int m,int k){
return m==k;
}
void combi(int k){
for(int i=1; i<=n; i++){
v[k]=i;
if(ok(k)){
if(sol(m,k)){
Afis();
}
else{
combi(k+1);
}
}
}
}
int main(){
int a,b;
fin>>n>>m;
combi(1);
return 0;
}
