# 这个问题用C语言寻找什么算法可以得到解决呢？

Problem Description
Mr. Fib is a mathematics teacher of a primary school. In the next lesson, he is planning to teach children how to add numbers up. Before the class, he will prepare N cards with numbers. The number on the i-th card is ai. In class, each turn he will remove no more than 3 cards and let students choose any ten cards, the sum of the numbers on which is 87. After each turn the removed cards will be put back to their position. Now, he wants to know if there is at least one solution of each turn. Can you help him?

Input
The first line of input contains an integer t (t≤5), the number of test cases. t test cases follow.
For each test case, the first line consists an integer N(N≤50).
The second line contains N non-negative integers a1,a2,...,aN. The i-th number represents the number on the i-th card. The third line consists an integer Q(Q≤100000). Each line of the next Q lines contains three integers i,j,k, representing Mr.Fib will remove the i-th, j-th, and k-th cards in this turn. A question may degenerate while i=j, i=k or j=k.

Output
For each turn of each case, output 'Yes' if there exists at least one solution, otherwise output 'No'.

Sample Input
1
12
1 2 3 4 5 6 7 8 9 42 21 22
10
1 2 3
3 4 5
2 3 2
10 10 10
10 11 11
10 1 1
1 2 10
1 11 12
1 10 10
11 11 12

Sample Output
No
No
No
Yes
No
Yes
No
No
Yes
Yes

• 写回答

#### 悬赏问题

• ¥15 ubuntu18.04 tty报错&tty界面su/sudo命令无法执行，如何解决？
• ¥20 关于c语言网络编程，实现传文件和即时聊天
• ¥20 下面的压缩方法是否可行
• ¥15 结构体数组读取文件信息失败，读取不了
• ¥15 kaldi thchs30 训练遇到问题
• ¥15 shellter无法使用，如何解决？(操作系统-kali)
• ¥15 matlab动态模态分解程序
• ¥60 关于渗透及远控的几个问题
• ¥15 python文本词汇出现次数统计
• ¥15 使用按键和串口,记录按键在不消抖的情况下触发的次数