Largest Subset
未關閉
algorithms
bitmasking
C
CPP
good first issue
hacktoberfest
Hacktoberfest2020
- 主要語言
- C++
- 星號
- 504
- 分支
- 436
- PR 合併指標
- 30 天內沒有已合併 PR
描述
Given an array A1, A2 . . . AN what is the size of the largest subset of the array such that the each pair of elements in the subset is coprime.
Input Format
The first line contains an integer N, followed by N numbers in the next line.
Constraints
N<=50 , Ai<=50
Output Format
Output is a single number denoting the size.
Sample Input
5
2 3 2 3 2
Sample Output
2
貢獻指南
這個儲存庫沒有索引到貢獻指南
評估
這個 Issue 還沒有評估資料。