Cod sursa(job #1238593)
Utilizator | Data | 7 octombrie 2014 11:36:59 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.28 kb |
#include <fstream>
std::ifstream f("combinari.in");std::ofstream g("combinari.out");int a[17],n,k,s=0;void z(){for(int i=1;i<=n;i++)if(a[i])g<<i<<" ";g<<"\n";}void p(int w){if(s>k)return;if(w==n+1){if(s==k)z();}else{a[w]=1;s++;p(w+1);s--;a[w]=0;p(w+1);}}int main(){f>>n>>k;p(1);}