Problem 44075. GJam 2017 Kickstart: Parentheses (Large)

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/6304486/dashboard#s=p2\"><w:r><w:t>GJam 2017 Kickstart Parentheses</w:t></w:r></w:hyperlink><w:r><w:t>. This is the first 100 large cases with 1&lt;=L+R&lt;=10^5.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:hyperlink w:docLocation=\"http://code.google.com/codejam\"><w:r><w:t>Google Code Jam 2017 Qualifier</w:t></w:r></w:hyperlink><w:r><w:t> is March 7, 2017. Typically four challenges with small and large aspects with 27 hours to complete.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>The GJam story is given L left and R right parentheses determine the maximum number of parentheses pairings.</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> [L,R], the quantity of parentheses types</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> [V], the maximum number of parentheses pairings</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:r><w:t> [L,R] [V]; [3,2] [3]</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>For the case ()()(, for example, the three balanced groups are () from indexes 1 to 2, () from indexes 3 to 4, and ()() from indexes 1 to 4.</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>Theory:</w:t></w:r><w:r><w:t> Brute force permutations and counting will not succeed in a timely manner for L+R=10^5. Determining the inherent mathematical pattern is usually the best way to succeed in GJam. </w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"http://code.google.com/codejam/contest/6304486/scoreboard#vf=1\"><w:r><w:t>GJam Kickstart solutions(C++,Python)</w:t></w:r></w:hyperlink><w:r><w:t>.</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/6304486/dashboard#s=p2">GJam 2017 Kickstart Parentheses</a>. This is the first 100 large cases with 1&lt;=L+R&lt;=10^5.<a href = "http://code.google.com/codejam">Google Code Jam 2017 Qualifier</a> is March 7, 2017. Typically four challenges with small and large aspects with 27 hours to complete.The GJam story is given L left and R right parentheses determine the maximum number of parentheses pairings.Input: [L,R], the quantity of parentheses typesOutput: [V], the maximum number of parentheses pairingsExamples: [L,R] [V]; [3,2] [3]For the case ()()(, for example, the three balanced groups are () from indexes 1 to 2, () from indexes 3 to 4, and ()() from indexes 1 to 4.Theory: Brute force permutations and counting will not succeed in a timely manner for L+R=10^5. Determining the inherent mathematical pattern is usually the best way to succeed in GJam. <a href = "http://code.google.com/codejam/contest/6304486/scoreboard#vf=1">GJam Kickstart solutions(C++,Python)</a>.

This Challenge is derived from <http://code.google.com/codejam/contest/6304486/dashboard#s=p2 GJam 2017 Kickstart Parentheses>. This is the first 100 large cases with 1<=L+R<=10^5.

<http://code.google.com/codejam Google Code Jam 2017 Qualifier> is March 7, 2017. Typically four challenges with small and large aspects with 27 hours to complete.

The GJam story is given L left and R right parentheses determine the maximum number of parentheses pairings.

*Input:* [L,R], the quantity of parentheses types

*Output:* [V], the maximum number of parentheses pairings

*Examples:* [L,R] [V]; [3,2] [3]

For the case ()()(, for example, the three balanced groups are () from indexes 1 to 2, () from indexes 3 to 4, and ()() from indexes 1 to 4.

*Theory:* Brute force permutations and counting will not succeed in a timely manner for L+R=10^5. Determining the inherent mathematical pattern is usually the best way to succeed in GJam. <http://code.google.com/codejam/contest/6304486/scoreboard#vf=1 GJam Kickstart solutions(C++,Python)>.

Solve

Solution Stats

21 Solutions
14 Solvers

Last Solution submitted on Dec 01, 2022

Last 200 Solutions

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers14

Problem Tags

Community Treasure Hunt

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

Start Hunting!

Problem 44075. GJam 2017 Kickstart: Parentheses (Large)

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers14

Suggested Problems

More from this Author260

Problem Tags

Community Treasure Hunt

Problem 44075. GJam 2017 Kickstart: Parentheses (Large)

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers14

Suggested Problems

More from this Author260

Problem Tags

Community Treasure Hunt

Players