Pagini recente » Cod sursa (job #2465444) | Cod sursa (job #8528) | Cod sursa (job #74051) | Cod sursa (job #2376843) | Cod sursa (job #2133880)
#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<=n;i++)if(!b[i])g<<i<<' ';
g<<'\n';
}else
for(int i=st;i<=n;i++)if(b[i]){
b[i]=0;
back(l+1, i+1);
b[i]=1;
}
}
int main(){
f>>n>>m;
for(int i=1;i<=n;i++)b[i]=1;
back(1,1);
return 0;
}