PROBLEM: ROUND #3

DAVIET Coding League 1.0

(Question Executable)

Link : http://bit.ly/15xh2Y3

Round Starts on : 6:30 PM (March 6, 2013)

Round Ends on : 12:30 PM (March 7, 2013)


Download the revised "dcl_revised.jar" file

Event has been delayed by 30 Minutes.


Submit solutions to codingleague@gmail.com

Intimation for Round #3

DAVIET Coding League 1.0

• Daviet Coding League 1.0 Round 3 starts today at 6:00 PM. 
• Download the question executable from this blog.
• Solutions will be accepted till March 7th, 2013 12:00 PM

Submission Rules

• Submit all your solution enclosed within a single 'rar' file i.e all the source code files must be submitted in one single rar file.
• rar file must be named with following convention.

"yourname_institute_collegerollno"

• Email id for submission : codingleague@gmail.com

For Queries contact:

Gourav Singh (+91-7508085060)

Rachit Chauhan (+91-9041227200)

Prabal Ghura (+91-9465452023)

Final Results: Round #2

List of top 10 participants of Round 2:

Top 5 participants has made it to Round 4 (Finals). Round 4 will start on March 8th, 2013. For more details check event schedule on www.aDAVitya.com/online-events and keep on checking this blog.

PROBLEM #12

Good Evening DCLites !

Finally we reached at the end of round 2. And today can be a big day for you as today’s problem may fetch you a maximum of 300 points. So, here’s your problem statement which is digressing from the trend of previous phase.

Problem Statement: Suppose you are a thief and you have broken into a Richie Rich’s house. You have a carry bag with you that can take up to M units of weight. The house is having N different riches having different profit values and weights. Your task is to fill your carry bag in such a way so that you can earn maximum profit. Either an item can be picked completely or totally rejected, that is, you can’t pick up fraction of an item.

You need to take input as N(different items available), Pi (their corresponding profit values), Wi (their corresponding weights) and M (capacity of your carry bag). And then you need to give output maximum profit that can be earned.

Samples:

Test case-I

Input: N=4     M=20         Pi={2,3,3,2}         Wi={5,7,3,10}
Output: Maximum Profit=8
Hint: Because we are taking items 1,2,3 and rejecting just item 4.

Test case-II

Input: N=6           M=30         Pi={3,8,4,3,20,6}        Wi={3,5,2,6,10,4}
Output: Maximum Profit=44

Test case-III

Input: N=4         M=25           Pi={8,9,10,11}            Wi={4,8,6,6}
Output: Maximum Profit=38


You can't pickup more than the capacity of carry bag as in case-I

BEST OF LUCK

Important Information !

Good Evening DCLites !

As observed by our team some of the submissions were identical in previous phases. We have ignored this most of the times but as we are heading towards end of this round, we decided to take a serious action. We have awarded points only to first submission (of identical codes) for the Problem 11.