The Submission is done by the members of Team CoderX.
Check the Problem Statement.
Submission in Python version 1.0
Simply this algorithm is about adding up the number of slices of the given Pizzas in reverse order
Inputs | Points |
---|---|
A_example | 16 Points |
B_small | 99 Points |
C – medium | 4,495 points |
D – quite big | 999,999,725 points |
E – also big | 504,999,983 points |
Total | 1,505,004,318 |
Input files for the Python submission can be found here
Output files for the Python Submission can be found here
Submission in Python Version 2.0
The different solution found by us is 0/1 Knapsack Problem, Taking weights and capacity. Its a subset problem.
Inputs | Points |
---|---|
A_example | 16 Points |
B_small | 100 Points |
C – medium | 4,500 points |
D – quite big | Computer Freezes |
E – also big | Computer Freezes |
Total | ------------ Points |
The solution found by us is 0/1 Knapsack Problem, Taking weights and capacity.
Heap problem for d_quite_big and e_also_big. I have generated the GC_log and attached the heap dump to understand the problem briefly in the VisualVM.
Inputs | Points |
---|---|
A_example | 16 Points |
B_small | 100 Points |
C – medium | 4,500 points |
D – quite big | Out of Memory |
E – also big | Out of Memory |
Total | ------------- Points |
Input files for the Java submission can be found here
Output files for the Java Submission can be found here
MIT