Cod sursa(job #2393786)
| Utilizator | Data | 1 aprilie 2019 00:55:53 | |
|---|---|---|---|
| Problema | Combinari | Scor | 90 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#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 last){
if(lvl>k){for(i=1;i<=k;i++)fout<<comb[i]<<" "; fout<<endl; return;}
for(int i=last+1;i<=n;i++)
{if(!used[i]){
comb[lvl]=i;
used[i]=1;
back(lvl+1,i); used[i]=0;
}}}
int main()
{
fin>>n;
fin>>k;
back(1,0);
return 0;
}
