Problem 1732. GJam: 2013 Rd1a Bullseye Painting - Large Numbers

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:hyperlink w:docLocation=\"http://code.google.com/codejam/contests.html\"><w:r><w:t>Google Code Jam</w:t></w:r></w:hyperlink><w:r><w:t> 2013 Round 1a Bullseye challenge is to determine how many full rings can be painted given an initial radius and an amount of paint.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Given a radius r, central white zone, create black rings of width 1 cm separated by 1 cm given P ml of paint that covers pi sq-cm per ml of paint provided.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>The test cases are a few from the 6000 in the Large number set. In contest mode the player has 8 minutes to submit a response after downloading the data set.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t></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> [r, p] uint64, 1&lt;=r&lt;=1E18, 1&lt;=P&lt;=2E18. Always enough P for one ring</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> Rings</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>Examples:</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"code\"/></w:pPr><w:r><w:t><![CDATA[[1 9] 1; % Normal number examples to understand concept\n[1 10] 2;\n[3 40] 3;\n\n[1 1000000000000000000] 707106780 for Bullseye Large Number Challenge\n[1 2000000000000000000] 999999999\n[760961177192651897 1521922354385303795] 1]]></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>Google Code Jam:</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>The next competition starts in April 2014. See details from above link.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Solutions to the various past Challenges using Matlab can be found via</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"http://www.go-hero.net/jam/13/solutions\"><w:r><w:t>GJam Solutions</w:t></w:r></w:hyperlink><w:r><w:t>.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Large number solutions require more elegant methods to avoid time-outs.</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>Related Challenges:</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>1)</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"http://www.mathworks.com/matlabcentral/cody/problems/1731-text-file-read-64-bit-data-set\"><w:r><w:t>Reading 64 bit input file</w:t></w:r></w:hyperlink></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>2)</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"http://www.mathworks.com/matlabcentral/cody/problems/1730-gjam-2013-rd1a-bullseye-painting\"><w:r><w:t>Bullseye Regular Numbers</w:t></w:r></w:hyperlink></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:rPr><w:b/></w:rPr><w:t>Usage of regexp is verboten</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>"}]}

<a href = "http://code.google.com/codejam/contests.html">Google Code Jam</a> 2013 Round 1a Bullseye challenge is to determine how many full rings can be painted given an initial radius and an amount of paint.Given a radius r, central white zone, create black rings of width 1 cm separated by 1 cm given P ml of paint that covers pi sq-cm per ml of paint provided.The test cases are a few from the 6000 in the Large number set. In contest mode the player has 8 minutes to submit a response after downloading the data set.<img src = "http://code.google.com/codejam/contest/images/?image=bullseye.png&p=2464487&c=2418487">Input: [r, p] uint64, 1&lt;=r&lt;=1E18, 1&lt;=P&lt;=2E18. Always enough P for one ringOutput: RingsExamples:<pre class="language-matlab">[1 9] 1; % Normal number examples to understand concept
[1 10] 2;
[3 40] 3;
</pre><pre class="language-matlab">[1 1000000000000000000] 707106780 for Bullseye Large Number Challenge
[1 2000000000000000000] 999999999
[760961177192651897 1521922354385303795] 1
</pre>Google Code Jam:The next competition starts in April 2014. See details from above link.Solutions to the various past Challenges using Matlab can be found via <a href = "http://www.go-hero.net/jam/13/solutions">GJam Solutions</a>.Large number solutions require more elegant methods to avoid time-outs.Related Challenges:1) <a href = "http://www.mathworks.com/matlabcentral/cody/problems/1731-text-file-read-64-bit-data-set">Reading 64 bit input file</a>2) <a href = "http://www.mathworks.com/matlabcentral/cody/problems/1730-gjam-2013-rd1a-bullseye-painting">Bullseye Regular Numbers</a>Usage of regexp is verboten

Solve

Solution Stats

24 Solutions
9 Solvers

Last Solution submitted on Sep 21, 2020

Last 200 Solutions

Problem Comments

2 Comments

2 Comments

Tim on 22 Jul 2013

Does r=uint64(308436464205151562) make sense? It seems like the argument to uint64 is a double precision number, so you have already lost the precision you are trying to gain by using uint64.

Richard Zapor on 22 Jul 2013

r=uint64(308436464205151562) outputs for uint64(r) 308436464205151562. However, r=308436464205151562 outputs for uint64(r) 308436464205151552. A very small loss in precision, but still a loss. The Challenge set has some numbers that use all the paint if full precision math was used. If residual paint was required as an output then full precision is needed. For solutions using p=p-2*r-1 the errors in r and p may cause issues.

Solution Comments

Solution 286810

2 Comments

2 Comments

Richard Zapor on 22 Jul 2013

Very novel input parameter adjustment to allow direct solution.

Rafael S.T. Vieira on 21 Sep 2020 at 16:19

That's Muller's method which is more computationally realiable than Bhaskaracharya's.

Solution 286604

1 Comment

1 Comment

Richard Zapor on 22 Jul 2013

Nice bisecting search method and anonymous function for clean appearance.

Problem Recent Solvers9

Problem Tags

Problem 1732. GJam: 2013 Rd1a Bullseye Painting - Large Numbers

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers9

Suggested Problems

More from this Author236

Problem Tags

Problem 1732. GJam: 2013 Rd1a Bullseye Painting - Large Numbers

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers9

Suggested Problems

More from this Author236

Problem Tags

Players