Cod sursa(job #3184525)
Utilizator | Data | 16 decembrie 2023 10:33:44 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n, m, a[20];
void f1()
{
for(int i=1;i<= m;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;
}