小石头

小石头
#include <stdio.h>
#include <math.h>
int p = 0;

int main()
{
int s[100] , n , a[10] , b[1000];
scanf("%d",&n);
for ( int i = 0 ; i < n ; i ++ )
{
scanf("%d",&a[i]);
}
b[0] = a[0];
for ( int i = 0 ; i < n ; i ++ )
{
for ( int j = i + 1 ; j < n ; j ++)
{
b[p] = fabs(a[i] - a[j]);
b[p + 1] = fabs(a[i] + a[j]);
b[p + 2] = a[j];
}
p += 3;
}
int m;
scanf("%d",&m);
for ( int i = 0 ; i < m ; i ++ )
{
scanf("%d",&s[i]);
}
for ( int i = 0 ; i < m ; i ++)
{
for ( int j = 0 ; j < p ; j ++)
{
if( s[i] == b[j] )
{
printf(“YES\n”);
break;
}
if ( j + 1 == p && s[i] != b[j] )
{
printf(“NO\n”);
}
}
}
return 0;
}