zoukankan      html  css  js  c++  java
  • Codeforces

    A. Watermelon
    time limit per test
    1 second
    memory limit per test
    64 megabytes
    input
    standard input
    output
    standard output

    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.

    Input
    8
    Output 
    YES
    
    Note

    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).

    -------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------

    题意:分开的两部分都是正偶数输出YES,否则输出NO

             分析:两部分不一定相等
             代码如下:
    #include<iostream>
    #include<cstdio>
    using namespace std;
    int main()
    {
      int w;
      cin>>w;
    
      if(w%2==0&&w!=2)
    {
     cout<<"Yes"<<endl;
    }
    else
    {
    cout<<"No"<<endl;
    }
    return 0;
    }

     

  • 相关阅读:
    go 代理
    mongo创建用户
    博客搬家&留言板
    noip2020 SD选手迷惑行为大赏
    noip2020游记
    P4174 [NOI2006] 最大获利
    P3327 [SDOI2015]约数个数和
    P5069 [Ynoi2015]纵使日薄西山
    P3747 相逢是问候
    HDE6315 Naive Operations
  • 原文地址:https://www.cnblogs.com/RioTian/p/12192361.html
Copyright © 2011-2022 走看看