hdu6066RXD's date（水）

RXD's date

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 524288/524288 K (Java/Others)
Total Submission(s): 467    Accepted Submission(s): 372

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
  
  
  
  


  
  
  
  

   
   求出小于等于35的数量
  
  
  
  

   
   
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <queue>
#include <iostream>
using namespace std;
int main()
{
    int n;
    int a[1010];
    while(scanf("%d",&n)!=EOF)
    {
        int ans=0;
        for(int i=0;i<n;i++)
        {
            scanf("%d",&a[i]);
            if(a[i]<=35)
            ans++;
        }
        cout<<ans<<endl;
    }
    return 0;
}