tag:blogger.com,1999:blog-29632375.post1376673784652270085..comments2024-06-25T13:05:10.432-07:00Comments on vexorian's blog: SRM 611: My first python SRMUnknownnoreply@blogger.comBlogger4125tag:blogger.com,1999:blog-29632375.post-25390972136441727222014-03-04T09:31:16.085-08:002014-03-04T09:31:16.085-08:00I guess you mean: Take all numbers from set S that...I guess you mean: Take all numbers from set S that divide x, if their LCM divides x, then x can be in the LCM set of S. Yeah, I noticed some time after the match.vexoriannoreply@blogger.comtag:blogger.com,1999:blog-29632375.post-83923225731441021682014-03-04T08:49:55.082-08:002014-03-04T08:49:55.082-08:00> How can you tell if a number can be made from...> How can you tell if a number can be made from the other numbers in the set?<br /><br />Looking at most solutions it looks like an element x can be removed from X if x == LCM([y for y in X if x%y == 0 and y<x]). In other words, take the LCM of all numbers less than x that divide it evenly. If that LCM == x then it can be removed.JOmegaCVnoreply@blogger.comtag:blogger.com,1999:blog-29632375.post-86048365105077920262014-03-04T08:46:15.018-08:002014-03-04T08:46:15.018-08:00> How can you tell if a number can be made from...> How can you tell if a number can be made from the other numbers in the set?<br />Looking at most solutions it looks like an element x can be removed from X if x == LCM([y for y in X if x%y == 0 and y<x]). I.e. take the LCM of all numbers less than x that divide it evenly. If that LCM == x then it can be removed.<br /><br />Passes sys tests: https://gist.github.com/JWCornV/07a57b446000efd96faeJOmegaCVnoreply@blogger.comtag:blogger.com,1999:blog-29632375.post-56026787213987348102014-03-04T05:43:51.000-08:002014-03-04T05:43:51.000-08:00System tests are out: I failed 250. This is likely...System tests are out: I failed 250. This is likely an algorithmic fault.vexoriannoreply@blogger.com