Canadian Computing Competition: 2020 Stage 1, Junior #1
Barley the dog loves treats. At the end of the day, he is either happy or sad depending on the number and size of treats he receives throughout the day. The treats come in three sizes: small, medium, and large. His happiness score can be measured using the following formula:
where is the number of small treats, is the number of medium treats and is the number of large treats.
If Barley's happiness score is or greater then he is happy. Otherwise, he is sad. Determine whether Barley is happy or sad at the end of the day.
There are three lines of input. Each line contains a non-negative integer less than . The first line contains the number of small treats, , the second line contains the number of medium treats, , and the third line contains the number of large treats, , that Barley receives in a day.
If Barley's happiness score is or greater, output
happy. Otherwise, output
Sample Input 1
3 1 0
Output for Sample Input 1
Explanation of Output for Sample Input 1
Barley's happiness score is , so he will be sad.
Sample Input 2
3 2 1
Output for Sample Input 2
Explanation of Output for Sample Input 2
Barley's happiness score is , so he will be happy.
This comment is hidden due to too much negative feedback. Show it anyway.
Most people passed first try, look at the stats graph.
Hint's for anyone coming across this comment:
Hope you find these hints helpful! Upvote if yes!
CAPITALIZATION COUNTS ON THIS QUESTION! Don't make the same mistake I did and capitalize the first letters of the output...
Why does this problem have a 512 MB memory limit?
The memory limit reflects the limit from the CCC, but the time limit is smaller because the DMOJ judge is faster.