zoukankan      html  css  js  c++  java
  • 【水题】Codeforces Round #431 (Div. 2) A. Odds and Ends

    A. Odds and Ends

    Source

    http://codeforces.com/contest/849/problem/A

    Description

    Where do odds begin, and where do they end? Where does hope emerge, and will they ever break?

    Given an integer sequence a1, a2, ..., an of length n. Decide whether it is possible to divide it into an odd number of non-empty subsegments, the each of which has an odd length and begins and ends with odd numbers.

    A subsegment is a contiguous slice of the whole sequence. For example, {3, 4, 5} and {1} are subsegments of sequence {1, 2, 3, 4, 5, 6}, while {1, 2, 4} and {7} are not.

    Input

    The first line of input contains a non-negative integer n (1 ≤ n ≤ 100) — the length of the sequence.

    The second line contains n space-separated non-negative integers a1, a2, ..., an (0 ≤ ai ≤ 100) — the elements of the sequence.

    Output

    Output "Yes" if it's possible to fulfill the requirements, and "No" otherwise.

    You can output each letter in any case (upper or lower).

    Examples
    Input
    3
    1 3 5
    Output
    Yes
    Input
    5
    1 0 1 5 1
    Output
    Yes
    Input
    3
    4 3 1
    Output
    No
    Input
    4
    3 9 9 3
    Output
    No
    Note

    In the first example, divide the sequence into 1 subsegment: {1, 3, 5} and the requirements will be met.

    In the second example, divide the sequence into 3 subsegments: {1, 0, 1}, {5}, {1}.

    In the third example, one of the subsegments must start with 4 which is an even number, thus the requirements cannot be met.

    In the fourth example, the sequence can be divided into 2 subsegments: {3, 9, 9}, {3}, but this is not a valid solution because 2 is an even number.

    Solution

    判断元素个数的奇偶性和两端元素的奇偶性就行了。

     1 #include<bits/stdc++.h>
     2 using namespace std;
     3 
     4 int n,a[111];
     5 
     6 int main(){
     7     cin >> n;
     8     for(int i = 1;i <= n;++i) scanf("%d",&a[i]);
     9     if(n % 2 == 0 || a[1] % 2 == 0 || a[n] % 2 == 0){
    10         cout << "No";
    11         return 0;
    12     }
    13     cout << "Yes";
    14 
    15     return 0;
    16 }
  • 相关阅读:
    Java实体类的属性类型与数据库表字段类型对应表
    MyBatis的settings设置描述
    Hibernate的属性配置
    eclipse快捷键
    2018年计划
    Django之Form组件归类
    Django之Form组件补充
    Django之Form组件
    Django之中间件
    Django之分页升级版本(组件)
  • 原文地址:https://www.cnblogs.com/doub7e/p/7466008.html
Copyright © 2011-2022 走看看