GFSSOC '14 Winter J1 - Flying Plushies

View as PDF

Submit solution

Points: 3 (partial)
Time limit: 2.0s
Memory limit: 16M

Problem type

Griffy is flying to Don Mills C.I. to make friends (after Glenforest's defeat in ECOO)! Griffy would like to fly at exactly N meters off the ground (the most relaxing height). However, Don Mills (being a weird school) recently installed M giant cat girl plushies in a line (right on Griffy's course too!). Each plushie i has a height of H_i, and spans from the ground to its height inclusive. Determine how many plushies Griffy will fly into, assuming he will fly in a straight line at a constant height.

Input Specification

The first line will contain a single integer N (1 \le N \le 200).

The second line will contain a single integer M (1 \le M \le 200).

The next M lines will contain values of H_i (1 \le H_i \le 400).

Output Specification

Output one line, the number of plushies that Griffy will fly into.

Sample Input


Sample Output



  • 4
    0Power10  commented on July 15, 2021, 4:20 p.m.

    I agree, definitely a weird school.