nuke getting wrong answer
this is my code...i am continuously getting wrong answer .......please help me out #include<stdio.h> int main() { unsigned long A; int N,K,i,j; scanf("%d%d%d",&A,&N,&K); int x[100];...
View ArticleNeed help on how to start solving difficult questions
hello guys,i need some help on how to get more comfortable in solving good problems though i am not so new to coding but still i am unable to solve difficult problems. In each contest i manage to solve...
View ArticleCheating in June Long Contest 2013
Just want to bring it to the admin's notice. Problem - http://www.codechef.com/JUNE13/problems/SPMATRIX Following set of solutions by different users are same:...
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 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 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 ArticleDifficulty 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 ArticleMy rank is showing NA even after the contest is over.
http://www.codechef.com/users/architsmat38 I am getting my rank as NA even after the June Challenge is over. it says that "we are not able to find country code for you ". I have already registered my...
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 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 ArticleDISCUSSION FOR LEMOUSE
Please elaborate the explanation on LEMOUSE JUNE CHALLENGE 2013.
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 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 Articlewhats wrong in my linked list!!!
hey whats wrong in my linked list...its goin into infinite loop in DEV C bt running in turbo c.#include <stdio.h> #include <malloc.h> /* structure containing a data part and link part */...
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 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 Article