Cod sursa(job #2433597)
Utilizator | Data | 28 iunie 2019 11:12:00 | |
---|---|---|---|
Problema | Combinari | Scor | 90 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int v[20],n,m;
int bt(int k){
for(int i=v[k-1]+1;i<=n;++i){
v[k]=i;
if(k==m){
for(int j=1;j<=m;++j)
fout<<v[j]<<" ";
fout<<endl;
}
else
bt(k+1);
}
}
int main()
{
fin>>n>>m;
bt(1);
return 0;
}