Watermelon

Watermelon

题面翻译

题目描述

一个炎热的夏天，Pete 和他的朋友 Billy 感到十分口渴，于是在西瓜摊上买了一个重 $w$ 公斤的西瓜。

他们回到家准备分西瓜。因为两个人都十分喜爱偶数，所以他们俩希望分出来的两块西瓜的重量都是偶数公斤。帮助他们判断是否可能做到这一点。

输入格式

一行一个整数 $w(0\le w\le 100)$。

输出格式

如果可以按照他们的意愿分配西瓜，输出 YES；否则输出 NO。

样例 #1 解释

他们可以将西瓜分成 $2$ 公斤和 $6$ 公斤。

---

翻译 By @Eason_cyx。

题目描述

One hot summer day Pete and his friend Billy decided to buy a watermelon. They chose the biggest and the ripest one, in their opinion. After that the watermelon was weighed, and the scales showed $ w $ kilos. They rushed home, dying of thirst, and decided to divide the berry, however they faced a hard problem.

Pete and Billy are great fans of even numbers, that’s why they want to divide the watermelon in such a way that each of the two parts weighs even number of kilos, at the same time it is not obligatory that the parts are equal. The boys are extremely tired and want to start their meal as soon as possible, that’s why you should help them and find out, if they can divide the watermelon in the way they want. For sure, each of them should get a part of positive weight.

输入格式

The first (and the only) input line contains integer number $ w $ ( $ 1<=w<=100 $ ) — the weight of the watermelon bought by the boys.

输出格式

Print YES, if the boys can divide the watermelon into two parts, each of them weighing even number of kilos; and NO in the opposite case.

样例 #1

样例输入 #1

8

样例输出 #1

YES

提示说明

For example, the boys can divide the watermelon into two parts of 2 and 6 kilos respectively (another variant — two parts of 4 and 4 kilos).

代码内容

// #include <iostream>
// #include <algorithm>
// #include <cstring>
// #include <sstream>//整型转字符串
// #include <stack>//栈
// #include <deque>//堆/优先队列
// #include <queue>//队列
// #include <map>//映射
// #include <unordered_map>//哈希表
// #include <vector>//容器，存数组的数，表数组的长度
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

int main()
{
    ll n;
    cin>>n;

    if(n&1||n==2) cout<<"NO"<<endl;
    else cout<<"YES"<<endl;

    return 0;
}