I was going through the problem statement for 2019 Google Hash Code Finals. I am just wondering how to approach this problem. Can someone help me?

Thanks

# | User | Rating |
---|---|---|

1 | tourist | 3843 |

2 | jiangly | 3705 |

3 | Benq | 3628 |

4 | orzdevinwang | 3571 |

5 | Geothermal | 3569 |

5 | cnnfls_csy | 3569 |

7 | jqdai0815 | 3530 |

8 | ecnerwala | 3499 |

9 | gyh20 | 3447 |

10 | Rebelz | 3409 |

# | User | Contrib. |
---|---|---|

1 | maomao90 | 171 |

2 | awoo | 164 |

3 | adamant | 162 |

4 | TheScrasse | 159 |

5 | maroonrk | 154 |

5 | nor | 154 |

7 | -is-this-fft- | 152 |

8 | Petr | 147 |

9 | orz | 145 |

10 | pajenegod | 144 |

I was going through the problem statement for 2019 Google Hash Code Finals. I am just wondering how to approach this problem. Can someone help me?

Thanks

Can someone help me with this problem.

Given an array **A** of **N** numbers. We are required to find the size of the smallest subset of the array such that **Bitwise OR** is maximum possible.

$$$1 \leq N \leq 10^5$$$

$$$1 \leq A[i] \leq 10^6$$$

```
Sample input:
5
1 2 3 4 5
```

Sample output:
2

Codeforces (c) Copyright 2010-2024 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jun/12/2024 17:57:42 (h2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|