Cod sursa(job #2912029)
Utilizator | Data | 6 iulie 2022 17:36:20 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include<fstream>
using namespace std;
ifstream F("combinari.in");
ofstream G("combinari.out");
int n,m,x[19],i;
void B(int k)
{
int i;
if(k==m+1) {
for(i=1;i<=m;G<<x[i]<<' ',++i);
G<<'\n';
} else
for(i=x[k-1]+1;i<=n;x[k]=i,B(k+1),++i);
}
int main()
{
return F>>n>>m,B(1),0;
}