runtime error (SIGSEGV) in infinite grid game
for this question http://www.codechef.com/problems/IGAME , i am getting runtime error(SIGSEGV) with this solution http://www.codechef.com/viewsolution/2366703 . but there are many successful...
View Articleruntime error
for this question http://www.codechef.com/problems/HS08TEST , i am getting runtime error(NZEC) with this solution http://www.codechef.com/submit/complete/428862-2980--51e1928acc2cf . but there are many...
View ArticleCHEFRECT Logic
I have seen several solutions of July Challenge 13 CHEFRECT. In every solution what people have done is checked for the edge cases and then gave the general answer as (k+1)/2. Could anyone explain how...
View Articleruntime error
how to remove runtime error from the following code:#include<stdio.h> #include<stdlib.h> void main() { int a[2000],i; float n,m,p; a[0]=0; a[1]=1; for(i=2;i<2000;i++) a[i]=a[i-1]+a[i-2];...
View ArticleCALCULAT spoj
http://www.spoj.com/problems/CALCULAT I have been trying solving this problem, I have first tried to calculate first k digits of factorial using stirling approximation but due to precision my code...
View ArticleGALACTIK : getting WA
I an getting WA and I have even considered the case where all planets are connected to each other and the answer is zero for that. please help me. here the the link to my code.http://ideone.com/L5Cenu
View Articledelay in codechef long rating ??
why does it take more than a day for codechef to bring out the rating for long contest ???
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 Articlegalactik: wrong code being AC
It is quite strange that the case 5 0,-1,-1,-1,-1,-1 will give 0 while actual answer is -1..i don't think there was any constraint disallowing all negative costs or 0 connections ans still the code is...
View ArticleWhy does codechef not make test cases public after the contest?
I am wondering why does codechef not make the test cases public post a contest. Others like Topcoder and codeforces lets the users know where they failed and helps rectify the mistake faster. Why cause...
View ArticleFCTRL - TLE
Time limit getting exceeded and also the program not seeming to work for N>=60 in FCTRL question in easy practice problems section. What is wrong with my code?I ran it on gdb and found that as your...
View Articlecheating in july long
http://www.codechef.com/viewsolution/2378808http://www.codechef.com/viewsolution/2372091http://www.codechef.com/viewsolution/2372194http://www.codechef.com/viewsolution/2375687these solutions are same...
View ArticleProblem with Go online judge configurations?
Hello @ all and in particular to the admins,This question has been bugging me for a while, and a previous post I made might have been unclear... So, now, I'll use a concrete example to ask my question...
View ArticleThe probability of winning(PROB)
Finally contest is over and i was not able to solve this problem.Now after seeing couple of solutions i am really perplexed how solution was so simple.In short i just wanted to know how ans is :...
View Articleprint all possible subsequences of string using dynamic programming
how can we print all possible subsequences of string using dynamic programming. for ex . for sequence 1,2,3 the possible subsequences are {1},{2},{3},{1,2},{1,3},{2,3},{1,2,3}
View Articleeditorial july 2013
when will the editorials of the july long contest problems will be uploaded?
View ArticleClik here to view.
CIRKILL - Non-official editorial describing my approach
Well, I shall begin by say that this was by far, the most interesting problem I have managed to solve so far on Codechef and I loved everyday of work on it!! And as I liked it so much, I feel like I...
View ArticleWA in Galactik Football ...
Can't find where I've done wrong... Can any1 give some testcases where it goes wrong... I've considered the case of a single component with type 2 countriesmy code at http://ideone.com/iBh5ly
View Articleinverse modulo
can someone explain why this code works and theory behind itinv[0]=inv[1]=1; for(i=2;i<=max;i++) inv[i] = mod - (((long long)mod/i)*inv[mod%i])%mod;
View ArticleI am getting wrong answer for FCTRL2 .But my code works fine for 100! .Please...
#include<stdio.h> void B(int k); int a[171]; int sum,i; int main() { int k,n,o,l,t,j; scanf("%d",&t); for(j=1;j<=t;j++) {scanf("%d",&n); for(i=2;i<=170;i++) a[i]=0; a[0]=0; a[1]=1;...
View Article