REIGN - Editorial
PROBLEM LINK:link:ContestAuthor: kostya_byTester: white_king DIFFICULTY:EasyPROBLEM:This can be solved using dynamic programming. Call best_forward[i] to be the maximum prosperity of a sequence that...
View ArticleFew Advancements that can be done in codechef.
Hi,@admin First of all congratulations for doing a fantastic job of teaching India code.I would like to suggest that in practice problems if you categorize the problems according to algorithms type it...
View ArticleWA in CVOTE (a question of jan challange 2013)
I am getting wrong answer in this problem. code is code Link of problem cvote
View ArticleGetting WA on a cake-walk simple problem. Please help!!
I read the Editorial. It's basically the same thing. Still getting WA. I'm very confident that the code is correct :( Please please review. My life is at a standstill :(Problem:...
View ArticleHelp with backtracking
I have had really hard time understanding backtracking algo's.could someone please post some tutorial or some easy questions to begin with bactracking that could explain the concept as well
View ArticleWA in SPOJ BYTESM2(Philosophers Stone). Help Please.
problem link: http://www.spoj.com/problems/BYTESM2/my solution: http://ideone.com/xGffsf another solution: http://ideone.com/LFHa8A getting wrong answer can't figure out why. please help.
View ArticleKAN13A - Editorial
PROBLEM LINK:PracticeContestAuthor: Dr. Mustaq Ahmed Tester:Jingbo ShangEditorialist:Jingbo ShangDIFFICULTY:Easy - MediumPREREQUISITES:Dynamic ProgrammingPROBLEM:Given a M×N matrix Price (M days, N...
View ArticleKAN13A_HARD_DISK
Please explain OPT[D'][T']= Price[D'][T']+min_(D<D',T'≠T){OPT[D][T]–Price[D'][T]+100} in detail. Unable to understand representation.
View ArticleDEC13 Ranking update taking so long !
Now that all the rejudging is over, why is it taking so much time for the ranking update to happen?
View ArticlePREDICT - Editorial
Problem Link:PracticeContestDifficulty:EasyPre-requisites:ProbabilityProblem:In a game between team A and team B, you are given the probability that team A will win. If you bet M rupees on team X, and...
View Articleruntime error when test case is more than 1(chef and codes)
#include<stdio.h> //#include<conio.h> #include<string.h> #include<ctype.h> typedef struct string { char c,map; int occ; }string; string s[26]; void swap(int i,int j); int main()...
View Articleis there some sort of memory limit in the solutions we submit..is it okay to...
i have this code for TSORT...it works fine on my computer but gives run time error SIGSEGV ..pls have a look at it and tell me whats the bug...thanks...#include<stdio.h> void partition(unsigned...
View ArticleDecember Challenge ranking update
@admin It is been almost 5 days since the contest is over still rankings have not been updated yet. Why is it taking so much time?
View ArticleTLE for O(R+log Q) but not for O(Q)? MARBLEGF Problem
My submission for the MARBLESGF prob(Dec13 Long) was based on the idea that I store the initial sum a[o] to a[i] in s[i], and then keep a track of all the changes made, so that whenever sum is asked...
View ArticleMismatch of scores in SMPAINT submissions page and rank tab.
The scores in SMPAINT submissions page and in rank tab seems to be different. Is the rejudging over?
View ArticleCHODE - what is wrong with this code?
I have submitted it around 40 times, with minor changes in each submission, but it ended up in WA every time. I'm not able to detect the error in my code. It does this -fs=qwrtyuipasdfgjkzxcvbnmheol...
View ArticleUsing fflush gives WA
These two codes are the same: code1 and code2, the only difference being that I have used fflush(stdin) in the second code to omit the newline character while taking two strings as input one after the...
View ArticleQTREE6 weak test cases
Please check the testcases for problem QTREE6 and take a look at my solution.
View Articlewhat is buffer
actually what is buffer why the values will be stored in buffer during programming
View Article