zoukankan      html  css  js  c++  java
  • Codeforces Beta Round #4 (Div. 2 Only) A. Watermelon 水题

    A. Watermelon

    题目连接:

    http://www.codeforces.com/contest/4/problem/A

    Description

    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.

    Input

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

    Output

    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.

    Sample Input

    8

    Sample Output

    YES

    Hint

    题意

    给你一个数,问你能不能把这个数分成两个偶数之和。

    题解:

    先分出一个2,然后看剩下的是不是偶数就好了。

    水题。

    代码

    #include<bits/stdc++.h>
    using namespace std;
    
    int main()
    {
        int n;
        scanf("%d",&n);
        if(n<=2)return puts("NO"),0;
        if(n%2==0&&(n-2)%2==0)
            return puts("YES"),0;
        return puts("NO"),0;
    }
  • 相关阅读:
    C语言基础
    R安装包
    随笔
    计算机组成原理(三)--存储器的层次结构
    计算机组成原理(一)
    查找
    二叉树
    Mesos
    第三章 线性表
    第四章 栈与队列
  • 原文地址:https://www.cnblogs.com/qscqesze/p/5293294.html
Copyright © 2011-2022 走看看