From: rjh@cpax.org.uk   
      
   On 14/12/2022 2:58 pm, Dmitry A. Kazakov wrote:   
   > On 2022-12-14 15:10, Richard Heathfield wrote:   
   >> On 14/12/2022 1:35 pm, Dmitry A. Kazakov wrote:   
   >>> On 2022-12-14 14:10, Richard Heathfield wrote:   
   >>>> On 14/12/2022 1:06 pm, Dmitry A. Kazakov wrote:   
   >>>>> On 2022-12-14 13:24, Stefan Ram wrote:   
   >>>>>>    Given n times of the 24-hour day, print their average.   
   >>>>>>   
   >>>>>>    For example, the average of "eight o'clock" and   
   >>>>>>    "ten o'clock" (n=2) would be "nine o'clock".   
   >>>>>   
   >>>>> You probably missed to require the interesting part: doing   
   >>>>> all that in the modular type (modulo 24) arithmetic:   
   >>>>>   
   >>>>>     20 + 5 = 1 (mod 24)   
   >>>>   
   >>>> ...which will give you the wrong answer. Chase that goose!   
   >>>   
   >>> Right, you must count the wrap-ups.   
   >   
   > [...]   
   >   
   >> So why do you need mod?   
   >   
   > As I said, the challenge is only interesting in modulo arithmetic   
      
   So the challenge is only interesting if you add something you   
   don't need. Let's throw in some elephants. Does that make it more   
   interesting?   
      
   > BTW, averaging floats is a nasty problem too. A naive   
   > implementation quickly loses precision.   
      
   We're dealing with 'o'clock' and "HH:MM", and nowadays we have   
   64-bit integer types and there are even 128-bit integers mooching   
   around looking for a reason to exist. You'd have to average a   
   hell of a lot of times even to /need/ floats, let alone lose   
   significant precision.   
      
   --   
   Richard Heathfield   
   Email: rjh at cpax dot org dot uk   
   "Usenet is a strange place" - dmr 29 July 1999   
   Sig line 4 vacant - apply within   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)