The Nineteenth Byte

The Nineteenth Byte: General discussion for codegolf.stackexc...
Feb 17, 2019 15:21
I thought about just modifying it to make them all mirrored but google shows that polygonal rooms can be illuminated everywhere except a finite number of points (thus having zero area). Since they’re not all mirrored I can probably figure out a solution (though not an efficient one) just by checking every side
Feb 17, 2019 15:20
Well, further consideration has led me to think that it may not be such a good idea. It would be a variant of this problem: codegolf.stackexchange.com/questions/179938/… with the specification that certain walls can be considered mirrored and can reflect light. I thought about just modifying it to make them all mirrored but google shows that polygonal rooms can be illuminated everywhere except a finite number of points (thus having zero area).
Feb 17, 2019 15:19
Is there a character limit on messages in this chat?
Feb 17, 2019 15:10
i have an (i think) pretty solid idea for a challenge, my issue is that I don’t know how to provide test cases and diagrams on Desmos because I’m not sure how to efficiently solve it..
Feb 14, 2019 21:42
o thats me
Dec 23, 2017 04:29
Has anyone here used Trajedy before? It seems really mathy
Dec 22, 2017 16:35
i believe there was some way using determinants to check if a point is inside a tetrahedron that can be extrapolated to n dimensions..
Dec 22, 2017 16:33
I think it might be time to whip out my copy of matlab and my linear algebra lecture notes from a long while ago
Dec 22, 2017 16:33
i guess i can find an n-cube that circumscribes the simplex, and then check all the points on the interior for if they are in the simplex
Dec 22, 2017 16:32
its the problem the bot just posted
Dec 22, 2017 16:24
Do you guys ever write problems that you don't know how to solve
Jul 14, 2017 09:07
Output g, where g is the house number that should receive the biggest and best gift (the house that got pranked the most).
Jul 14, 2017 09:06
The first line contains two integers, h and d
(1 ≤ h ≤ 100,000; 1 ≤ d ≤ 100,000), representing the number of houses and the number of days that Santa pranked the South Pole that year, respectively. The next d lines each contain three integers, s, k, and p (1 ≤ s ≤ h; 2 ≤ k ≤ 10; 1 ≤ p ≤ h), denoting the starting house, the number representing his frequency of visiting houses (he skips k-1 houses), and the maximum number of houses he pranks that day. Note that he will visit p houses unless he passes the very last house.
Jul 14, 2017 09:05
It is widely known that Santa Claus delivers presents to houses all over the world in December. However, not many people know what he does during the rest of the year. You see, Santa enjoys a jolly good prank, and he'll often find himself pranking entire cities when he's not busy making or delivering toys.
One place that he particularly enjoys pranking is the South Pole. There are h houses in the South Pole, which are conveniently numbered from 1 to h. Whenever Santa is in the mood for pranking, he'll start at a particular house, s. He rings the doorbell, then runs to another house.
Jul 14, 2017 09:02
i have a problem i want to post but i have a feeling it's too hard, I wasn't able to solve it at all until someone explained it to me regardless of golfing