CF433A.Kitahara Haruki's Gift

普及-

通过率:0%

时间限制:1.00s

内存限制:256MB

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

Kitahara Haruki has bought n apples for Touma Kazusa and Ogiso Setsuna. Now he wants to divide all the apples between the friends.

Each apple weights 100 grams or 200 grams. Of course Kitahara Haruki doesn't want to offend any of his friend. Therefore the total weight of the apples given to Touma Kazusa must be equal to the total weight of the apples given to Ogiso Setsuna.

But unfortunately Kitahara Haruki doesn't have a knife right now, so he cannot split any apple into some parts. Please, tell him: is it possible to divide all the apples in a fair way between his friends?

北原春希为当麻 kazusa 和 萩咲雪菜买了 nn 个苹果。现在他想把这些苹果全部分给两位朋友。

每个苹果的重量为 100 克或 200 克。当然,北原春希不希望冒犯任何一位朋友。因此,分给当麻 kazusa 的苹果总重量必须等于分给萩咲雪菜的苹果总重量。

但不幸的是,北原春希此刻没有刀,因此无法将任何一个苹果切开。请告诉他:是否可能以公平的方式将所有苹果分给他的朋友们?

输入格式

The first line contains an integer n (1 ≤ n ≤ 100) — the number of apples. The second line contains n integers _w_1, _w_2, ..., w__n (w__i = 100 or w__i = 200), where w__i is the weight of the i-th apple.

第一行包含一个整数 nn(1≤n≤1001 \leq n \leq 100)—— 苹果的数量。
第二行包含 nn 个整数 w1, w2, …, wnw_1,\ w_2,\ \dots,\ w_n(其中每个 wi=100w_i = 100 或 wi=200w_i = 200),wiw_i 表示第 ii 个苹果的重量。

输出格式

In a single line print "YES" (without the quotes) if it is possible to divide all the apples between his friends. Otherwise print "NO" (without the quotes).

如果可以将所有苹果平均分给他的朋友们,则在一行中输出 "YES"(不带引号);否则输出 "NO"(不带引号)。

输入输出样例

  • 输入#1

    3
    100 200 100

    输出#1

    YES
  • 输入#2

    4
    100 100 100 200

    输出#2

    NO

说明/提示

In the first test sample Kitahara Haruki can give the first and the last apple to Ogiso Setsuna and the middle apple to Touma Kazusa.

在第一个测试样例中,北原春希可以将第一个苹果和最后一个苹果给 Ogiso Setsuna,将中间的苹果给当麻 Kazusa。

输入解题思路,AI测评打分。不知道怎么写?

首页