Hey there! I’m Sumeet Varma. I am extremely interested in Algorithms and Data Structures and so I do a lot of competitive programming. I am also a big fan of Counter-Strike, Politics and reading random answers on Quora.
My team (FruitSalad) came 1st in ACM ICPC ‘17 Kharagpur Regionals, 2nd in Kolkata Regionals and 7th in India Finals and we have qualified for World Finals. Also, I have been Red on Codeforces and the highest rated Indian programmer on Codeforces, Hackerrank and Topcoder in the past.
Currently, I am doing an internship at Directi (Bangalore) as a part of my project for final semester at DA-IICT, Gandhinagar.
Ask me anything!
Moderator note: We are very excited to host Sumeet for a Q&A session! He has a max rating of 2515 on Codeforces and 2173 on TopCoder, and you can see the graph going up consistently over the last 2.5 years. It's time to find out more about the person behind ...
I know competitive programming is all about how fast you can solve that problem and the machine will judge you , but while sharing your code for review or for helping others , please follow the points ,
- Try to avoid using letters as variables , unless mentioned in the problem , use some word which can say for what the variable is used.
- Properly use indentation and braces , do not write too much on a single line.
- Use spaces instead of tabs for indentation.
- If possible document it properly.
Well there are some others (though all wont agree on those),
- For C++ users , try to avoid , using namespace xxx; I know this means you have to write the namespace everywhere but trust me, sooner or later this will hurt you.
- Another , try to avoid using primitive arr...
Link: Indian Computing Olympiad Archives 2009
The problem description is as such:
"You are given a square grid of positive and negative numbers. You have to start at the top left corner of the grid and find a path to the bottom-right corner. In each step, you are only allowed to move one position to the right or one position down. As a special bonus, you are allowed at most one move that can be either to the left or up. Note that you are allowed to visit a position more than once as a result of this special move.
Your aim is to find such a path that has the maximum weight, where the weight of a path is the sum of all the numbers visited along the path."
Sample Input:
