Cod sursa(job #1238590)
Utilizator | Data | 7 octombrie 2014 11:34:14 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <fstream>
using namespace std;ifstream f("combinari.in");ofstream o("combinari.out");int a[18],n,k;void afsh(){int s=0;for(int i=1;i<=n;i++)s+=a[i];if(s==k){for(int i=1;i<=n;i++)if(a[i])o<<i<<" ";o<<"\n";}}void rez(int ind){if(ind==n+1)afsh();else{a[ind]=1;rez(ind+1);a[ind]=0;rez(ind+1);}}int main(){f>>n>>k;rez(1);}