anudeep2011's blog

By anudeep2011, history, 9 years ago, In English

"Would it not be amazing if you get recommendations for similar problems based on what you have already solved"

"Would it not be amazing if there is someone ALWAYS to help you when you are struck on a problem?"

http://blog.anudeep2011.com/machine-learning-everywhere-why-not-in-competitive-programming/

Full text and comments »

  • Vote: I like it
  • +124
  • Vote: I do not like it

By anudeep2011, 10 years ago, In English

CodeChef invites you to participate in the January Cook-off 2015 at codechef.com/COOK54.



Time: 18th January 2015 (2130 hrs) to 19th January 2015 (0000 hrs). (Indian Standard Time — +5:30 GMT) — Check your timezone.

Details: codechef.com/COOK54/

Registration: Just need to have a CodeChef user id to participate.

New users please register here

- Problem Setter : Anupdeep Nekannti
- Problem Tester and Mandarin Translator: Minako Kojima
- Russian Translator : Sergey Kulik
- Editorialist: Lalit Kundu

It promises to deliver on an interesting set of algorithmic problems with something for all.
The contest is open for all and those, who are interested, are requested to have a CodeChef userid, in order to participate. Have you tried the new Code, Compile & Run feature on CodeChef? Try it here

Full text and comments »

  • Vote: I like it
  • +51
  • Vote: I do not like it

By anudeep2011, 10 years ago, In English

Personal Text : I tried to make the set as interesting as possible. I hope everyone will enjoy the contest. Last time (and first time) I made cook off, the whole set was solved in 76 minutes (No prizes for guessing who it was). This set should be more challenging and enjoyable!

Invitation

CodeChef invites you to participate in the October Mega Cook-off 2014 at codechef.com/COOK51. This is the Mega Warm-up Contest for ACM ICPC Regionals (India). The top 25 Indian Students shall have their ACM-ICPC expenses reimbursed. Find the details here.



Time: 19th October 2014 (2130 hrs) to 20th October 2014 (0000 hrs). (Indian Standard Time — +5:30 GMT) — Check your timezone.

Details: codechef.com/COOK51/

Registration: Just need to have a CodeChef user id to participate.

New users please register here

- Problem Setter : Anupdeep Nekannti
- Problem Tester: Constantine Sokol
- Russian Translator : Sergey Kulik
- Editorialist: Florin Chirica
- Mandarin Translator: Gedi Zheng & Minako Kojima

It promises to deliver on an interesting set of algorithmic problems with something for all.
The contest is open for all and those, who are interested, are requested to have a CodeChef userid, in order to participate.

Full text and comments »

  • Vote: I like it
  • +60
  • Vote: I do not like it

By anudeep2011, 10 years ago, In English

I really liked the problem COT and concept used in that. So I decided to write a blog post on it.

This is my 2nd blog post

http://blog.anudeep2011.com/persistent-segment-trees-explained-with-spoj-problems/

Full text and comments »

  • Vote: I like it
  • +46
  • Vote: I do not like it

By anudeep2011, 11 years ago, In English

My first blog post :)

Detailed tutorial on Heavy Light Decomposition

http://blog.anudeep2011.com/heavy-light-decomposition/

Full text and comments »

  • Vote: I like it
  • +100
  • Vote: I do not like it

By anudeep2011, 11 years ago, In English

CodeChef invites you to participate in the May Cook-off 2014 at codechef.com/COOK46.

Time: 18th May 2014 (2130 hrs) to 19th May 2014 (0000 hrs). (Indian Standard Time — +5:30 GMT) — Check your timezone.

Details: codechef.com/COOK46/

Registration: Just need to have a CodeChef user id to participate.

New users please register here

- Problem Setter : Anudeep Nekkanti
- Problem Tester and Russian Translator : Gerald
- Editorialist: Praveen Dhinwa
- Mandarin Translator: Gedi Zheng & Minako Kojima

It promises to deliver on an interesting set of algorithmic problems with something for all.
The contest is open for all and those, who are interested, are requested to have a CodeChef userid, in order to participate.

Full text and comments »

  • Vote: I like it
  • +22
  • Vote: I do not like it