Cod sursa(job #1853059)
Utilizator | Data | 21 ianuarie 2017 13:33:37 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n,v[20],fol[20],p,k;
inline void combinari(int p){
if(p>k){
for(int i=1;i<=k;++i)
fout<<v[i]<<" ";
fout<<"\n";
return;
}
for(int i=1;i<=n;++i)
if(fol[i]==0 && i>v[p-1]){
fol[i]=1;
v[p]=i;
combinari(p+1);
fol[i]=0;
}
}
int main(){
ios::sync_with_stdio(0);
fin.tie(0);
fin>>n>>k;
combinari(1);
}