Cod sursa(job #2902101)
Utilizator | Data | 15 mai 2022 16:39:42 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.6 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n, m, x[21];
void afis(){
for(int i = 1; i <= m; i++)
fout << x[i] << ' ';
fout << '\n';
}
bool OK(int k){
for(int i = 1; i < k; i++)
if(x[i] >= x[k])
return 0;
return 1;
}
void back(int k){
for(int i = 1; i <= n; i++){
x[k] = i;
if(OK(k)){
if(k == m)
afis();
else
back(k + 1);
}
}
}
int main(){
fin >> n >> m;
back(1);
}