Cod sursa(job #3184324)
Utilizator | Data | 15 decembrie 2023 12:42:09 | |
---|---|---|---|
Problema | Combinari | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include <fstream>
using namespace std;
int n,m,a[20];
ifstream fin("combinari.in");
ofstream fout("combinari.out");
void f1(){
for(int i=1;i<n;i++){
fout<<a[i]<<" ";
}
fout<<endl;
}
void f2(int k){
if(k<=m){
for(int i=a[k-1]+1;i<=n-m+k;i++){
a[k]=i;
f2(k+1);
}
}
else f1();
}
int main()
{
fin>>n>>m;
f2(1);
return 0;
}