RXD's date（HDU 6066）

最新推荐文章于 2018-07-19 09:15:16 发布

luyehao1

最新推荐文章于 2018-07-19 09:15:16 发布

阅读量484

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/luyehao1/article/details/76559535

本文介绍了一道关于计数特定条件下可约会天数的问题。主角RXD能够预测未来天气温度，但需要帮助来计算不超过35度的日子总数，以便与朋友外出。题目要求通过输入的未来天数和对应温度，输出适宜外出的日期数量。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

RXD's date

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)

Total Submission(s): 163 Accepted Submission(s): 131

Problem Description

As we all know that RXD is a life winner, therefore he always goes out, dating with his female friends.
Nevertheless, it is a pity that his female friends don't like extremely hot temperature. Due to this fact, they would not come out if it is higher than 35 degrees.
RXD is omni-potent, so he could precisely predict the temperature in the next

t days, but he is poor in counting.
He wants to know, how many days are there in the next

t days, in which he could go out and date with his female friends.

Input

There is only one test case.

The first line consists of one integer

t.

The second line consists of

t integers

ci which means the temperature in the next

t days.

1≤t≤1000

0≤ci≤50

Output

Output an integer which means the answer.

Sample Input

5

33 34 35 36 37

Sample Output

//多校第三场的大水题，拼的是手速！

//官方精彩题解：一个签到题，目的在于吐槽浙江的高温QAQ

#include <stdio.h>
int main()
{
    int n;
    int sum = 0;
    int c;
    scanf("%d", &n);
    for (int i = 0; i < n; i++)
    {
        scanf("%d", &c);
        if (c <= 35)
            sum++;
    }
    printf("%d\n", sum);
}