Problem 204. yet another flying fly (YAFF)

Created by Alfonso Nieto-Castanon

Solve Later

{"relationships":[{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/document","targetMode":"","relationshipId":"rId1","target":"/matlab/document.xml"},{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/output","targetMode":"","relationshipId":"rId2","target":"/matlab/output.xml"}],"parts":[{"partUri":"/matlab/document.xml","relationship":[],"contentType":"application/vnd.mathworks.matlab.code.document+xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<w:document xmlns:w=\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\"><w:body><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Same as the previous problem</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"http://www.mathworks.com/matlabcentral/cody/problems/203-fly-fly-away\"><w:r><w:t>fly fly away</w:t></w:r></w:hyperlink><w:r><w:t> but now with</w:t></w:r><w:r><w:t> </w:t></w:r><w:r><w:rPr><w:b/></w:rPr><w:t>two</w:t></w:r><w:r><w:t> flies! (which of course makes it twice as exciting)</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Two flies start always at fixed positions (-100,0) and (100,0), respectively, and they follow two different predefined sequences of discrete jumps (these movements are defined by the vectors</w:t></w:r><w:r><w:t> </w:t></w:r><w:r><w:rPr><w:i/></w:rPr><w:t>dx1</w:t></w:r><w:r><w:t> </w:t></w:r><w:r><w:rPr><w:i/></w:rPr><w:t>dy1</w:t></w:r><w:r><w:t> for the first fly and</w:t></w:r><w:r><w:t> </w:t></w:r><w:r><w:rPr><w:i/></w:rPr><w:t>dx2</w:t></w:r><w:r><w:t> </w:t></w:r><w:r><w:rPr><w:i/></w:rPr><w:t>dy2</w:t></w:r><w:r><w:t> for the second fly). Your job is to determine whether the flies will collide at some point.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>The same conditions apply as in the previous problem (100 repetitions of movement sequences maximum).</w:t></w:r><w:r><w:t> </w:t></w:r><w:r><w:rPr><w:i/></w:rPr><w:t>Unscored awesome points</w:t></w:r><w:r><w:t> if you can find a solution where the algorithm computational time does not increase linearly with the number of repetitions, without requiring the sequences (dx1,dy1) and (dx2,dy2) to be the same size.</w:t></w:r></w:p></w:body></w:document>"},{"partUri":"/matlab/output.xml","contentType":"text/xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\" standalone=\"no\" ?><embeddedOutputs><metaData><evaluationState>manual</evaluationState><layoutState>code</layoutState><outputStatus>ready</outputStatus></metaData><outputArray type=\"array\"/><regionArray type=\"array\"/></embeddedOutputs>"}]}

Solve

Solution Stats

72 Solutions
21 Solvers

Last Solution submitted on Mar 28, 2020

Last 200 Solutions

Problem Comments

1 Comment

1 Comment

Andrew Newell on 10 Jul 2017

Maybe "awesome points" should be acknowledged with a like.

Solution Comments

Solution 20919

1 Comment

1 Comment

@bmtran (Bryant Tran) on 1 Feb 2012

No awesome points, but it gets the answer!

Problem Recent Solvers21

Problem Tags

math

Problem 204. yet another flying fly (YAFF)

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers21

Suggested Problems

More from this Author38

Problem Tags

Problem 204. yet another flying fly (YAFF)

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers21

Suggested Problems

More from this Author38

Problem Tags

Players