StopStalk: Tool to maintain your algorithmic progress
Hello Coders,Hope you are having a great time coding hard. Here I present to you a Utility tool - StopStalk which will encourage you to keep your algorithmic progress going by coding with your friends...
View ArticleDoubt in Time complexity
There is a question Chef and Numbers. According to Editorial it is purely based on FFT having overall time complexity $O(n * log(n))$. But after crawling other solution i found one of the solution...
View ArticleSPOJ - Problem AGGRCOW - Aggressive cows
I cannot understand how binary search will solve the problem.Problem statement is hereNeed Help! Thanks :)
View ArticleChef and Array-Editorial
PROBLEM LINK-https://www.codechef.com/problems/EXPCODE1Author:https://www.codechef.com/users/vivek96DIFFICULTY:EASYPREREQUISITES:Array,SortingPROBLEM:Being a programmer, Chef like arrays lot. On Chef'...
View ArticleLEDIV - Editorial
PROBLEM LINKPracticeContestDIFFICULTYSIMPLEPREREQUISITESSimple MathPROBLEMYou are given a list of numbers. You have to find the smalelst number which divides all these numbers.QUICK EXPLANATIONTo the...
View ArticleDataBread : Tool to Track your Algorithmic Ratings.
Hello Coders,Hope you are having a great time. I take the pleasure in introducing you to DataBread where you can see all your friends ratings from different competitive programming websites (Codechef,...
View ArticleCan someone please provide me with Editorial of Problem BASE (December Long...
Contest Problem here Practice Problem here Also the link for the Editorail doesn't works (https://discuss.codechef.com/problems/BASE)
View ArticleChef and Ola Cab-Editorial
PROBLEM LINK:https://www.codechef.com/problems/EXPCODE2Author:https://www.codechef.com/users/vivek96DIFFICULTY:EASYPREREQUISITES:Basic Maths,Math FunctionsPROBLEM: Chef want to book Ola Cab,he have to...
View ArticleEasy One-Electricity Bill Editorial
Problem Link:https://www.codechef.com/problems/EXOCODE7/Author:https://www.codechef.com/users/vivek96DIFFICULTY:CakewalkPREREQUISITES:basic programming,basic mathsPROBLEM:Chef wants to calculate his...
View ArticleALEXNUMB - Editorial
Problem: You are given an array of N numbers. You are to find the number of pairs of numbers in the array s.t a[i] < a[j].Solution: First you find the set of all distinct elements in the array...
View ArticleChef and Palindrome Editorial
Problem Link:https://www.codechef.com/problems/EXOCODE3Author:https://www.codechef.com/users/vivek96DIFFICULTY:MediumPREREQUISITES:Algorithms,Hashing,Array,StringPROBLEM:Chef like palindrome strings...
View ArticleChef and Array Update Editorial
Problem Link:https://www.codechef.com/problems/EXOCODE4Author:https://www.codechef.com/users/vivek96DIFFICULTY:CakeWalkPREREQUISITES:Basic Programming,ArrayPROBLEM:Chef Purchased an array A having N...
View ArticleChef and Weird Spider Editorial
Problem Link:https://www.codechef.com/EXCO2017/problems/EXOCODE6Author:https://www.codechef.com/users/vivek96DIFFICULTY:EasyPREREQUISITES:Conditional statements and loops,Basic ProgrammingPROBLEM:Chef...
View ArticlePlease share , Your Logic for solving INTERVAL feb17
What was the logic in this question . I could solve it only for m=2 . Please explain the logic in simple way , I am a mere beginner.
View ArticleEditorial for KBIGNUMB required!!
Can someone post the solution or references for this question. https://www.codechef.com/FEB17/problems/KBIGNUMB
View ArticlePlease Correct my logic for SCHEDULE March 17
I calculated all the continuous lengths(1,2,6,7....) , then I went on reducing k(k--) to convert all segments(l_seg) of a particular length (z) into three segments of lengths 1,(2 of l_seg/2)(odd),...
View ArticleHS08TEST - Editorial
PROBLEM LINK:PracticeAuthor:ADMINEditorialist:SUSHANT AGARWALDIFFICULTY:CAKEWALKPREREQUISITES:Basic looping,Basic Input/Output,Data TypesEXPLANATION:Please refer to the sample solution given by...
View ArticleInvitation to Alkhwarizm-2017
The much awaited signature event of IIIT Allahabad's Tech Fest Aparoksha 2017- ALKHWARIZM is here to endeavour with a challenging problem set. It will be a 5 hour individual contest with algorithmic...
View ArticleCHEFYODA unofficial Editorial
CHEFYODAContest link Let's consider Game1 in which only horizontal and vertical movements are allowed, One can easily see that yoda wins only when both N and M are odd.In the other game, chef wins only...
View ArticleSPOJ - HISTOGRA - Largest Rectangle in a Histogram help needed
Since I couldn't solve the problem myself, I read up the concept and codes and managed to get it submitted via a Divide and Conquer (divide from middle) approach and a stack based O(n) solution. I also...
View Article