Cod sursa(job #1890865)
| Utilizator | Data | 23 februarie 2017 16:03:02 | |
|---|---|---|---|
| Problema | Combinari | Scor | 60 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include<fstream>
#include<algorithm>
#include<cmath>
using namespace std;
ifstream cin("combinari.in");
ofstream cout("combinari.out");
int n,m,v[9];
bool viz[9];
void afisare(){
for(int i=1;i<=m;i++){
cout<<v[i]<<" ";
}
cout<<'\n';
}
void back(int k){
if(k>m){
afisare();
}
else{
for(int i=v[k-1]+1;i<=n-m+k;i++){
if(viz[i]==0){
v[k]=i;
back(k+1);
}
}
}
}
int main()
{
cin>>n>>m;
back(1);
return 0;
}
