zoukankan      html  css  js  c++  java
  • codeforces A. In Search of an Easy Problem

    A. In Search of an Easy Problem
    time limit per test
    1 second
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    When preparing a tournament, Codeforces coordinators try treir best to make the first problem as easy as possible. This time the coordinator had chosen some problem and asked nn people about their opinions. Each person answered whether this problem is easy or hard.

    If at least one of these nn people has answered that the problem is hard, the coordinator decides to change the problem. For the given responses, check if the problem is easy enough.

    Input

    The first line contains a single integer nn (1n1001≤n≤100) — the number of people who were asked to give their opinions.

    The second line contains nn integers, each integer is either 00 or 11. If ii-th integer is 00, then ii-th person thinks that the problem is easy; if it is 11, then ii-th person thinks that the problem is hard.

    Output

    Print one word: "EASY" if the problem is easy according to all responses, or "HARD" if there is at least one person who thinks the problem is hard.

    You may print every letter in any register: "EASY", "easy", "EaSY" and "eAsY" all will be processed correctly.

    Examples
    input
    Copy
    3
    0 0 1
    output
    Copy
    HARD
    input
    Copy
    1
    0
    output
    Copy
    EASY

    为了熟悉CF。忍了。。
    #include<iostream>
    #include<cstdlib>
    using namespace std;
    
    int main(){
        int n;
        char* hard= "HARD";
        char* easy= "EASY";
        cin>>n;
        for(int i=0;i<n;i++){
            int c;
            cin>>c;
            if(c==1){
                cout<<hard;
                exit(0);
            }
        }
        cout<<easy;
        return 0;
    }
  • 相关阅读:
    剑指offer-整数中1出现的次数
    剑指offer-连续子数组的最大和
    剑指offer-最小的k个数
    剑指offer-数组中超过一半的数字
    剑指offer-二叉搜索树与双向链表
    剑指offer-复杂链表的复制
    剑指offer-二叉树中和为某一值的路径
    剑指offer-二叉搜索树的后序遍历
    Alpha 冲刺 (7/10)
    Alpha 冲刺 (6/10)
  • 原文地址:https://www.cnblogs.com/godoforange/p/10944370.html
Copyright © 2011-2022 走看看