Exhaustive Search

#include<stdio.h>

int flag = 0;
int n,A[20];
void solve(int i, int m) {
    if( m == 0) {
        flag = 1;
        return;
    }

    if ( m < 0 || i == n )
        return ;

    solve(i+1, m);
    solve(i+1, m - A[i]);
}

int main()
{
    int q;
    int temp;
    scanf("%d",&n);
    for ( int i = 0; i < n; i++ ) scanf("%d",&A[i]);
    scanf("%d",&q);
    for ( int i = 0; i < q; i++ ) {
        flag = 0;
        scanf("%d",&temp);
        solve(0, temp);
        if(flag == 1) printf("yes\n");
        else printf("no\n");
    }
}