zoukankan      html  css  js  c++  java
  • Codeforces Beta Round #4 (Div. 2 Only) 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.

    Sample test(s)
    input
    8
    
    output
    YES

     【分析】:给你一个数,能不能分成两个全是偶数的数。

    【分析】:暴力枚举或者由偶数只能->偶数+偶数->该数是除了2以外的偶数就输出YES

    【代码】:

    #include<bits/stdc++.h>
    using namespace std;
    
    #define LL long long
    using namespace std;
    int n;
    int main()
    {
        cin>>n;
        int f=0;
        for(int i=1;i<=n/2;i++)
        {
            if((i%2==0)&&((n-i)%2==0))
            {
                f=1;
                break;
            }
        }
        if(f) puts("YES");
        else puts("NO");
        return 0;
    }
    暴力枚举
    #include<bits/stdc++.h>
    using namespace std;
    
    #define LL long long
    using namespace std;
    int n;
    int main()
    {
        cin>>n;
        int f=0;
        if(n%2==0&&n!=2)
            f=1;
        if(f) puts("YES");
        else puts("NO");
        return 0;
    }
    数学
  • 相关阅读:
    NX二次开发-UFUN设置显示状态抑制显示UF_DISP_set_display
    NX二次开发-使用NXOPEN C++向导模板做二次开发
    ANTV/G6 怎么按条件自定义节点颜色(Graphin)
    js数组去重及数组对象去重
    vue组件老胡机抽奖(转载)
    Kafka第二节
    Kafka第一节
    更改idea的database数据库连接的ddl格式
    不推荐别的了,IDEA 自带的数据库工具就很牛逼!
    MongoDB 按照时间段查询某个物理机的CPU使用率,按照时间倒序排序,取出最新的5条数据
  • 原文地址:https://www.cnblogs.com/Roni-i/p/7913595.html
Copyright © 2011-2022 走看看