optimal parsing using dynamic programming
- Status: Closed
- Prize: $25
- Entries Received: 2
- Winner: commaster90
Contest Brief
I need the program to get a list of numbers and make the optimal parse tree as following.
$ ./myprogram 10 10 11 12 5 3 16 17 19 4 8
((x(x(xx)))((xx)(x(xx)))) 5562
5562 is scalar multipication.
the first 10 is the number of integer parameter.
10 11 12 5 3 16 17 19 4 8 are the numbers passing to the programming to build the tree.
I also need comments to understand how its been coded. thank you
Recommended Skills
Employer Feedback
“Communication with him is very good and easy.”
liefde2010, Canada.
Top entries from this contest
-
commaster90 Malaysia
-
neha190 India
Public Clarification Board
How to get started with contests
-
Post Your Contest Quick and easy
-
Get Tons of Entries From around the world
-
Award the best entry Download the files - Easy!