首页 > 编程知识 正文

RXDs dateHDU 6066

时间:2023-05-03 19:34:09 阅读:223029 作者:3879

眼睛大的花卷'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 眼睛大的花卷 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.
眼睛大的花卷 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 533 34 35 36 37  
Sample Output 3
  //多校第三场的大水题,拼的是手速
//官方精彩题解:一个签到题,目的在于吐槽浙江的高温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("%dn", sum);}

版权声明:该文观点仅代表作者本人。处理文章:请发送邮件至 三1五14八八95#扣扣.com 举报,一经查实,本站将立刻删除。

  • 相关阅读