Cod sursa(job #2041430)
| Utilizator | Data | 17 octombrie 2017 12:13:19 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int main(){
int n, k;
f >> n >> k;
int limita = (1<<n)-1;
for(int mask = limita; mask; --mask){
if(__builtin_popcount(mask) == k){
for(int j = n-1; j >= 0; --j){
if(mask&(1<<j)) g << n-j<<' ';
}
g << '\n';
}
}
return 0;
}
