SPECOPS CODEX
http://www.codechef.com/CODX2014/problems/REN2013J can somebody explain how to apply lazy propagation for this problem
View Articleobstacle course
how to solve when the cones are in the same straight line.. unable to figure it out..:( even by applying MST (kruskal/prims)
View ArticleParser to fetch contest testcases for C++
Is there a plugin for any C++ IDE to fetch testcases during online contests(codechef,codeforces or any other for that matter) like one Egor has for Intellij(java)UPD 1:By testcases here I mean pretests...
View Articlewrong answer lucky lucky number
http://www.codechef.com/viewsolution/3283094 pls help thanks in advance
View ArticleSUBSET SUM problem in CODEX 2014
Problem link : http://www.codechef.com/CODX2014/problems/REN2013DPlease help me how to solve this problem and how this problem is different from standard subset sum problem(NP PROBLEM).The only way i...
View ArticleCODE-X Prize distribution
All the winners will be contacted by Tuesday, Top 3 will be getting prizes and Top 20 will be given certificates. Only Indian Contestants are being considered for prizes, but certificates are for...
View ArticleDifference between getchar() & getchar_unlocked()
getchar_unlocked() is usually used to get faster input.But I have not understood the difference between the getchar_unlocked() and getchar(). Also, why is getchar_unlocked() faster and what does the...
View Articleabout algoritms
**how we learn algorithms and from where we start to read algorithms?i am not able to solve even easy problemsplz!!!!!!! suggest me**
View ArticleKGP13F - Editorial
PROBLEM LINK:PracticeContestEditorialist:Jingbo ShangDIFFICULTY:EasyPREREQUISITES:Pick's TheoremPROBLEM:Give a 4-point polygon (integer coordinates), find out how many integer points inside or on the...
View ArticleHow to study :)
Hello @all,As we are here to study algorithms and, as a great way of doing it is by reading books/editorials, knowing how to read them in "the correct way" can sometimes be the difference between...
View ArticleGetting TLE in PT07Z spoj(Longest path in a tree) in java. Please help
problem link: http://www.spoj.com/problems/PT07Z/I have used both double BFS and double DFS for this but getting TLE for both approaches while these two approaches worked for C/C++ users. What can I do...
View Article【When will Rank of CodeX 2014 be shown?】
Hav bein waitin 4 nearly 3 hours now. When ll it show up?
View Articleexternal contests
I just want to ask that why don't you put the questions of the external contests in the pratice section so that one can solve them later ,as you do for the questions of the long and cook offs ??
View Article【Will the CodeX's rank contribute to our ratings?】
Is it only a contest? (I'm a fresher to codechef) But will it not do anything to the short contest's raking and aslo not to long contest rating?
View Articlenot able to submit code for test
#include <iostream> using namespace std; int main() { int n=0; while(true){ cin>>n; if (!(n==42)) cout<<n<<endl; else break; } return 0; }
View ArticleACM ICPC Amritapuri Regionals 2011 A
I am trying to solve this problem : http://www.spoj.com/problems/AMR11A/Here is a link to my solution http://ideone.com/8ebZDjI am first using the usual dp method of finding best path through a 2D...
View Articleprintf and scanf for pair
why printf and scanf do not work when we use statements like this- pair < int, string> f[10001]; scanf("%s %d",f[i].second,&f[i].first);//where 0<=i<=10000 but cin and cout works :(
View ArticleTEXT submissions
I have seen some problems like EASYPROB were submitted in TEXT. What does TEXT actually mean?How to submit in TEXT? Can anyone explain?
View ArticleSPOJ problem---IITKWPCA ..is there any case left?
import java.io.*; import java.util.Arrays;class IITKP{ public static void main(String ar[])throws Exception{ DataInputStream s=new DataInputStream(System.in); int t=0,len=0,x=0,count=0,i=0;...
View Articlebasic graph algo related problems
Can anyone provide me the list of problems related to graph algos like 1.BFS, DFS 2.Euler's path 3.prim and kruskal for minimum spanning tree 4.dijkstra , bellman ford for shortest path 5.warshall If...
View Article