Karan and his Sticker Collection

3.5

6 votes
Basic Programming, Ad-Hoc, Open, Approved, Easy
Problem

The purpose of this problem is to verify whether the method you are using to read input data is sufficiently fast to handle problems branded with the enormous Input/Output warning. You are expected to be able to process at least 2.5MB of input data per second at runtime.

Karan likes stickers. All his stickers are rectangular in shape. Since he has less space on his laptop, he likes to stick only the stickers whose length is less than 3*10^8 nm. Since he is running short of time, he asks you the number of stickers he will be able to put on his laptop.

Input: The input begins with a positive integer N (N<=10^9). The next line of input contains N space-separated, positive integers, not greater than 10^10 each. Ti is the length of ith sticker in nanometres.

Output: Print the answer.

Note: There is no partial marking in this question. Chances are that you get 0 even when you have passed all the test cases.

Time Limit: 3
Memory Limit: 256
Source Limit:
Editor Image

?