All posts by admin

Exun Farewell

Uncategorized

The time has come to bid a farewell to our seniors, the twelfth graders.

The Exun Farewell will be held at Pizza Hut, Vasant Lok, on February 6, 2009 which is a Friday. We shall be leaving directly from school. Please arrange for transport to return home from the farewell. All those who will be attending, please leave a comment.

To the Programmers…

Uncategorized

Here is another problem that explores the concept used in the last of my problems.
This problem has been taken from INOI 2008.
Domino Solitaire
In Domino Solitaire, you have a grid with two rows and many columns. Each square in the grid contains an integer. You are given a supply of rectangular 2 × 1 tiles, each of which exactly covers two adjacent squares of the grid. You have to place tiles to cover all the squares in the grid such that each tile covers two squares and no pair of tiles overlap. The score for a tile is the difference between the bigger and the smaller number that are covered by the tile. The aim of the game is to maximize the sum of the scores of all the tiles. Here is an example of a grid, along with two different tilings and their scores. 

The score for Tiling 1 is 12 = (9 − 8) + (6 − 2) + (7 − 1) + (3 − 2) while the score for Tiling 2 is 6 = (8 − 6) + (9 − 7) + (3 − 2) + (2 − 1). There are other tilings possible for this grid, but you can check that Tiling 1 has the maximum score among all tilings. Your task is to read the grid of numbers and compute the maximum score that can be achieved by any tiling of the grid.

Input format
The first line contains one integer N, the number of columns in the grid. This is followed by 2 lines describing the grid. Each of these lines consists of N integers, separated by blanks. 
Output format
A single integer indicating the maximum score that can be achieved by any tiling of the given grid.
Test data
For all inputs, 1 < = N <=10^5. Each integer in the grid is in the range {0, 1, . . . , 10^4}. 

ACCESS 2008 – Overall Winners

Uncategorized
ACCESS 2008 was held at Modern Barakhamba Road on the 16th and the 17th of December. DPS RK Puram, represented by the Exunclan were declared the Overall Winners.

The Individual results are as follows –

Senior Quiz – Second Position

  • Anuj Bhardwaj
  • Ashish Pandey
Junior Quiz – Second Position
  • Dhananjay Goel
  • Tanay Padhi
Junior Quiz – Third Position
  • Aditya Grover
  • Vishesh Kumar
Group Discussion – Second Position
  • Aditya Anand
Sub Junior Quiz – Second Position
  • Manas Jha
  • Rishabh Goel
Sub Junior Quiz – Third Position

  • Utkarsh Agrawal
  • Shreyas Padhi

Cadet Quiz – First Position

  • Tanay Kothari
  • Akshay Gupta

Also a special mention for Adideva Sekhri and Rohan Nagpal for their efforts in the Sub Junior Quiz.

Sorry for the delay in the results.

– Congrats Everyone

To the Programmers..

Uncategorized

Well, this is an interesting question and deals with a new (for us) and interesting concept. Have a try..


Santa Claus has lined up a row of bowls, each containing some chocolates. Nikhil has been told that he can pick up as many of these bowls as he wants, provided that he never picks two consecutive bowls.

Your aim is to help Nikhil choose a set of bowls so that he maximizes the number of chocolates that he picks up.

Input format

The first line of the input contains one integer N, the number of bowls. This is followed by a line containing N integers, describing the number of chocolates in each of the N bowls.

Notes

In all cases, N ≤ 100,000.

Output format

Your output should be a single line consisting of one integer, the maximum number of chocolates that Nikhil can collect.

Sample Input

10 
30 10 8 20 11 12 25 13 20 19

Sample Output

95

You can post your solution/logic/hints as a comment.


TCS IT WIZ Quiz

quiz, tcs it wiz

The TCS IT WIZ Quiz 2008 organized by Tata Consultancy Services was held on 11th of December. As many as 650 teams of two from numerous schools across Delhi participated in the event conducted at Dogra Hall, IIT Delhi. One Team from our school qualified for the Regional Finals and managed to emerge as winners of the quiz. The team consisted of:

Aditya Jain (X-D)
Sameer Mittal (XII – J)

They have as a result been selected for the National Finals to be held in Bangalore. They Received HP Laptops amongst other Goodies ! Our School not only Defended the title they won last year but also won the Best Cheering School award.

C.O.R.E 2008 – Overall Winners!

Uncategorized

C.O.R.E, the computer club of D.P.S Dwarka organized its first annual interschool Computer symosium- C.O.R.E ’08. Delhi Public School R.K Puram bagged the overall trophy. The individual results are as follows-

Quiz- First Position

  • Anuj Bharadwaj
  • Dhananjay Goel

Programming- First Position

  • Anand Khare
  • Sakshi Gupta

Surprise Event- First Position

  • Tanay Padhi
  • Adideva Sekhri

Gaming (Fifa)- First Position

  • Aviral Goyal

Group Discussion- Second Position

  • Samarth Mathur

Crossword- Third Position

  • Sampoorna Biswas
  • Aditya Grover

There was also a special mention of the participants of Creative Event, Pranav Obhrai and Arpit Mathur.

Congratulations to all!

CORE 2008

Uncategorized
CORE, the computer club of Delhi Public School, Dwarka is organizing CORE 08 – First
Annual Inter-School Technology Symposium on 10th December 2008. The list of events is as follows :


1. Quiz
2. Crossword
3. Creative Event
4. Gaming
5. Programming
6. Group Discussion
7. Surprise Event

For event details, please click here

All those interested in participating are requested to leave a comment


Rishabh
-We not I