2017多校联合三／hdu6066RXD's date大水题

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

  
  

   
   3
  
  

 

Source

2017 Multi-University Training Contest - Team 3

做了几场多校以来最水的一道题

求一堆数中小于等于35的有多少

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <string.h>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <list>
#include <bitset>
#include <stack>
#include <stdlib.h>
#define lowbit(x) (x&-x)
#define e exp(1.0)
//ios::sync_with_stdio(false);
//    auto start = clock();
//    cout << (clock() - start) / (double)CLOCKS_PER_SEC;
typedef long long ll;
typedef long long LL;
using namespace std;

int main()
{
    int n;
    int a;
    int ans;
    while(cin>>n)
    {
        ans=0;
        for(int i=0;i<n;i++)
        {
            cin>>a;
            if(a<=35)
                ans++;
        }
        cout<<ans<<endl;
    }
    return 0;
}