UESTC 1634 去年春恨却来时，落花人独立，微雨燕双飞

#include <bits/stdc++.h>
#define maxn 100010
using namespace std;
int dis[maxn], n, a[maxn];
void bfs(int fi){
    memset(dis, 63, sizeof(dis));
    dis[0] = 0;
    queue<int >q;
    q.push(fi);
    while(!q.empty()){
        fi = q.front();
        q.pop();
        for(int i=1;i<n;i++){
            if(dis[fi]+a[i]<dis[(fi+a[i])%a[0]]){
                dis[(fi+a[i])%a[0]] = dis[fi]+a[i];
                //dir[(fi+a[i])%a[0]] = 1;
                q.push((fi+a[i])%a[0]);
            }
        }
    }
}
int main()
{
    int m, q;
    cin>>n;
    for(int i=0;i<n;i++)
        cin>>a[i];
    bfs(0);
    cin>>q;
    while(q--){
        cin>>m;
        cout<<((dis[(m)%a[0]]<=m)?"YES":"NO")<<endl;
    }
    return 0;
}