NZEC Error in Java Code problem DRGHTS
I had written the code of DRGHTS in Java. But I couldn't get why I am getting NZEC error in the solution. The Question code is http://www.codechef.com/FEB14/problems/DRGHTSWhen I re-wrote the same code...
View ArticleMaking a program parallel in Java - HELP
Hello @all,I've only learnt a bit about parallelization of programs, but, I'm now facing what seems to be an embarassingly parallel situation.I simply need to compute and list ALL twin primes below N...
View ArticleWhy am i getting wrong answer?
I have been trying the problem WALK and codechef is telling that iam submitting a wrong answer. Can you correct my code.#include<stdio.h> #include<stdlib.h> int main() { int i,N,T,max,test;...
View ArticleHDELIVER - Editorial
PROBLEM LINKSPracticeContestDIFFICULTYEASYEXPLANATIONRestating the problem in terms of Graph Theory, we're given a set of edges, and we've to identify if two given query points are connected via these...
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 ArticleREIGN - Editorial
PROBLEM LINK:link:ContestAuthor: @kostya_byTester: @white_kingDIFFICULTY:EasyPROBLEM:This can be solved using dynamic programming. Call best_forward[i] to be the maximum prosperity of a sequence that...
View ArticleCan not find the editorial for REIGN?
http://www.codechef.com/problems/REIGN editorial of this problem showing not found....y is it so??
View ArticleNeed explanation for CLRS Solution 3-3.
I am currently studying "Order of growth" from 3rd edition. I was not able to understand the solution for the problem 3-3(b) problem : Give an example of a single non-negative function f(n) such that...
View ArticleBEX - Editorial
PROBLEM LINKSPracticeContestDIFFICULTYEASYPREREQUISITESStack Data StructurePROBLEMHarry has a lot of books messed on the floor. He keeps a pile of books. At any time, he can put a book that has some...
View ArticleDynamic programming problems with bitmasking
Hi all,Please suggest some DP problems that involve bitmasking in the increasing order of difficulty level on any online judge.Thanks
View ArticleDynamic Programming with bitmasking
I am unable to solve the problem http://www.spoj.com/problems/COURIER/ please help me how to solve this problem . I have seen a solution but not able to get the logic. Please help me out :(
View ArticleThe output is right for walk in march 2014 contest but the online compiler of...
please somebody help me .This is my first code submission to codechef.
View Articleregarding the street problem of march 14 contest
plz give another set of input with its output
View Articlebest way to sort an array
pleas can anyone tell me best way to sort an array.....also explain its algorithm and its working. best way means least complexity.
View ArticleBinary tree structure in this case.
Imagine a binary tree lying on the floor with nodes as balls and edges as threads, you are given a pointer to a node. When you pick the tree from that node up what will be the structure of the tree....
View Articlefinding subsets in an array
Pls suggest an algorithm to find the maximum no. of subset of length k in an array of length m where k<=m , having sum equal to a constant factor...e.g an array of length 112 5 1 2 4 1 6 5 2 2 1k=6,...
View ArticlePresent and future of the Competitive Programming proposal on Stack Exchange
As you may already know, the Competitive Programming proposal as a Stack Exchange Q&A site is closed in 64% of its commitment phase by a moderator with a short notice. I've created a question...
View Articlesmall factorials , FCTRL2 . why my code is not working??
#include<stdio.h> long int f(int); int main() { int t,n; scanf("%d",&t); if(t>=0 && t<=100) while(t) {scanf("%d",&n); if(n>=0 && n<=100) printf("%ld\n",f(n));...
View Article