Cow Tours problem from USACO
Cow ToursHi! I'm trying to solve Cow Tours problem on USACO. Here is my code sourceMy code gets fail on 7th test. Can't figure out what's wrong?
View ArticleWA in SPOJ: PLD
Here is this spoj Problemhttp://www.spoj.com/problems/PLD/i am using manacher's algorithm for finding palindromic substring but getting WA, can somebody tell where i am wrong?Here is link to my...
View ArticleIs there any algorithm for "Longest increasing subsequence" with complexity...
I just want to know that while using dp for Longest increasing subsequence we get a complexity of O(n^2). Is there any other algorithm by which we can reduce the complexity??? Please explain the algo...
View ArticleHow to delete my CodeChef user name / account
I would like to delete my CodeChef user name/ account, please let me about the same ?
View ArticleInnovation in Technology With Sure Shot Solutions
As we know innovation is every where in every single mind all around the world, so its always better to collaborate, communicate and brainstorm with the ever growing crowd of people across the globe....
View ArticleData Structures and Algorithms
Hi all, I need your help to make a list of most used data structures and algorithms along with their tutorials, implementation and some problems on them. It will be helpful to everyone in many ways. I...
View ArticleA Dance with Mobius Function
In this post I am going to share my little knowledge on how to solve some problems regarding Mobius Inversion Formula. I chose this topic because it has a lot of varieties of problems (mostly...
View Articlespoj lineup
anwer link-"http://ideone.com/e.js/5jUAHu" type="text/javascript"problem link-http://www.spoj.com/problems/LINEUP/using (dp+bitmask) getting WA in masking i am using set of positions
View ArticleImplementing Suffix Array using bucket sort in java
Lets say we have List of suffixes for String banana - banana, anana, nana, ana, na, a. I was able to put each suffix in a bucket. like suffix that starts from 'a' will be in one bucket and suffix that...
View ArticleWMIS - Editorial
PROBLEM LINK:ContestPracticeAuthor:Sergey KulikTester:Istvan Nagy and Utkarsh Lath and Kevin AtienzaEditorialist:Kevin AtienzaPREREQUISITES:Memoization, backtracking, tree hashingPROBLEM:A greedy way...
View ArticleWhy do I get a SIGSEGV?
Why I am getting a runtime error SIGSEGV in the problem? Where I am going wrong?
View ArticleSpoj - Last Digit - RE
I know that modular exponentiation is enough to solve this problem but I came across a formula on Quora by Divanshu Garg ( http://qr.ae/R753zZ ). Using his formula the problem simply boils down to...
View Articlefft tutorial
hi guys, In recent days, the no of questions that were asked on fft are increasing, i was very anxious to learn fft but couldn't find good tutorials, can anyone suggest good tutorial on fft with...
View ArticleClik here to view.
MAXMATCH - Editorial
PROBLEM LINK:PracticeContestDIFFICULTY:MEDIUMPREREQUISITES:Combinatorics, Dynamic ProgrammingPROBLEM:Given a bipartite graph having partites X and Y. Partite X will contain all permutations of Set S =...
View ArticleADDMUL - Editorial
PROBLEM LINK:PracticeContestAuthor:Devendra AgarwalTester:Mugurel Ionut AndreicaEditorialist:Lalit KunduDIFFICULTY:MediumPREREQUISITES:segment tree, lazy propagation, basic mathsPROBLEM:Given array $A$...
View Article[c++]Why am I getting SIGABRT error ?
I am trying to solve this problem but I am getting a SIGABRT error. Please help me in figuring out why .THANKS IN ADVANCE....#include<bits/stdc++.h> using namespace std; typedef long long ll; int...
View ArticleSEAVOTE - Editorial
PROBLEM LINK:PracticeContestAuthor:Sergey NaginTester:Shiplu HawladerEditorialist:Lalit KunduDIFFICULTY:EASY-MEDIUM PRE-REQUISITES:MathsPROBLEM: Sereja conducted a voting about N of his opinions. Ai...
View ArticleLCH15CD - Editorial
PROBLEM LINK:PracticeContestAuthor:Pavel SheftelevichTester:Roman RubanenkoEditorialist:Paweł KacprzakDIFFICULTY:Easy Medium PREREQUISITES:DP, ImplementationPROBLEM:You are given a n-dimensional cube...
View ArticleWhere can i find tutorial on String Matching using Suffix arrays?
Where can i find Tutorial on String matching using Suffix Arrays ? Everywhere on codechef ,codeforces , GeeksforGeeks there are tutorial on how to construct a Suffix Array , but no where i found how to...
View ArticleEuler path
Hi, i am trying to solve http://www.spoj.com/problems/WORDS1/ on spoj,i came to know the problem is about checking the graph has euler path or not.Any one please tell me how to check if a graph has...
View Article