Problem 44075. GJam 2017 Kickstart: Parentheses (Large)
This Challenge is derived from GJam 2017 Kickstart Parentheses. This is the first 100 large cases with 1<=L+R<=10^5.
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. GJam Kickstart solutions(C++,Python).
Solution Stats
Problem Comments
Solution Comments
Show commentsProblem Recent Solvers16
Suggested Problems
-
506 Solvers
-
How many trades represent all the profit?
592 Solvers
-
285 Solvers
-
Magic is simple (for beginners)
8367 Solvers
-
When can one be the Life Member of the IEEE?
74 Solvers
More from this Author294
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!