Official Account of ACM ICPC. Follow to find solutions to all previous year questions and questions from the latest 2016 edition.

Acm Icpc - Amritapuri

All problems that featured in ACM International Collegiate Programming Contest (ICPC), Asia-Amritapuri Site, 2012 solved in detail by Aswin Ashok. The problems include - The Mirror of Galadriel, Saruman of Many Colours, The Glittering Caves of Aglarond, and Gandalf vs. The Balrog, to name a few. Aswin explains it all in a lucid manner focusing on the key elements.

Programming

English

Solutions to ACM ICPC 2012 Problems

Competitive Programming

ACM ICPC

Competitions

Personal and Skill Development

Develop your coding skills, learn a new language or prepare for campus placements and job interviews, you can do it all with these awesome courses.

Watch the entire lesson to understand the solution of Problem B: Gandalf vs the Balrog. Taking you through every little detail of the problem and the solution, Aswin ensures you understand the nuances - Input (STDIN), Output (STDOUT), Constraints, and more - thoroughly.

Problem B: Gandalf vs the Balrog

Aswin takes you through the detailed solution of Problem D: The Mirror of Galadriel. After explaining the problem and the methodology for its solution, he provides you with other key information - Input (STDIN), Output (STDOUT), Constraints, and more.

Problem D: The Mirror of Galadriel

Comprehensive solution to Problem G: The Glittering Caves of Aglarond. Pay close attention and watch the entire lesson as Aswin will take you through all necessary details - Input (STDIN), Output (STDOUT), Constraints, and more.

Problem G: The Glittering Caves of Aglarond

The lesson provides you a detailed solution to Problem I: Saruman of Many Colours. Having explained, the problem and the methodology for its solution, he provides you with other key set of information - Input (STDIN), Output (STDOUT), Constraints, and more.

Problem I: Saruman of Many Colours

This series aims to take your programming to the next level. The series focuses on aspiring programmers who aim to be better at coding.

Hackerearth Inc.

Get started with Computer Programming in these very well explained lessons. The first two lessons focus on solving problems so that one gets a hang of programming and also provides guidance on the requirements and expectations of a programming problem. It will also help in learning as to how to test one's code via custom I/O. The further lessons discuss introduction to an array- 1-D Array, Multidimensional Array, Types of Strings- CStyle String, C++ Std Class Strings and also learn how string classes are to be used. One would also learn about Standard and File I/O and also study the toolkit (STL) available and discuss how one can utilize the provided inbuilt containers.


Getting Started With Competitive Programming

Through this course, one can learn effective tricks and techniques to find the solution to ACM-ICPC Asia-Amritapuri 2014 onsite contest. The problems which are discussed in this course are Problem D: Matryoksha Dolls, Problem I: Gabba Sprint, Problem E: Kiwi Numbers, and Problem C: Dhonis Bowlers. All the programmers can not only learn these techniques but also they can learn right approach to ace such upcoming contests.

Solutions to ACM ICPC 2014 Problems

In this course, the educator will be rendering solutions to the questions from Amritpuri Regionals 2015. The problems which are solved here are Chota Mouse and his Birthday Cake, Longest Palindrome, Jump on Buildings, and Similar Strings.

Solutions to ACM ICPC 2015 Problems

In this course, the educator has discussed solutions of ACM ICPC Amritapuri 2013 onsite questions. The programming language used in implementation is C++. The problems which are covered in this lesson are ACM ICPC Amritapuri 2013 (onsite) Problem F - Cheap Gold,  Problem I - Death Row, Problem J - The Sacrificial Firepits, and Problem B - Sorted Queues.

Solutions to ACM ICPC 2013 Problems

Software Engineer@Directi; 
Problem Setter@HackerEarth;
For more Programming lessons prepared by me: https://unacademy.in/user/hackerearth

Pulkit Mendiratta

In this collection, we go through the problems of Codeforces Round #370, discuss the methodology to approach the problems and the roadblocks that one might counter while solving them. Problems A,B are straightforward.  Problem C demands some observations, while D requires experience with solving similar problems.

Codeforces Round 370 Tutorial with Explanations and Solutions

In this collection, we go through the problems of Codeforces Round #371(Div-2), discuss the methodology to approach the problems and the roadblocks that one might counter while solving them. Problems A, B are cakewalk problems that require some logical thinking and minimal coding. Problem C has a straightforward solution and requires some hashing mechanism. Problem D is a fun, interactive problem that requires us to exploit the monotonic aspects of the problem to frame a solution.


Lessons

4 lessons • 18m

Invalid Date

NaN

Problem B: Gandalf vs the Balrog

Invalid Date

NaN

Problem D: The Mirror of Galadriel

Invalid Date

NaN

Problem G: The Glittering Caves of Aglarond

Invalid Date

NaN

Problem I: Saruman of Many Colours