“I’d rather be a failure at something I love than a success at something I hate.” — George Burns
“You live and you learn — at any rate, you live.” — Douglas Adams
“A problem worthy of attack proves its worth by fighting back.” — Paul Erdos
HomeAboutContact
~
HomeAboutContact

Z. Extras

Getting Started with Competitive Programming

(an NPTEL course)

Home ⸱ Quick Links ⸱ Grading Policy ⸱ References ⸱ FAQ ⸱ Feedback ⸱ Connect ⸱ Credits

Module Z. Extras

Go back to Week 1

Here is a list of a few more ad-hoc and implementation based problems that you can try!

  1. AtCoder Beginner Contest 209 — AtCoder Beginner Contest 209, Task B

    2. Just follow along with the problem statement :) You can either reduce prices one by one, or just subtract N/2 from the sum directly to estimate the discounted cost.

  2. Food Chain — CodeChef Starters 7 Division 3

    3. Execute repeated division for a log-number of steps.

  3. UVA 00725 - Division

    4. This one has a straightforward brute-force solution involving going over all possibilities.

  4. Wonderful Coloring —  Codeforces Round #734 (Div. 3), B1

    5. A simple observation determines the answer and you just have to return the right expression.

  5. Snapper Chain — Google Code Jam 2010, Qualification Round

    6. Hint: think about a bitstring that represents the states of the chain, and how snapping causes this bitstring to evolve.

super-embed:<div id="hyvor-talk-view"></div><script async defer type="text/javascript" src="//talk.hyvor.com/web-api/embed.js"></script>