Implementation of Heavy-Light Decomposition
People who can please write Implementation of Heavy-Light Decomposition(with comments if you can). Couldn't find any good implementation.Thanks!!!
View ArticleSorting in alogorithm::sort
which sorting method is used in algorith::sort?? pleasse explain cause i am getting tle in quicksort and ac with this inbuilt sort.
View Articlehow many minimum operations, you perform for this ??
You have n friends having some marbles initialy let ith friend has Mi marbles.you have infinite number of marbles. and you can perform folowing operation to equalize the marbles among your friends1.you...
View Articleprime generator
how to generate all the prime numbers upto 1000000000 in 6 seconds using c++
View ArticlePOJ Challenge Contest Round #1
Hello,everyone!POJ Challenge Contest #1 will take place on Sunday, June 2th at 14:00BST@ http://poj.openjudge.cnThe difficulty of problems in this contest will vary largely from the easiest to the...
View ArticleHow can I inform everyone about any contest?
Hello everyone,Can anyone tell me, how can I inform users of codechef about any other contests? I have to post it in Discuss?
View ArticleONP Transform the Expression, my code and its logic is Written below please...
include <iostream>include <stdio.h>include <cstdlib>include <string.h>using namespace std;int main() { int t; // cin>>t;char ch[401]; int i=0,j; scanf("%s",ch); getchar();...
View ArticlePrime Problems
The problem statement is: The sum of the primes below 10 is 2 + 3 + 5 + 7 = 17. Find the sum of all the primes below two million.can anybody help me with a shortest algorithm for this problem
View Articleturbo sort problem
#include<iostream> #include<algorithm> using namespace std; int main() { int t; cin>>t; int array[t]; if(t<=10*10*10*10*10*10) { for(int i=0;i<t;i++) { cin>>array[i]; }...
View ArticleCROWD - Editorial
PROBLEM LINK:PracticeContestDIFFICULTYSIMPLEPREREQUISITESSimple Math, Repeated SquaringPROBLEMHow many sequences of 0s and 1s of length N are there such that there are at least 3 consecutive 1s.QUICK...
View Articlethis is one of the solutions i found to the problem in most blogs but why 120...
A machine is purchased which will produce earning of Rs. 1000 per year while it lasts. The machine costs Rs. 6000 and will have a salvage of Rs. 2000 when it is condemned. If 12 percent per annum can...
View ArticleHow do I get out of a botched up registration?
Hello, all.I'm not sure if this is the right place to ask this question, but here goes anyway.I registered myself up with CodeChef last evening using a different handle. Unfortunately, however, I'm yet...
View ArticleTLE in ROWCOLOP and Discussion on fast input using getchar_unlocked()
this is my code. It is showing TLE.http://ideone.com/lGccrhWhen i used scanf in place of scan() here... i got AC. But when i used getchar_unlocked it shows TLE.I don't know much about...
View Articleif i want to contact another person on codechef how to send an im or a message
like how to contact the guy via e mail or something
View Articleis there an efficient code to find ramanujan numbers in say under a minute of...
please explain the solution code with comments at appropriate places
View Articledna sequence matching problem....
i am getting a trouble finding an approach to solve this problem.... input-output sequences are as followsinput1 : aaagctgctagag output1 : a3gct2ag2input2 : aaaaaaagctaagctaag output2 : a6agcta2aginput...
View ArticleAs fast as Python AC solution but still TLE
Hello everyone. For the May Long Contest's problem MSTICK, I came out with a python solution which is as fast as the AC ones I checked when the contest ended. However, my solution got TLE. Can someone...
View ArticleMarking solved problems not working in MAY 2013 contest (1.4)
I realized that my Chrome extension is not working in MAY 2013 long contest...related to - http://discuss.ww2.codechef.com/questions/3011/a-green-mark-for-solved-practice-problems
View ArticleIs it possible to contact the users of this forum?
I have a doubt. Can I contact other users of the forum personally?
View Article