天天看點

CF 4A Watermelon(水??!!)

Watermelon

Time Limit: 1000ms Memory Limit: 65536KB This problem will be judged on  CodeForces. Original ID:  4A

64-bit integer IO format:  %I64d      Java class name:  (Any) Prev  Submit  Status  Statistics  Discuss   Next Type:  None

  •   None
  •  Graph Theory
  •       2-SAT
  •      Articulation/Bridge/Biconnected Component
  •      Cycles/Topological Sorting/Strongly Connected Component
  •      Shortest Path
  •           Bellman Ford
  •          Dijkstra/Floyd Warshall
  •      Euler Trail/Circuit
  •       Heavy-Light Decomposition
  •      Minimum Spanning Tree
  •      Stable Marriage Problem
  •       Trees
  •      Directed Minimum Spanning Tree
  •      Flow/Matching
  •           Graph Matching
  •              Bipartite Matching
  •              Hopcroft–Karp Bipartite Matching
  •              Weighted Bipartite Matching/Hungarian Algorithm
  •          Flow
  •               Max Flow/Min Cut
  •              Min Cost Max Flow
  •  DFS-like
  •       Backtracking with Pruning/Branch and Bound
  •       Basic Recursion
  •      IDA* Search
  •       Parsing/Grammar
  •      Breadth First Search/Depth First Search
  •      Advanced Search Techniques
  •           Binary Search/Bisection
  •          Ternary Search
  •  Geometry
  •       Basic Geometry
  •      Computational Geometry
  •      Convex Hull
  •       Pick's Theorem
  •  Game Theory
  •       Green Hackenbush/Colon Principle/Fusion Principle
  •       Nim
  •      Sprague-Grundy Number
  •   Matrix
  •      Gaussian Elimination
  •       Matrix Exponentiation
  •  Data Structures
  •       Basic Data Structures
  •      Binary Indexed Tree
  •      Binary Search Tree
  •       Hashing
  •      Orthogonal Range Search
  •       Range Minimum Query/Lowest Common Ancestor
  •       Segment Tree/Interval Tree
  •      Trie Tree
  •      Sorting
  •       Disjoint Set
  •  String
  •       Aho Corasick
  •      Knuth-Morris-Pratt
  •       Suffix Array/Suffix Tree
  •  Math
  •       Basic Math
  •      Big Integer Arithmetic
  •       Number Theory
  •          Chinese Remainder Theorem
  •          Extended Euclid
  •           Inclusion/Exclusion
  •          Modular Arithmetic
  •      Combinatorics
  •           Group Theory/Burnside's lemma
  •          Counting
  •      Probability/Expected Value
  •   Others
  •      Tricky
  •       Hardest
  •      Unusual
  •       Brute Force
  •      Implementation
  •       Constructive Algorithms
  •      Two Pointer
  •       Bitmask
  •      Beginner
  •       Discrete Logarithm/Shank's Baby-step Giant-step Algorithm
  •       Greedy
  •      Divide and Conquer
  •   Dynamic Programming
  •                    Tag it!
  • 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

    Input

    8
          

    Output

    YES
          

    Hint

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

    Source

    Codeforces Beta Round #4 (Div. 2 Only)

    題意:

    兩個人分一個西瓜,問兩個人能否分到偶數!

    首先,分之前必須是偶數,且要大于2

    AC代碼:

    #include <iostream>
    using namespace std;
    int main()
    {
        int n;
        while(cin>>n)
        {
            if(n>2&&n%2==0)
                cout<<"YES"<<endl;
            else
                cout<<"NO"<<endl;
        }
        return 0;
    }
               

    繼續閱讀