Difficulty level of June Challenge 2013
Hello all , I think this contest was much easier with the most difficult problem getting more than 100 successful submissions . I think the long contest should have 2 HARD problems definitely . That...
View Articleusaco gateway down?
is usaco gateway down for everyone. I've tried from three different connections and cleared the browser cache and cookies.ace.delos.com/usacogate
View ArticleStrange thing happened while solving COLLECT
Here is my first and second solution for this problem. The only difference in these two solution is, former have an array ifact[3000000] (which i didn't use) and later don't.First code has nothing to...
View ArticlePracticing Algorithms
I started using codechef just a few months ago. Should I practice on other sites(topcoder,projecteuler) as well?? Or is practicing on codechef alone is sufficient ??
View Articlesmall factorial
import java.util.*; import java.io.*; import java.math.BigInteger; class test { public static void main(String [] args) { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); try{...
View ArticleWSTRING - Editorial
Problem Link:PracticeContestDifficulty:EasyPre-requisites:Dynamic ProgrammingProblem:A W-String is defined as a string consisting of lower-case alphabets, and exactly 3 "#"s that divide the string into...
View ArticleCOLLECT - Editorial
Problem Link:PracticeContestDifficulty:MediumPre-requisites:CombinatoricsProblem:You are given a line of bushes from 1 to N, each having C[i] berries. A query (L, R) scenario is as follows. K tourists...
View ArticleDELISH - Editorial
Problem Link:PracticeContestDifficulty:SimplePre-requisites:Dynamic ProgrammingProblem:Given an array D[1...N], find max(abs((D[i] + ... + D[j]) - (D[k] + ... D[l])) : 1<= i <= j < k <= l...
View ArticleCOLLECT alternative
hey! i was wondering that is there any other way to solve such problems except using segment tree(for finding the sum in the range) and using (factorial,inverse factorial,dynamic programming , so that...
View ArticleSPMATRIX - Editorial
Problem Link:PracticeContestDifficulty:HardPre-requisites:Math, CombinatoricsProblem:You are given N. Count how many NxN matrices are there, satisfying the following conditions: (a) M[x][x] = 0 (b)...
View ArticleWeak test cases for TKCONVEX.
The test cases for the problem TKCONVEX are very weak. Even though the problem was rejudged during the contest, still I am able to find many solutions which fail very simple test case.8 4 1 2 3 6 6 6 6...
View ArticleC++ Vs. JAVA The unending time limit war
Yet again i was disappointed when my solution for spmatrix gave TLE in JAVA but was accepted in C++. The people managing the contests are pure geniuses, practically running the programming world. Why...
View ArticleProblem in submitting solutions
I am having a problem in submitting the solution. Till yesterday everything was fine but today when i am submitting my solution for TSORT, its showing me that my codes are running but there is no...
View ArticleSubmition Result evaluation not completing
Hi all,I am trying to solve the is question http://www.codechef.com/problems/AMSGAME1 as a practice question , but when I submit the result keeps on being evaluated for ever. Am i missing out anything...
View ArticleHave I lost memory on my hard disk due to memory leakage?
Until now I have always forgotten to free() the ptrs after use. I came to know now that this leads to memory leaks. Have I lost some bit of memory on my hard disk? How do I "free" it?
View ArticleNZEC error in python for WSTRING
I got NZEC error in my submission. It works on my computer and I,ve got no idea what the problem is. Here is my code:t=input(); while(t): s=raw_input() l=len(s) m=[0,0,0,0] j=0 k=0 ans=0 while(j<l):...
View ArticleProblem with Tic Tac Toe Tomek- GCJ question
This is regarding the problem Tic Tac Toe Tomek asked in round 0 of Code Jam this year. link:tic tac toe tomek. I had got correct for both small and large input at code jam but it is showing WA here at...
View Article