simple sum november long challenge 2015
why i am getting wrong answer in simple sum problem .here is my solution for third subtask my ans is showing wrong answer.detailed explaination http://ideone.com/SkihXn
View ArticleEGRCAKE - Editorial
PROBLEM LINK:PracticeContestAuthor:Egor BobykTester:Istvan NagyEditorialist:XellosDIFFICULTY:SIMPLEPREREQUISITES:Greatest common divisor.PROBLEM:We have a permutation $\texttt{P}[0..N-1]$ with...
View ArticleDijkstra with multiplication between nodes
Consider a complete bidirectional weighted graph. Weight of each edge (a,b) is the probability of getting from a to b. So all weights are in range (0,1]. There is a path between a and b if the...
View ArticleClik here to view.
A tutorial on Suffix Arrays
Hello @all,This text will focus on the construction of Suffix Arrays, it will aim to explain what they are and what they are used for and hopefully some examples will be provided (it will be mainly...
View ArticleNeed help with Binary Search problem 'PIE' on spoj
Although this problem is tagged with "binary search" but still I am not able to come up with a solution using it. Please help with the underlying concept (solution and any further analysis also,if...
View ArticlePriority_Queue..
I was trying to implement some data structures using priority queues just then i found something likepriority_queue< pair < int, int>, vector< pair< int, int> >, greater<...
View ArticleMaximum Magic Walk - Editorial
Problem Link:ContestPracticeAuthor:sumeet-varmaTester:amankedia1994Editorialist:sumeet-varmaDifficulty: MediumPre-requisites: - Dynamic Programming, GraphsProblem: Find a walk in the graph for which...
View ArticleSubarray Sum - Editorial
Problem LinkPracticeContestAuthorRishab PatiTesterRajat DeEditorialistRajat DeDifficulty MediumPre-requisites - Maths , Modulo , Pigeonhole PrincipleProblem: Find all numbers which will definitely...
View ArticleAcyclic Graph- Editorial
Problem Link:ContestPracticeAuthor:amankedia1994Tester:legend-killerEditorialist:sumeet_varmaDifficulty: Easy - MediumPre-requisites: - Bipartite GraphsProblem: Given an acyclic graph with N nodes and...
View ArticleWhat are the compiler options that the judge uses?
Some languages are weirdly slow on some problems. Do they have optimization enabled/disabled while compiling? Does the online judge use any specific options while compiling my program? Is there a way...
View ArticleZCO Practice Questions
ZCO Practice Contest Questions are unable to access in the Peer problems section.
View ArticleSources for INOI and IOITC preparation ?
Hi all, I'll be preparing for INOI this year(with hope that I clear ZIO/ZCO), so, what are some good books/websites/courses/or even anything at all that can aid one in preparation. Similar questions...
View ArticleGCD on a tree - Editorial
PROBLEM LINK:PracticeContestAuthor:Aman KediaTester:Sumeet VermaEditorialist:Sidhant BansalPrerequisites - Centroid Decomposition Difficulty : Medium - Hard Expected Complexity: O(NlogNd) where d =...
View ArticleMagical Strings - Editorial
PROBLEM LINK:PracticeContestAuthor:Sumeet VermaTester:Aman KediaEditorialist:Sidhant BansalPrerequisites - Pigeon Hole Principle, Disjoint Set Union Difficulty : Easy - Medium Expected Complexity:...
View ArticlePoker Chips - Editorial
PROBLEM LINK:PracticeContestAuthor:Rishav PatiTester:Rajat DeEditorialist:Sidhant BansalDifficulty : Cakewalk - Easy Expected Complexity: O(A_MAX * N * N) Editorial -The array should be an arithmetic...
View ArticleCount Permutations - Editorial
Problem Link:ContestPracticeAuthor:Rajat DeTestor:Aman KediaEditorialist:Rishav PatiDifficulty: Easy - Medium Topics: Basic Combinatorics, Recusive FunctionsProblem:- Given a number $n$ which is of the...
View ArticleSEATR - Editorial
PROBLEM LINKPracticeContestPanel MembersProblem Setter:Sergey NaginProblem Tester:Istvan NagyEditorialist:Sunny AggarwalContest Admin:Praveen DhinwaRussian Translator:Sergey NaginMandarin Translator:Hu...
View ArticleImplementation problem in segment tree problem
I am solving http://www.spoj.com/problems/HORRIBLE/ ,which is crashing on entering the first query.I am yet to implement the add function,but update function is not working .long long int a[10000000];...
View ArticleShinigami and Apples - Editorial
Prerequisites : DP , MathsDifficulty : MediumExpected Complexity : O(N*M + T).Editorial :The very first thing to observe is that since each of the apple received is distinct , one of the ways is surely...
View ArticleMax Subarray GCD - Editorial
Prerequisites : Binary Search , GCD PropertiesDifficulty : Easy - MediumExpected Complexity : O(N * logn * p) , p = max number of steps to calculate GCD.Editorial :The most basic property of GCD is :...
View Article