PIB '20 P1 - Marcus and Head Bonks - DMOJ: Modern Online Judge

PIB '20 P1 - Marcus and Head Bonks

Points: 3 (partial)

Time limit: 0.5s

Memory limit: 128M

Author:

Problem type

Marcus loves giving out hugs. Each day, there are $N$ $N$ people that Marcus can choose to hug or not. Person $i$ $i$ will have a cuteness value of $v_i$ $v_{i}$ . Marcus is a picky hugger, and only wishes to hug people with a positive cuteness value. Otherwise, if you have a non-positive cuteness value, he will only give you a head pat (which hurts). Can you determine how many people Marcus will hug by the end of the day?

Input Specification

The first line will contain the integer $N$ $N$ $(1 \le N \le 100)$ $(1 \leq N \leq 100)$ .

The next line will contain $N$ $N$ integers, $v_i$ $v_{i}$ $(-100 \le v_i \le 100)$ $(- 100 \leq v_{i} \leq 100)$ , the cuteness value of person $i$ $i$ .

Output Specification

Output the number of people Marcus will hug.

Sample Input

Copy

5
-1 -5 3 2 0

Sample Output

Copy

Explanation For Sample

Only person $3$ $3$ and person $4$ $4$ have a positive cuteness value, so Marcus will hug only them.

Comments

27

piddddgy commented on March 18, 2020, 7:34 p.m.

my headpats are great idk what ur talking about

4

p1geon commented on March 19, 2020, 5:09 a.m.

vouch