Points: 3 (partial)
Time limit: 2.0s
Memory limit: 16M
Griffy is flying to Don Mills C.I. to make friends (after Glenforest's defeat in ECOO)! Griffy would like to fly at exactly meters off the ground (the most relaxing height). However, Don Mills (being a weird school) recently installed giant cat girl plushies in a line (right on Griffy's course too!). Each plushie has a height of , 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.
The first line will contain a single integer .
The second line will contain a single integer .
The next lines will contain values of .
Output one line, the number of plushies that Griffy will fly into.
5 3 1 7 5
It was a weird problem.
Interestingly the last 4 cases returned
NumberFormatExceptionand further testing revealed null inputs for those cases, even though my program passed the sample input and the other cases. Test cases are written wrong, perhaps? Or do I have to consider null as a possible input and compensate for it?
Not quite sure if this will solve it, but a byte can only handle values up to 128. The maximum output can be 200.
Changed to all shorts but still didn't work. I think it's the problem with the test cases.
There's still a
bytekeyword in your code
My stupidity is my downfall... Forgot that byte only goes to 127... I'll leave this here so future people don't mess up at this point. And yup it works now. Thanks.
I agree, definitely a weird school.