Cod sursa(job #2133875)
Utilizator | Data | 17 februarie 2018 13:38:45 | |
---|---|---|---|
Problema | Combinari | Scor | 80 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include<bits/stdc++.h>
using namespace std;
int n, m, a[20];
bool b[20];
ifstream f("combinari.in");
ofstream g("combinari.out");
void back(int l, int st){
if(l>m){
for(int i=1;i<=m;i++)g<<a[i]<<' ';
g<<endl;
}else
for(int i=st;i<=n;i++)if(!b[i]){
b[i]=1;
a[l]=i;
back(l+1, i+1);
b[i]=0;
}
}
int main(){
f>>n>>m;
back(1,1);
return 0;
}