题面#

You are given $n$ positive integers $a_1,a_2,\ldots,a_n$.

Please determine if it is possible to select any number of elements in $a$, so that their product is $67$.

Note that you may not select zero elements, as the product of zero elements is not defined in this problem.

Input

Each test contains multiple test cases. The first line contains the number of test cases $t$ ($1 \le t \le 10^4$). The description of the test cases follows.

The first line of each test case contains a single integer $n$ ($1 \le n \le 5$).

The second line of each test case contains $n$ positive integers $a_1,a_2,\ldots,a_n$ ($1 \le a_i \le 67$).

Output

If it is possible to select elements so that their product is $67$, output “YES” on one line. Otherwise, output “NO” on one line.

You can output the answer in any case. For example, the strings “yEs”, “yes”, and “Yes” will also be recognized as positive responses.

思路#

很简单，题目给的 $67$ 是一个质数，同时注意到题目说了：选择任意多个元素，因此我们只需要判断选取的数有没有 $67$ 就可以了

代码#

1
#include <bits/stdc++.h>
2

3
using namespace std;
4

5
int main() {
6
    int t;
7
    cin >> t;
8
    while (t --) {
9
        int n;
10
        cin >> n;
11
        vector<int> a(n);
12
        for (int i = 0; i < n; i ++) cin >> a[i];
13

14
        if (find(a.begin(), a.end(), 67) != a.end())
15
            cout << "YES" << endl;
16
        else cout << "NO"<< endl;
17
    }
18
}