Problem 2262. GJam 2011 Africa Qualifier B: Optimum Profit

Created by Richard Zapor

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>This Challenge is derived from</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"http://code.google.com/codejam/contest/837485/dashboard#s=p1\"><w:r><w:t>GJam 2011 Africa: Investing at the Market</w:t></w:r></w:hyperlink><w:r><w:t>. Google Code Jam 2014 Kicks Off its Qualifier round April 11.</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"http://code.google.com/codejam\"><w:r><w:t>GJam Registration</w:t></w:r></w:hyperlink><w:r><w:t>. The Test Suite, at the bottom, contains a full GJam file input read (fgetl and dlmread), process, and Output example.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Determine the single optimal Buy and Sell time to optimize Profit. If multiple cases exist then provide set with minimum Buy cost. Investment buys made in whole units. If no profit is possible return [0 0 0]. Only one Buy/Sell pair occurs.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:rPr><w:b/></w:rPr><w:t>Input:</w:t></w:r><w:r><w:t> M,x Where M is Investment and x,size(1,12), is Commodity Buy/Sell Price</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:rPr><w:b/></w:rPr><w:t>Output:</w:t></w:r><w:r><w:t> BSP, [BuyPt SellPt Profit]</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:rPr><w:b/></w:rPr><w:t>Example:</w:t></w:r><w:r><w:t> M=100; x=[52 50 25 100 61 63 70 51 71 55 10 5];</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Output: 3 4 300</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Additional GJam solutions can be found at</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"http://go-hero.net/jam\"><w:r><w:t>Example GJam Matlab solutions</w:t></w:r></w:hyperlink><w:r><w:t>. Select Find Solutions, change Language to Matlab. There were only 50 Qualifier Matlab entrants in 2013 and a mere 2 Matlab users achieved round 2.</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>"}]}

This Challenge is derived from <a href = "http://code.google.com/codejam/contest/837485/dashboard#s=p1">GJam 2011 Africa: Investing at the Market</a>.
Google Code Jam 2014 Kicks Off its Qualifier round April 11. <a href = "http://code.google.com/codejam">GJam Registration</a>. The Test Suite, at the bottom, contains a full GJam file input read (fgetl and dlmread), process, and Output example.Determine the single optimal Buy and Sell time to optimize Profit. If multiple cases exist then provide set with minimum Buy cost. Investment buys made in whole units. If no profit is possible return [0 0 0]. Only one Buy/Sell pair occurs.Input: M,x Where M is Investment and x,size(1,12), is Commodity Buy/Sell PriceOutput: BSP, [BuyPt SellPt Profit]Example:
M=100; x=[52 50 25 100 61 63 70 51 71 55 10 5];Output: 3 4 300Additional GJam solutions can be found at <a href = "http://go-hero.net/jam">Example GJam Matlab solutions</a>. Select Find Solutions, change Language to Matlab. There were only 50 Qualifier Matlab entrants in 2013 and a mere 2 Matlab users achieved round 2.

Solve

Solution Stats

26 Solutions
13 Solvers

Last Solution submitted on Sep 20, 2020

Last 200 Solutions

Problem Comments

1 Comment

1 Comment

Rafael S.T. Vieira on 20 Sep 2020

Again a better description for this problem is needed. Found it a at a blog. https://titanwolf.org/Network/Articles/Article?AID=47afa1e5-84c0-4745-b143-9cf7cb8c2030#gsc.tab=0 Basically, we have some money to buy stocks and a vector with the forecast of a stock price for the upcoming months. We must decide when to buy and later sell this stock to obtain the greatest profit (if possible), but this operation can only be done once. In this problem the author also wants the position for buying and selling (smallest buying price if more than one possibility exists).

Problem Recent Solvers13

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Problem 2262. GJam 2011 Africa Qualifier B: Optimum Profit

Solution Stats

Last 200 Solutions

Problem Comments

Problem Recent Solvers13

Suggested Problems

More from this Author241

Problem Tags

Community Treasure Hunt

Problem 2262. GJam 2011 Africa Qualifier B: Optimum Profit

Solution Stats

Last 200 Solutions

Problem Comments

Problem Recent Solvers13

Suggested Problems

More from this Author241

Problem Tags

Community Treasure Hunt

Players