Difference between revisions of "2024 SSMO Accuracy Round Problems/Problem 1"

(Created page with "==Problem== Let a time of day be three-full if exactly three of its digits are <math>3</math>s when displayed on a <math>12</math>-hour clock in the <math>hh:mm:ss</math> for...")
 
 
Line 4: Line 4:
  
 
==Solution==
 
==Solution==
 +
Note that <math>hh</math> is a number from <math>01</math> to <math>12,</math> <math>mm</math> and <math>ss</math> are both integers from <math>00</math> to <math>59.</math> There are <math>45,14,1</math> two-digit integers from <math>00</math> to <math>59</math> that have <math>0,1,2</math> <math>3's,</math> respectively. If <math>hh</math> contains a <math>3,</math> then there are <math>(45)(1)+(14)(14)+(1)(45) = 286</math> possibilities. Otherwise, there are <math>(11)((1)(14)+(14)(1)) = 308</math> possibilities. Since the all times on the <math>12</math>-hour clock appear twice each day, our answer is <math>2(286+308) = \boxed{1188}.</math>
 +
 +
 +
~SMO_Team

Latest revision as of 14:30, 10 September 2025

Problem

Let a time of day be three-full if exactly three of its digits are $3$s when displayed on a $12$-hour clock in the $hh:mm:ss$ format. How many seconds of the day are three-full?

Solution

Note that $hh$ is a number from $01$ to $12,$ $mm$ and $ss$ are both integers from $00$ to $59.$ There are $45,14,1$ two-digit integers from $00$ to $59$ that have $0,1,2$ $3's,$ respectively. If $hh$ contains a $3,$ then there are $(45)(1)+(14)(14)+(1)(45) = 286$ possibilities. Otherwise, there are $(11)((1)(14)+(14)(1)) = 308$ possibilities. Since the all times on the $12$-hour clock appear twice each day, our answer is $2(286+308) = \boxed{1188}.$


~SMO_Team