Pagini recente » Cod sursa (job #3205072) | Istoria paginii runda/eusebiu_oji_2006si2007_cls11-12 | Cod sursa (job #264636) | Cod sursa (job #2218923) | Cod sursa (job #2393780)
#include <iostream>
#include <fstream>
#include <iostream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
using namespace std;
int comb[20];int i;
int n,k;
bool used[20];
void back(int lvl,int n,int k){
if(lvl==k+1){ for(i=1;i<=k;i++) {fout<<comb[i]<<" ";}fout<<endl;}
for(i=comb[lvl-1]+1;i<=n;i++){
if (used[i]!= true){
used[i]=true;
comb[lvl]=i;
back(lvl+1,n,k);
used[i]=false;}
}
}
int main()
{
fin>>n;
fin>>k;
back(1,n,k);
return 0;
}