Cod sursa(job #2422336)
Utilizator | Data | 18 mai 2019 13:32:47 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include<fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int x[20],n,k;
void back(int l){
if(l==k){
for(int i=1;i<=k;++i)
fout<<x[i]<<' ';
fout<<"\n";
}
else{
for(int i=x[l]+1;i<=n;++i)
{x[l+1]=i;
back(l+1);}
}
}
int main(){
fin>>n>>k;
back(0);
fin.close();
fout.close();
return 0;
}