CCC '20 J1 - Dog Treats

View as PDF

Submit solution

Points: 3
Time limit: 1.0s
Memory limit: 512M

Problem type
Allowed languages
Ada, Assembly, Awk, Brain****, C, C#, C++, COBOL, CommonLisp, D, Dart, F#, Forth, Fortran, Go, Groovy, Haskell, Intercal, Java, JS, Kotlin, Lisp, Lua, Nim, ObjC, OCaml, Octave, Pascal, Perl, PHP, Pike, Prolog, Python, Racket, Ruby, Rust, Scala, Scheme, Sed, Swift, TCL, Text, Turing, VB, Zig
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:

\displaystyle 1 \times S + 2 \times M + 3 \times L

where S is the number of small treats, M is the number of medium treats and L is the number of large treats.

If Barley's happiness score is 10 or greater then he is happy. Otherwise, he is sad. Determine whether Barley is happy or sad at the end of the day.

Input Specification

There are three lines of input. Each line contains a non-negative integer less than 10. The first line contains the number of small treats, S, the second line contains the number of medium treats, M, and the third line contains the number of large treats, L, that Barley receives in a day.

Output Specification

If Barley's happiness score is 10 or greater, output happy. Otherwise, output sad.

Sample Input 1

3
1
0

Output for Sample Input 1

sad

Explanation of Output for Sample Input 1

Barley's happiness score is 1 \times 3 + 2 \times 1 + 3 \times 0 = 5, so he will be sad.

Sample Input 2

3
2
1

Output for Sample Input 2

happy

Explanation of Output for Sample Input 2

Barley's happiness score is 1 \times 3 + 2 \times 2 + 3 \times 1 = 10, so he will be happy.


Comments


  • 3
    BadAccount  commented on July 2, 2020, 12:40 p.m.

    Why does this problem have a 512 MB memory limit?


    • 3
      maxcruickshanks  commented on July 2, 2020, 4:01 p.m. edited

      The memory limit reflects the limit from the CCC, but the time limit is smaller because the DMOJ judge is faster.