The Next Palindrome
I am unable to find the bug in this code.Please help me understand it.Thanks. http://ideone.com/Z62TxA
View ArticleClik here to view.
ANUBTT Editorial
PROBLEM LINK:PracticeContestAuthor:Anudeep NekkantiTester:Gerald AgapovEditorialist:Praveen DhinwaDIFFICULTY:HARD PREREQUISITES:Min Cost Max FlowPROBLEM:You are given tree with N nodes each node being...
View ArticleANUDTC Editorial
PROBLEM LINK:PracticeContestAuthor:Anudeep NekkantiTester:Gerald AgapovEditorialist:Praveen DhinwaDIFFICULTY:CAKEWALK PREREQUISITES:AD-HOC PROBLEM:Given a circle, you can make cuts at positive...
View ArticleANUSAR Editorial
PROBLEM LINK:PracticeContestAuthor:Anudeep NekkantiTester:Gerald AgapovEditorialist:Praveen DhinwaDIFFICULTY:MEDIUM HARD PREREQUISITES:Suffix Array, Suffix Tree, dfs, Segment tree, Fenwick Tree or BIT....
View Articleups and downs ..WHAT WAS MY MISTAKE
include<iostream>using namespace std; void merge(long long int *A,int p,int q,int r) {int n1,n2,i,j,L[1000],R[1000]; n1=q-p+1; n2=r-q; for(i=1;i<=n1;++i) { L[i]=A[p+i-1]; }...
View ArticleANUBGC Editorial
PROBLEM LINK:PracticeContestAuthor:Anudeep NekkantiTester:Gerald AgapovEditorialist:Praveen DhinwaDIFFICULTY:EASY MEDIUM PREREQUISITES:dynamic programming PROBLEM:You are given an integer N. You select...
View ArticleANUUND Editorial
PROBLEM LINK:PracticeContestAuthor:Anudeep NekkantiTester:Gerald AgapovEditorialist:Praveen DhinwaDIFFICULTY:EASY PREREQUISITES:AD-HOC, sorting PROBLEM:Given an array A. Rearrange the array in such a...
View Articlemerging two sorted linked lists
my code doesnt produce output.. please see where iam doing wrong as iam not so gud in dealing with pointers http://ideone.com/SFfesf
View ArticleHow to Solve this Problem?
DIVISION 1:Problem CPlease if someone could provide detailed explanation of this problem.I went through tutorial but couldn't follow much.
View ArticleTABUS - Editorial
PROBLEM LINKSPracticeContestDIFFICULTYEASYPREREQUISITESBinary Search, Dynamic Programming, Graph TheoryPROBLEMYou are given N bus stations and M buses that run between these bus stations. Each bus is...
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 Articlepython vs Java ??
Somebody please answerHere is a very simple spoj question link http://www.spoj.com/problems/JULKA/my python code is getting WA where as the same logic Java code is getting AC why what am i...
View Articleworking of the sizeof operator, containing expressions
I was asked a very interesting question by a friend, he gave me the following code and asked me, to explain the output of the code,include<stdio.h>int main() { int a=2; printf("%d ",sizeof(++a));...
View ArticleMCARDS problem on spoj
how this problem can be solved using LIS dp method www.spoj.com/problems/MCARDS/
View ArticleRuntime error
http://www.codechef.com/viewsolution/3960401 why Run time error? please help!!
View ArticleTask - help
Can anyone help with this task.Given a sequence of N different integers. Operations allowed members of the series are:Move to the beginning of the sequence Move to the end of the sequence Print the...
View Articlegetting TLE for KNAPSACK?
link to question is http://www.spoj.com/problems/KNAPSACK/this is a basic 0-1 knapsack problem , which gets TLE in Python 2.7 i implemented in 1D array not a 2D array even then it gets TLE . c++ gets...
View ArticlePlease Help
I have coded program for this problem . And i ran it on some random test cases and its giving right answer cause i checked it on spoj toolkit also. But then also its giving wrong answer. Please Please...
View ArticleVery hard hashing question.
hey can someone please check my code for SSTORY problem http://www.codechef.com/problems/SSTORYhttp://www.codechef.com/viewplaintext/3937332 i am getting WA and i want to know the reason. i have used...
View ArticleScuba Dive
http://www.spoj.com/problems/SCUBADIV/I need to know how i can solve this problem. I know this can be solved by modifying the basic knapsack problem but i want a complete sort of tutorial for this...
View Article