Das Blinkenlights: Difference between revisions
Jump to navigation
Jump to search
Created page with "This problem gives us two blinking lights that blink at specified intervals, and asks if they will blink at the same time before some end-time. We can either brute force, or..." |
No edit summary |
||
Line 3: | Line 3: | ||
We can either brute force, or calculate the least common multiple (a*b/gcd). | We can either brute force, or calculate the least common multiple (a*b/gcd). | ||
[[ | [[Category:ICPC Problems]] | ||
[[Category:Icpcq2018]] | [[Category:Icpcq2018]] | ||
[[Category:GCD]] | [[Category:GCD]] |
Latest revision as of 22:34, 15 October 2018
This problem gives us two blinking lights that blink at specified intervals, and asks if they will blink at the same time before some end-time.
We can either brute force, or calculate the least common multiple (a*b/gcd).