Timus : 1021 (Sacrament of the Sum)



// http://acm.timus.ru/problem.aspx?space=1&num=1021
// Tag: Adhoc 

// @BEGIN_OF_SOURCE_CODE

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cctype>
#include <stack>
#include <queue>
#include <list>
#include <vector>
#include <map>
#include <sstream>
#include <cmath>
#include <bitset>
#include <utility>
#include <set>
#include <numeric>

#define INF_MAX 2147483647
#define INF_MIN -2147483647
#define pi acos(-1.0)
#define N 1000000
#define LL long long

#define For(i, a, b) for( int i = (a); i < (b); i++ )
#define Fors(i, sz) for( size_t i = 0; i < sz.size (); i++ )
#define Fore(it, x) for(typeof (x.begin()) it = x.begin(); it != x.end (); it++)
#define Set(a, s) memset(a, s, sizeof (a))
#define Read(r) freopen(r, "r", stdin)
#define Write(w) freopen(w, "w", stdout)

int dr [] = {-1, -1, 0, 1, 1, 1, 0, -1};
int dc [] = {0, 1, 1, 1, 0, -1, -1, -1};

using namespace std;

int pos [32767 + 5];
int neg [32767 + 5];

int main ()
{
    int n; scanf ("%d", &n);
    int inp;

    for ( int i = 0; i < n; i++ ) {
        scanf ("%d", &inp);
        if ( inp < 0 ) neg [inp * -1] = 1;
        else pos [inp] = 1;
    }

    scanf ("%d", &n);
    bool yes = false;

    for ( int i = 0; i < n; i++ ) {
        scanf ("%d", &inp);
        int diff = 10000 - inp;
        if ( abs (diff) > 32769 ) continue;
        if ( diff < 0 ) { if ( neg [diff * -1] == 1 ) yes = true; }
        else { if ( pos [diff] == 1 ) yes = true; }
    }

    if ( yes ) printf ("YES\n");
    else printf ("NO\n");

	return 0;
}

// @END_OF_SOURCE_CODE
Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s